Click fraud resistant learning of click through rate
    1.
    发明申请
    Click fraud resistant learning of click through rate 审中-公开
    点击欺诈学习点击率

    公开(公告)号:US20070073579A1

    公开(公告)日:2007-03-29

    申请号:US11234476

    申请日:2005-09-23

    IPC分类号: G06Q30/00

    CPC分类号: G06Q30/0248 G06Q30/0267

    摘要: Click-based algorithms are leveraged to provide protection against fraudulent user clicks of online advertisements. This enables mitigation of short term losses due to the fraudulent clicks and also mitigates long term advantages caused by the fraud. The techniques employed utilize “expected click wait” instead of CTR to determine the likelihood that a future click will occur. An expected click wait is based on the number of events that occur before a certain number of clicks are obtained. The events can also include advertisement impressions and/or sale and the like. This flexibility allows for fraud detection of other systems by transforming the other systems to clock-tick fraud based systems. Averages, including weighted averages, can also be utilized with the systems and methods herein to facilitate in providing a fraud resistant estimate of the CTR.

    摘要翻译: 利用基于点击的算法来提供防止网络广告的欺诈用户点击的保护。 这样可以减轻由于欺诈性点击造成的短期损失,并减轻欺诈造成的长期利益。 所采用的技术使用“预期点击等待”而不是点击率来确定将来点击的可能性。 预期的点击等待是基于获得特定点击次数之前发生的事件数。 这些活动还可以包括广告印象和/或销售等。 这种灵活性允许通过将其他系统转换为基于时钟滴答讹诈的系统来欺骗其他系统的检测。 包括加权平均值在内的平均值也可以与本文的系统和方法一起使用,以便于提供对CTR的欺诈性估计。

    DESIGNING HYPERLINK STRUCTURES
    2.
    发明申请
    DESIGNING HYPERLINK STRUCTURES 审中-公开
    设计HYPERLINK结构

    公开(公告)号:US20070203789A1

    公开(公告)日:2007-08-30

    申请号:US11426500

    申请日:2006-06-26

    IPC分类号: G06Q30/00

    摘要: The subject disclosure pertains to an architecture that maximizes revenue of a website. In particular, the hyperlink structure between the web pages of a website can be designed to maximize the revenue generated from traffic on the website. That is, the set of hyperlinks placed on web pages is optimized by selecting hyperlinks that are most likely to generate the optimal revenue. Hyperlinks can be placed on web pages according to various criteria or variable values in order to create an optimized web page that generates the maximum revenue for the website.

    摘要翻译: 本主题公开涉及使网站收入最大化的架构。 特别地,网站的网页之间的超链接结构可被设计为最大化网站上的流量所产生的收入。 也就是说,通过选择最有可能产生最佳收入的超链接来优化放置在网页上的一组超链接。 可以根据各种标准或变量值将超链接放置在网页上,以便创建一个优化的网页,以生成网站的最大收入。

    Mechanism for allocating advertisements of varying intervals
    5.
    发明申请
    Mechanism for allocating advertisements of varying intervals 审中-公开
    分配不同间隔广告的机制

    公开(公告)号:US20060253319A1

    公开(公告)日:2006-11-09

    申请号:US11122281

    申请日:2005-05-04

    IPC分类号: G06Q30/00

    摘要: The subject invention leverages determined values of auction advertisement proposals to facilitate in determining advertisement interval allocations for the proposals. The advertisement “interval” can include, but is not limited to, physical dimensions or time. Instances of the subject invention further utilize allocation algorithms and auctioning mechanisms to provide for allocation of ads of varying intervals and to improve performance of ad auctions, including employing algorithms that automate the ad interval layout to maximize revenue. Other instances of the subject invention provide pricing for the allocated intervals as well.

    摘要翻译: 本发明利用拍卖广告提案的确定值来促进确定投标的广告间隔分配。 广告“间隔”可以包括但不限于物理尺寸或时间。 本发明的实例还利用分配算法和拍卖机制来提供不同间隔的广告的分配并提高广告拍卖的性能,包括采用自动化广告间隔布局以最大化收益的算法。 本发明的其他实例也为分配的间隔提供定价。

    Evaluation and pricing of user interactions with online advertisements
    6.
    发明申请
    Evaluation and pricing of user interactions with online advertisements 审中-公开
    用户与在线广告互动的评估和定价

    公开(公告)号:US20060253425A1

    公开(公告)日:2006-11-09

    申请号:US11121405

    申请日:2005-05-04

    IPC分类号: G06F17/30

    CPC分类号: G06Q30/02

    摘要: The subject invention employs an indication gateway to provide a “buffer” between user indications (e.g., “clicks”) responsive to an interactive enticement such as, for example, a clickable online advertisement, and an entity associated with the enticement such as, for example, an online business. The indication gateway allows for subsequent checks on whether an initial user indication is sincere. Instances of the subject invention can accomplish this via additional information gathering, subsequent indication requirements, fraudulent indication tests, and/or buffering of subsequent indications, links, & content and the like. Additionally, instances of the subject invention can differentiate between different types of user indications and provide pricing structures based upon the differentiated types. This facilitates in providing a charging process for user indications to entities associated with the interactive enticement.

    摘要翻译: 主题发明使用指示网关来响应于诸如例如可点击的在线广告的交互诱惑和与诱惑相关联的实体而在用户指示(例如,“点击”)之间提供“缓冲”,例如, 例如,在线业务。 指示网关允许对初始用户指示是否真诚进行后续检查。 本发明的实例可以通过附加信息收集,随后的指示要求,欺诈指示测试和/或后续指示,链接和内容等的缓冲来实现。 另外,本发明的实例可以区分不同类型的用户指示,并且基于差分类型提供定价结构。 这有利于为用户指示提供与交互式诱惑相关联的实体的计费过程。

    Method for finding semantically related search engine queries
    8.
    发明授权
    Method for finding semantically related search engine queries 有权
    查找语义相关的搜索引擎查询的方法

    公开(公告)号:US07577646B2

    公开(公告)日:2009-08-18

    申请号:US11119667

    申请日:2005-05-02

    IPC分类号: G06F7/00 G06F17/30

    摘要: A method for determining semantic correlation between an input query and stored queries based on their temporal correlation. Embodiments include a formal calculation of a correlation coefficient between an input query and stored queries. Alternate embodiments include methods for calculation of a correlation coefficient using a reduced data model and efficient data examination with little or no sacrifice in the accuracy of the correlation coefficient.

    摘要翻译: 一种用于基于它们的时间相关性来确定输入查询和存储的查询之间的语义相关性的方法。 实施例包括输入查询和存储的查询之间的相关系数的形式计算。 替代实施例包括使用简化数据模型计算相关系数的方法和有效数据检查,相关系数的精度很少或不牺牲。