Trees of classifiers for detecting email spam
    32.
    发明授权
    Trees of classifiers for detecting email spam 有权
    用于检测电子邮件垃圾邮件的分类树

    公开(公告)号:US07930353B2

    公开(公告)日:2011-04-19

    申请号:US11193691

    申请日:2005-07-29

    IPC分类号: G06F15/16

    CPC分类号: H04L51/12

    摘要: Decision trees populated with classifier models are leveraged to provide enhanced spam detection utilizing separate email classifiers for each feature of an email. This provides a higher probability of spam detection through tailoring of each classifier model to facilitate in more accurately determining spam on a feature-by-feature basis. Classifiers can be constructed based on linear models such as, for example, logistic-regression models and/or support vector machines (SVM) and the like. The classifiers can also be constructed based on decision trees. “Compound features” based on internal and/or external nodes of a decision tree can be utilized to provide linear classifier models as well. Smoothing of the spam detection results can be achieved by utilizing classifier models from other nodes within the decision tree if training data is sparse. This forms a base model for branches of a decision tree that may not have received substantial training data.

    摘要翻译: 利用分类器模型填充的决策树利用电子邮件的每个功能使用单独的电子邮件分类器来提供增强的垃圾邮件检测。 这通过定制每个分类器模型提供了更高的垃圾邮件检测的概率,以便于在逐个特征的基础上更准确地确定垃圾邮件。 分类器可以基于诸如逻辑回归模型和/或支持向量机(SVM)等线性模型来构建。 分类器也可以基于决策树构建。 基于决策树的内部和/或外部节点的“复合特征”也可以用于提供线性分类器模型。 垃圾邮件检测结果的平滑可以通过使用来自决策树内的其他节点的分类器模型来实现,如果训练数据是稀疏的。 这形成了可能没有接收到大量训练数据的决策树的分支的基本模型。

    Systems and methods for tractable variational approximation for interference in decision-graph Bayesian networks
    33.
    发明授权
    Systems and methods for tractable variational approximation for interference in decision-graph Bayesian networks 失效
    用于决策贝叶斯网络干扰的易变性近似的系统和方法

    公开(公告)号:US07184993B2

    公开(公告)日:2007-02-27

    申请号:US10458166

    申请日:2003-06-10

    IPC分类号: G06F17/00 G06N5/02

    CPC分类号: G06N7/005 G06N5/04

    摘要: The present invention leverages approximations of distributions to provide tractable variational approximations, based on at least one continuous variable, for inference utilization in Bayesian networks where local distributions are decision-graphs. These tractable approximations are employed in lieu of exact inferences that are normally NP-hard to solve. By utilizing Jensen's inequality applied to logarithmic distributions composed of a generalized sum including an introduced arbitrary conditional distribution, a means is acquired to resolve a tightly bound likelihood distribution. The means includes application of Mean-Field Theory, approximations of conditional probability distributions, and/or other means that allow for a tractable variational approximation to be achieved.

    摘要翻译: 本发明利用分布的近似来提供基于至少一个连续变量的可容易的变分近似,用于在本地分布是决策图的贝叶斯网络中的推理利用。 采用这些易于理解的近似来代替通常难以解决的难以确定的精确推论。 通过利用应用于由包括引入的任意条件分布的广义和组成的对数分布的Jensen不等式,获取用于解决紧密约束似然分布的手段。 该方法包括平均场理论的应用,条件概率分布的近似,和/或允许实现易处理变分近似的其他方式。

    INVENTORY MANAGEMENT
    34.
    发明申请
    INVENTORY MANAGEMENT 审中-公开
    库存管理

    公开(公告)号:US20110258045A1

    公开(公告)日:2011-10-20

    申请号:US12761961

    申请日:2010-04-16

    摘要: Various embodiments provide techniques for inventory management. In one or more embodiments, a probabilistic model is constructed to represent an inventory of ad impressions available from a service provider. The probabilistic model can be based on a traffic model that describes historic interaction of clients with the service provider using various attributes that define the ad impressions. The probabilistic model provides a distribution of the attributes and relates the attributes one to another based on dependencies. When an order from an advertiser for ad impressions is booked by the service provider, the probabilistic model is updated to reflect an expected probabilistic decrease in the inventory of ad impressions. The updated probabilistic model can then be employed to determine whether the inventory of ad impressions is sufficient to book subsequent orders for ad impressions.

    摘要翻译: 各种实施例提供了用于库存管理的技术。 在一个或多个实施例中,构建概率模型以表示可从服务提供商获得的广告展示的库存。 概率模型可以基于描述客户端与服务提供商的历史交互使用定义广告展示的各种属性的流量模型。 概率模型提供属性的分布,并根据依赖关系将属性相互关联。 当广告客户对广告展示的订单由服务提供商预订时,概率模型将被更新,以反映广告展示广告资源的预期概率下降。 然后可以使用更新的概率模型来确定广告展示的广告资源是否足以预订广告展示的后续订单。

    ADVERTISEMENT INVENTORY MATCHING
    35.
    发明申请
    ADVERTISEMENT INVENTORY MATCHING 审中-公开
    广告库存匹配

    公开(公告)号:US20110246312A1

    公开(公告)日:2011-10-06

    申请号:US12751533

    申请日:2010-03-31

    IPC分类号: G06Q30/00

    摘要: Various embodiments provide techniques for advertisement inventory. In at least some embodiments, a scaled number of impressions can be matched to orders that have scaled impression goals. Impressions can be randomly selected from an offline traffic model and allocated to orders according to a matching algorithm until a number of impression defined by a scale factor is reached. This can occur by sampling the traffic model directly using the scale factor and/or by creating a scaled data set to which the matching algorithm can be applied. The matching algorithm can be configured to identify an order that is farthest away from being complete and then match the randomly selected impression to the identified order. If the scaled orders in the data set can be fulfilled using the scaled number of impressions, a conclusion is made that the original set of orders can be fulfilled using the original impressions.

    摘要翻译: 各种实施例提供广告库存的技术。 在至少一些实施例中,可以将缩放的展示次数与具有缩放的展示目标的订单相匹配。 可以从脱机流量模型中随机选择印象,并根据匹配算法分配给订单,直到达到由缩放因子定义的多个印象。 这可以通过使用比例因子直接采样流量模型和/或通过创建可应用匹配算法的缩放数据集来进行。 可以将匹配算法配置为识别最远离完成的顺序,然后将随机选择的印象与识别的顺序相匹配。 如果可以使用缩放的展示次数来满足数据集中的缩放顺序,则可以得出结论,可以使用原始展示次数来满足原始订单集。

    Systems and methods for optimizing decision graph collaborative filtering
    36.
    发明授权
    Systems and methods for optimizing decision graph collaborative filtering 有权
    优化决策图协同过滤的系统和方法

    公开(公告)号:US07444313B2

    公开(公告)日:2008-10-28

    申请号:US10654131

    申请日:2003-09-03

    IPC分类号: G06N5/02 H04H60/33

    CPC分类号: G06Q30/02 G06Q10/10

    摘要: The present invention provides collaborative filtering systems and methods employing default scores of decision graphs/trees to quickly create a top-n prediction list that can efficiently determine a user's interest in items. In one instance of the present invention, the list is refined by utilizing a variable maximum score algorithm and/or an invalidation list algorithm to insert items that score above an inclusion threshold set by a last item in the top-n prediction list. In another instance of the present invention, an invalidation list for a decision graph and/or decision tree is utilized to create a top-n prediction list. An algorithm employing default scores is then utilized to refine the top-n prediction list to insert items with default scores above an inclusion threshold set by a last item in the top-n prediction list.

    摘要翻译: 本发明提供协同过滤系统和采用默认分数的决策图/树的方法来快速地创建可以有效地确定用户对项目的兴趣的顶层预测列表。 在本发明的一个实例中,通过使用可变最大分数算法和/或无效化列表算法来精简列表来插入在顶部n个预测列表中由最后一个项目设置的包含阈值以上的项目。 在本发明的另一个实例中,利用用于决策图和/或决策树的无效列表来创建前n个预测列表。 然后使用采用默认分数的算法来改进top-n预测列表,以将具有默认分数的项目插入高于由top-n预测列表中的最后项目设置的包含阈值的项目。

    MOBILE AD SELECTION AND FILTERING
    38.
    发明申请
    MOBILE AD SELECTION AND FILTERING 审中-公开
    移动广告选择和过滤

    公开(公告)号:US20080153513A1

    公开(公告)日:2008-06-26

    申请号:US11767360

    申请日:2007-06-22

    IPC分类号: H04Q7/20

    CPC分类号: G06Q30/02

    摘要: The claimed subject matter relates to an architecture that can filter or organize content such as advertisements that are either received by or transmitted to a mobile device. The filtering or organizing can be based upon local attributes associated with the mobile device (e.g., location, velocity, time, a profile), as well as based upon attributes associated with the advertiser (e.g., inventory, customer traffic). In addition, the architecture can provide for selection and/or display of advertisements based upon a bidding model, wherein advertisers can bid for mobile devices that exhibit certain characteristics.

    摘要翻译: 所要求保护的主题涉及可以过滤或组织诸如由移动设备接收或传送到移动设备的广告的内容的架构。 过滤或组织可以基于与移动设备相关联的本地属性(例如,位置,速度,时间,简档)以及基于与广告商相关联的属性(例如,库存,客户流量)。 此外,该架构可以基于出价模型提供对广告的选择和/或显示,其中广告商可以出示具有某些特征的移动设备。

    Apparatus and accompanying methods for visualizing clusters of data and hierarchical cluster classifications
    39.
    发明授权
    Apparatus and accompanying methods for visualizing clusters of data and hierarchical cluster classifications 有权
    用于可视化数据集群和分级集群分类的装置和相关方法

    公开(公告)号:US07333998B2

    公开(公告)日:2008-02-19

    申请号:US10808064

    申请日:2004-03-24

    IPC分类号: G06F17/30

    摘要: A system that incorporates an interactive graphical user interface for visualizing clusters (categories) and segments (summarized clusters) of data. Specifically, the system automatically categorizes incoming case data into clusters, summarizes those clusters into segments, determines similarity measures for the segments, scores the selected segments through the similarity measures, and then forms and visually depicts hierarchical organizations of those selected clusters. The system also automatically and dynamically reduces, as necessary, a depth of the hierarchical organization, through elimination of unnecessary hierarchical levels and inter-nodal links, based on similarity measures of segments or segment groups. Attribute/value data that tends to meaningfully characterize each segment is also scored, rank ordered based on normalized scores, and then graphically displayed. The system permits a user to browse through the hierarchy, and, to readily comprehend segment inter-relationships, selectively expand and contract the displayed hierarchy, as desired, as well as to compare two selected segments or segment groups together and graphically display the results of that comparison. An alternative discriminant-based cluster scoring technique is also presented.

    摘要翻译: 一个包含交互式图形用户界面的系统,用于可视化数据的集群(类别)和分段(聚合集群)。 具体来说,系统将传入的案例数据自动分类为群集,将这些群集归纳为段,确定段的相似性度量,通过相似性度量对所选段进行分类,然后形成并可视地描绘这些群集的层次结构。 基于片段或段组的相似性度量,系统还可以根据需要自动和动态地减少层次组织的深度,通过消除不必要的层级和节点间链接。 倾向于对每个段进行有意义表征的属性/值数据也被划分,基于归一化分数进行排序,然后以图形方式显示。 该系统允许用户浏览层次结构,并且为了容易地理解分段相互关系,根据需要选择性地扩展和收缩所显示的分层结构,并且将两个选定的分段或分段组进行比较,并以图形方式显示 比较。 还提出了一种替代的基于判别式的聚类评分技术。

    Social rewards for online game playing
    40.
    发明授权
    Social rewards for online game playing 有权
    网络游戏的社会回报

    公开(公告)号:US08480495B2

    公开(公告)日:2013-07-09

    申请号:US11614588

    申请日:2006-12-21

    摘要: Useful information is acquired from a community of individuals by way of a game that rewards participants with social information about other participants. Points can be awarded to participants simply for participation and/or as a function of game performance. Such points can subsequently be exchanged to reveal information about game partners or other community members. Among other things, such a reward system can motivate individuals to perform tasks that might not otherwise be compelling and/or enjoyable.

    摘要翻译: 有用的信息是通过游戏方式从个人社区获取的,该游戏可以奖励参与者有关其他参与者的社交信息。 点数可以仅授予参与者参与和/或作为游戏演出的功能。 随后可以交换这些点以揭示关于游戏伙伴或其他社区成员的信息。 除此之外,这种奖励制度可以激励个人执行可能无法强制和/或愉快的任务。