Abstract: 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.

Abstract: 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.

Abstract: The subject disclosure pertains to systems and methods that optimize advertisement campaigns. In particular, total utility that can be derived by an advertiser given particular keywords is maximized. The price of each keyword/slot pair can be determined or estimated and bids adjusted automatically to maximize advertiser utility or return on investment for a campaign.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The subject invention relates to systems and methods that provide a truthful incentive-compatible mechanism for budget-constrained bidders in order to facilitate asymptotically maximizing revenue with multi-unit auctions in which individual bidders have private valuation per item (e.g., bids, offer prices, utility . . . ) and overall budgets. The systems and/or methods obtain bidder private bids and budget constraint, and separate this information into groups of bids and budgets. Each group is randomly reordered and utilized to determine a profit maximizing price as a function of the bids and budgets within that group. The groups of bids and budgets and the profit maximizing prices are utilized to allocate the auctioned items to respective bidders such that the allocation is based at least in part on the bids, budgets and prices. The systems and methods can be utilized to improve online auctioning.

Abstract: Rounded solutions of a linear program are used to partition or group cells, such as cells in a wireless network, in order to provide efficient approximations of network updating and paging costs.