Microsoft Technology Licensing, LLC

Yoram Bachrach

Pushmeet Kohli

Ralf Herbrich

Thore Graepel

Filip Andrzej Radlinski

Andrew Donald Gordon

John Michael Winn

Ulrich Paquet

Lucas Bordeaux

Li Quan Khoo

Checking and/or completing for data grids is described such as for grids having rows and columns of cells at least some of which contain data values such as numbers or categories. In various embodiments predictive probability distributions are obtained from an inference engine for one or more of the cells and the predictive probability distributions are used for various tasks such as to suggest values to complete blank cells, highlight cells having outlying values, identify potential errors, suggest corrections to potential errors, identify similarities between cells, identify differences between cells, cluster rows of the data grid, and other tasks. In various embodiments a graphical user interface displays a data grid and provides facilities for completing, error checking/correcting, and analyzing data in the data grid.

Checking and/or completion for data grids

A method of controlling access to content such as web sites on the intranet or interne is described. For example, the method comprises receiving an address of content to be accessed and obtaining similarity of the address to previously labeled addresses of other content items. The similarity is based on co-occurrence of addresses of content items in records of browsing sessions from many consenting users. For example, a browsing session record comprises addresses of content items accessed by a user in a time period during which the user is actively accessing content. A co-occurrence of addresses of content items is the existence of the addresses in the same browsing session record. Access to the content is then controlled on the basis of the similarity.

Website access control

Online recommendations are tracked through a forwarding service. The forwarding service can provide such statistics to an ad service, which can provide incentives to the recommending user and a consuming user. Example incentives may include an accumulation of points by the recommending user, a discount to the consuming user if a purchase is made in response to the recommendation, etc. To determine how much of an incentive each participant in the recommendation flow receives, a graph is created to model the recommendation flow and incentives are allocated using a cooperative game description based on this graph that associates each participant with a power index that represents that participants share of the incentive.

Pricing in social advertising

Data structures for collaborative filtering systems are described. In an embodiment sketches which extremely concisely represent a list of items that a user has rated are created and stored for use by a collaborative filtering system to recommend items. For example, the sketches are created by using several versions of a cryptographic hash function to permute the item list and store a minimal value from each permutation in the sketch together with a user rating. In examples the sketches are used to compute estimates of similarity measures between pairs of users such as rank correlations including Spearman's Rho and Kendall's Tau. For example, the similarity measures are used by a collaborative filtering system to accurately and efficiently recommend items to users. For example the sketches are so concise that massive amounts of data can be taken into account in order to give high quality recommendations in a practical manner.

Growing community of inventors

Cambridge, United Kingdom

Yoram Bachrach