Patents by Inventor Ulrich Paquet
Ulrich Paquet has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10438268Abstract: Embodiments of the invention provide methods and apparatus for recommending items from a catalog of items to a user by parsing the catalog of items into a plurality of catalog clusters of related items and recommending catalog items to the user from catalog clusters to which items previously preferred by the user belong.Type: GrantFiled: February 9, 2012Date of Patent: October 8, 2019Assignee: Microsoft Technology Licensing, LLCInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet
-
Patent number: 10154041Abstract: 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.Type: GrantFiled: January 13, 2015Date of Patent: December 11, 2018Assignee: Microsoft Technology Licensing, LLCInventors: Pushmeet Kohli, Yoram Bachrach, Filip Radlinski, Ulrich Paquet, Li Quan Khoo
-
Patent number: 9898773Abstract: Example apparatus and methods access multiple sources of information concerning features for applications, clean the data from the multiple sources, extract features from the cleaned data, selectively weight the sources, data or extracted features and produce a feature vector. The feature vector may then be used in a single language feature space or in a multi-language feature space. Feature spaces may then be used to find similarities between applications to facilitate recommending applications. In one embodiment, different feature spaces may be connected using a graph where nodes represent items and edges represent similarity relationships between items based on related feature spaces. Traversing the graph may allow similarities to be found that might not otherwise be possible. For example, while there may be no direct English to Hebrew similarity relationship, there may be English to French and French to Hebrew relationships that can be followed in the graph.Type: GrantFiled: November 18, 2014Date of Patent: February 20, 2018Assignee: Microsoft Technology Licensing, LLCInventors: Nir Nice, Noam Koenigstein, Shay Ben-Elazar, Shahar Keren, Ulrich Paquet, Yehuda Finkelstein
-
Publication number: 20170228433Abstract: A system and method for basket completion for items contained in a catalog, uses the determinantal point process on a closed set of items in a catalog. A parameter space contains the items of the catalog as vectors of parameters whose values are obtained using the determinantal point process in a learning process. Subsequently a user input obtains a selection from a user of one or more items from the catalogue. Then a selector selects another item within the parameter space whose vector forms a largest area when combined with the vectors of the already present items. The large area implies both popularity of the item and complementarity of the new item with the items already chosen. The user is provided with the new item to complete a basket with the already present items.Type: ApplicationFiled: February 4, 2016Publication date: August 10, 2017Inventors: Charles M. GARTRELL, Ulrich PAQUET, Noam KOENIGSTEIN, Nir NICE
-
Patent number: 9454580Abstract: Example apparatus and methods transform a non-metric latent space produced by a matrix factorization process to a higher dimension metric space by applying an order preserving transformation to the latent space. The transformation preserves the order of the results of an inner product operation defined for the latent space. The higher dimension metric space may be queried for the results to different requests. Example apparatus and methods may assign every user i a vector ui in a latent space, and may assign every item j a vector vj in the latent space. The dot product ui·vj represents the score between the user i and the item j. The score represents the strength of the relationship between the user i and the item j. Example apparatus and methods may then apply ranking methodologies (e.g., LSH, K-D trees) to problems including recommendation, targeting, matchmaking, or item to item.Type: GrantFiled: February 8, 2016Date of Patent: September 27, 2016Assignee: Rovi Technologies CorporationInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Ran Gilad-Bachrach, Liran Katzir
-
Publication number: 20160205109Abstract: 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.Type: ApplicationFiled: January 13, 2015Publication date: July 14, 2016Inventors: Pushmeet Kohli, Yoram Bachrach, Filip Radlinski, Ulrich Paquet, Li Quan Khoo
-
Publication number: 20160203191Abstract: Example apparatus and methods transform a non-metric latent space produced by a matrix factorization process to a higher dimension metric space by applying an order preserving transformation to the latent space. The transformation preserves the order of the results of an inner product operation defined for the latent space. The higher dimension metric space may be queried for the results to different requests. Example apparatus and methods may assign every user i a vector ui in a latent space, and may assign every item j a vector vj in the latent space. The dot product ui·vj represents the score between the user i and the item j. The score represents the strength of the relationship between the user i and the item j. Example apparatus and methods may then apply ranking methodologies (e.g., LSH, K-D trees) to problems including recommendation, targeting, matchmaking, or item to item.Type: ApplicationFiled: February 8, 2016Publication date: July 14, 2016Inventors: NIR NICE, Noam Koenigstein, Ulrich Paquet, Ran Gilad-Bachrach, Liran Katzir
-
Patent number: 9348898Abstract: Example apparatus and methods perform matrix factorization (MF) on a usage matrix to create a latent space that describes similarities between users and items and between items and items in the usage matrix. The usage matrix relates users to items according to a collaborative filtering approach. A cell in the usage matrix may store a value that describes whether a user has acquired an item and the strength with which the user likes an item that has been acquired. The latent item space may reflect true relationships between items represented in the usage matrix and those relationships may be proportional to the strength in the usage matrix. The strength of the relationship may be encoded using continuous data that measures, for example, the amount of time a video game has been played, the amount of time content has been viewed, or other continuous or cumulative engagement measurements.Type: GrantFiled: March 27, 2014Date of Patent: May 24, 2016Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Shahar Keren
-
Publication number: 20160140643Abstract: Example apparatus and methods access multiple sources of information concerning features for applications, clean the data from the multiple sources, extract features from the cleaned data, selectively weight the sources, data or extracted features and produce a feature vector. The feature vector may then be used in a single language feature space or in a multi-language feature space. Feature spaces may then be used to find similarities between applications to facilitate recommending applications. In one embodiment, different feature spaces may be connected using a graph where nodes represent items and edges represent similarity relationships between items based on related feature spaces. Traversing the graph may allow similarities to be found that might not otherwise be possible. For example, while there may be no direct English to Hebrew similarity relationship, there may be English to French and French to Hebrew relationships that can be followed in the graph.Type: ApplicationFiled: November 18, 2014Publication date: May 19, 2016Inventors: Nir Nice, Noam Koenigstein, Shay Ben-Elazar, Shahar Keren, Ulrich Paquet, Yehuda Finkelstein
-
Patent number: 9336546Abstract: Example apparatus and methods perform matrix factorization (MF) on a collaborative filter based usage matrix to create a multi-dimensional latent space that embeds users, items, and features. A full distance matrix is extracted from the latent space. The full distance matrix may be extracted from the latent space by defining a distance metric between item pairs based on the multi-dimensional representation in the latent space. The full distance matrix may be populated with values computed for item pairs using the distance metric. A plurality of vectors associated with a multi-dimensional Euclidean space are produced from the full distance matrix. The plurality of vectors produce a navigable data set. The plurality of vectors may be produced in a manner that minimizes strain on the distances vectors. A representation of the navigable data set may be presented as, for example, a virtually traversable landscape that supports an interactive user experience.Type: GrantFiled: March 27, 2014Date of Patent: May 10, 2016Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Shahar Keren, Daniel Sitton, Amit Perelstein
-
Publication number: 20160078520Abstract: A recommendation system is implemented using modified matrix factorization on top of a content-based matrix to provide both user-to-item and item-to-item content-based recommendations while exposing the full depth of transitive relationships among recommendations. Content information such as features and characteristics may be represented in a usage matrix in which features are treated as users would be in traditional matrix factorization. Matrix factorization is applied to the “features-as-users” matrix to build a content-based model in which features and items are embedded in a low dimension latent space. User history is employed for system training by locating user vectors within the latent space. Recommendations that are near to the vector can be provided to the users along with explanations (e.g., a recommendation is given because of an item's proximity to a particular feature).Type: ApplicationFiled: September 12, 2014Publication date: March 17, 2016Inventors: Nir Nice, Noam Koenigstein, Shahar Keren, Ayelet Kroskin, Ulrich Paquet
-
Patent number: 9256693Abstract: Example apparatus and methods transform a non-metric latent space produced by a matrix factorization process to a higher dimension metric space by applying an order preserving transformation to the latent space. The transformation preserves the order of the results of an inner product operation defined for the latent space. The higher dimension metric space may be queried for the results to different requests. Example apparatus and methods may assign every user i a vector ui in a latent space, and may assign every item j a vector vj in the latent space. The dot product ui·vj represents the score between the user i and the item j. The score represents the strength of the relationship between the user i and the item j. Example apparatus and methods may then apply ranking methodologies (e.g., LSH, K-D trees) to problems including recommendation, targeting, matchmaking, or item to item.Type: GrantFiled: January 8, 2014Date of Patent: February 9, 2016Assignee: Rovi Technologies CorporationInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Ran Gilad-Bachrach, Liran Katzir
-
Publication number: 20150278350Abstract: Example apparatus and methods perform matrix factorization (MF) on a usage matrix to create a latent space that describes similarities between users and items and between items and items in the usage matrix. The usage matrix relates users to items according to a collaborative filtering approach. A cell in the usage matrix may store a value that describes whether a user has acquired an item and the strength with which the user likes an item that has been acquired. The latent item space may reflect true relationships between items represented in the usage matrix and those relationships may be proportional to the strength in the usage matrix. The strength of the relationship may be encoded using continuous data that measures, for example, the amount of time a video game has been played, the amount of time content has been viewed, or other continuous or cumulative engagement measurements.Type: ApplicationFiled: March 27, 2014Publication date: October 1, 2015Applicant: Microsoft CorporationInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Shahar Keren
-
Publication number: 20150278910Abstract: Example apparatus and methods perform matrix factorization (MF) on a usage matrix to create a latent space that describes similarities between items in the usage matrix. The usage matrix relates source items that a user already has to target items that a user might acquire. A cell in the usage matrix may store a value that describes the likelihood (e.g., probability) that an acquisition of item x will lead to an acquisition of item y. The value stored in cell (x,y) is not transitive with the value stored in cell (y,x). Values that are missing in the usage matrix may be computed using vectors in the latent space. Once the usage matrix is updated, a directed recommendation may be produced from data in the usage matrix. Initial values in the usage matrix may be produced from data associated with actual acquisitions.Type: ApplicationFiled: March 31, 2014Publication date: October 1, 2015Applicant: Microsoft CorporationInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Yehuda Finkelstein
-
Publication number: 20150278907Abstract: Example apparatus and methods perform matrix factorization (MF) on a usage matrix to create a latent space that describes similarities between users and items in the usage matrix. The usage matrix relates users to items according to a collaborative filtering approach. A cell in the usage matrix may store a value that describes whether a user has acquired an item and the strength with which the user likes an item that has been acquired. Example apparatus and methods account for negative indications analytically rather than through negative sampling. Example apparatus and methods analyze strengths in the usage matrix, analyze item popularity, analyze user popularity, compute contribution factors for items with respect to users and users with respect to items, and compute new user vectors and new item vectors that depend on the strengths, popularity, and contributions. A recommendation may consider new user vectors and new item vectors.Type: ApplicationFiled: March 27, 2014Publication date: October 1, 2015Applicant: Microsoft CorporationInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Shahar Keren
-
Publication number: 20150278908Abstract: Example apparatus and methods perform matrix factorization (MF) on a collaborative filter based usage matrix to create a multi-dimensional latent space that embeds users, items, and features. A full distance matrix is extracted from the latent space. The full distance matrix may be extracted from the latent space by defining a distance metric between item pairs based on the multi-dimensional representation in the latent space. The full distance matrix may be populated with values computed for item pairs using the distance metric. A plurality of vectors associated with a multi-dimensional Euclidean space are produced from the full distance matrix. The plurality of vectors produce a navigable data set. The plurality of vectors may be produced in a manner that minimizes strain on the distances vectors. A representation of the navigable data set may be presented as, for example, a virtually traversable landscape that supports an interactive user experience.Type: ApplicationFiled: March 27, 2014Publication date: October 1, 2015Applicant: Microsoft CorporationInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Shahar Keren, Daniel Sitton, Amit Perelstein
-
Publication number: 20150193548Abstract: Example apparatus and methods transform a non-metric latent space produced by a matrix factorization process to a higher dimension metric space by applying an order preserving transformation to the latent space. The transformation preserves the order of the results of an inner product operation defined for the latent space. The higher dimension metric space may be queried for the results to different requests. Example apparatus and methods may assign every user i a vector ui in a latent space, and may assign every item j a vector vj in the latent space. The dot product ui·vj represents the score between the user i and the item j. The score represents the strength of the relationship between the user i and the item j. Example apparatus and methods may then apply ranking methodologies (e.g., LSH, K-D trees) to problems including recommendation, targeting, matchmaking, or item to item.Type: ApplicationFiled: January 8, 2014Publication date: July 9, 2015Inventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Ran Gilad-Bachrach, Liran Katzir
-
Publication number: 20150112801Abstract: Matrix factorization techniques may be employed to identify different tastes based on user history information for a user profile and to provide item recommendations for the various tastes. An item model may be generated that includes item vectors, each item vector representing an item from a catalog of items. An item vector from the item model may be identified for each of a number of items identified in information for a user profile. The item vectors may be grouped into different clusters, and a taste vector may be generated for each cluster based on item vectors in each cluster. Each taste vector may be used to select item recommendations that may be combined in a set of recommendations provided for presentation to one or more users associated with the user profile.Type: ApplicationFiled: October 22, 2013Publication date: April 23, 2015Applicant: MICROSOFT CORPORATIONInventors: NIR NICE, NOAM KOENIGSTEIN, ULRICH PAQUET, SHAHAR ZVI KEREN
-
Patent number: 8983888Abstract: A technique for efficiently factoring a matrix in a recommendation system. Usage data for a large set of users relative to a set of items is provided in a usage matrix R. To reduce computational requirements, the usage matrix is sampled to provide a reduced matrix R?. R? is factored into a user matrix U? and an item matrix V. User vectors in U? and V are initialized and then iteratively updated to arrive at an optimal solution. The reduced matrix can be factored using the computational resources of a single computing device, for instance. Subsequently, the full user matrix U is obtained by fixing V and analytically minimizing an error in UV=R+error. The computations of this analytic solution can be divided among a set of computing devices, such as by using a map and reduce technique. Each computing device solves the equation for different respective subset of users.Type: GrantFiled: November 7, 2012Date of Patent: March 17, 2015Assignee: Microsoft Technology Licensing, LLCInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Shahar Keren, Daniel Sitton, Dror Kremer, Shai Roitman
-
Publication number: 20150073932Abstract: Example apparatus and methods provide a recommendation to a user about a product they may wish to consider purchasing. One method produces a single indication concerning a relationship between a user and an item with which the user has interacted. The single indication identifies whether the user likes the item and the degree to which the user likes the item. The single indication is independent of user signals processed to compute the single indication. The single indication is produced by a signal deriver that is loosely coupled to a model of users and items. The model may be a matrix upon which matrix factorization can be performed. Although matrix factorization is performed, it is performed on vectors whose elements are independent of the signals processed by the signal deriver. Since users may have different preferences at different times, the degree to which the user likes the item may be manipulated.Type: ApplicationFiled: September 11, 2013Publication date: March 12, 2015Applicant: Microsoft CorporationInventors: Nir Nice, Noam Koenigstein, Ulrich Paquet, Shahar Keren, Daniel Sitton