摘要:
Systems and methods for determining the value of bids placed by content providers for placement positions on a page, e.g., a web page, rendered according to a given context, for instance, the search results listing for a particular query initiated on a search engine web site, are provided. Additionally, systems and methods are provided for determining placement of content items, e.g., advertisements and/or images, on a rendered page relative to other content items on the page based upon bid value.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
The claimed subject matter relates to an architecture that can aggregate user information in order to provide shopping route optimization. The architecture can collect data from users or business establishments, and can further make inferences about a user based upon histories, behavior, query responses, as well as from other suitable data sources. By providing the shopping route optimization, the architecture can gain access to rich sets of information, which can in turn improve the optimizations, potentially creating a virtuous cycle.
摘要:
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.
摘要:
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.
摘要:
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.