IP Library Granted Patent US 12,373,874
Granted Patent B2
US 12,373,874 · App. 17/557,949 · Granted Jul 29, 2025

Recommendation system with sparse feature encoding

Inventors: Gopi Krishna Jha (Bangalore, IN); Anthony Thomas (San Diego, CA); Nilesh Jain (Portland, OR)
Assignee: Intel Corporation
G06Q30/0631G06N20/00H04L9/0643
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,373,874
App. No.
17/557,949
Granted
Jul 29, 2025
Kind
B2
Abstract

A recommendation system includes a recommendation model for generating a recommendation score for a user with respect to an item. The model is configured to receive a set of dense features, describing numerical information, and a set of sparse features, representing a subset of items from a relatively large group of items. To represent the subset of items in the sparse features, each item (or a symbol thereof) is processed by an encoder to represent each item with a plurality of positions in a sparse binary representation of the subset of items. The sparse binary representation is then processed by a model that determines a vector representation of the sparse category features used in the prediction in conjunction with the dense features.

Claims (49)

1. A method for recommending an item to a user, the method comprising:

identifying a set of dense features and a set of sparse category features associated with recommending the item to the user, the set of sparse category features describing a subset of symbols belonging to an alphabet of category symbols;

determining, by a dense model, a dense vector from the set of dense features;

determining a sparse binary representation of the set of sparse features with an encoder applied to each of the symbols of the set of sparse category features;

determining, by a category feature model, a category vector representation from the sparse binary representation; and

inputting the dense vector and the category vector representation into a prediction model, the prediction model outputting a recommendation score of the item for the user; and

providing a recommendation of the item for the user based on the recommendation score,

wherein the dense model, category feature model, and prediction model are trained neural networks.

2. The method of claim 1 , wherein each symbol in the alphabet of category symbols represents a different item in a category.

3. The method of claim 1 , wherein the sparse binary representation has a plurality of positions and wherein the encoder applied to a symbol designates a plurality of indices; and wherein determining the sparse binary representation comprises setting positions of the sparse binary representation to a value of one if an index of the position is included in the plurality of indices for the encoder applied to any of the symbols of the set of sparse category features.

4. The method of claim 1 , wherein the encoder includes a plurality of hash functions.

5. The method of claim 1 , further comprising:

receiving a request from the device for a content recommendation for the user,

wherein the recommendation is provided to the device in response to the request.

6. The method of claim 5 , wherein the set of sparse features includes items associated with the user in a category of the alphabet of category symbols.

7. The method of claim 1 , wherein the dense features and the sparse category features are included in a set of training data, wherein the method further comprises further training the category feature model based on the recommendation score and the set of training data.

8. A system comprising:

a processor; and

a non-transitory computer-readable storage medium storing instructions executable by the processor to perform operations for recommending an item to a user, the operations comprising:

identifying a set of dense features and a set of sparse category features associated with recommending the item to the user, the set of sparse category features describing a subset of symbols belonging to an alphabet of category symbols,

determining, by a dense model, a dense vector from the set of dense features,

determining a sparse binary representation of the set of sparse features with an encoder applied to each of the symbols of the set of sparse category features,

determining, by a category feature model, a category vector representation from the sparse binary representation;

inputting the dense vector and the category vector representation into a prediction model, the prediction model outputting a recommendation score of the item for the user, and

providing a recommendation of the item for the user to a device based on the recommendation score,

wherein the dense model, category feature model, and prediction model are trained neural networks.

9. The system of claim 8 , wherein each symbol in the alphabet of category symbols represents a different item in a category.

10. The system of claim 8 , wherein the sparse binary representation has a plurality of positions and wherein the encoder applied to a symbol designates a plurality of indices; and wherein determining the sparse binary representation comprises setting positions of the sparse binary representation to a value of one if an index of the position is included in the plurality of indices for the encoder applied to any of the symbols of the set of sparse category features.

11. The system of claim 8 , wherein the encoder includes a plurality of hash functions.

12. The system of claim 8 , wherein the operations further comprise:

receiving a request from the device for a content recommendation for a user,

wherein the recommendation is provided to the device in response to the request.

13. The system of claim 12 , wherein the set of sparse features includes items associated with the user in a category of the alphabet of category symbols.

14. The system of claim 8 , wherein the dense features and the sparse category features are included in a set of training data and the operations further comprise further training the category feature model based on the recommendation score and in the set of training data.

15. A non-transitory computer-readable storage medium storing instructions executable by a processor to perform operations for recommending an item to a user, the operations comprising:

identifying a set of dense features and a set of sparse category features associated with recommending the item to the user, the set of sparse category features describing a subset of symbols belonging to an alphabet of category symbols;

determining, by a dense model, a dense vector from the set of dense features;

determining a sparse binary representation of the set of sparse features with an encoder applied to each of the symbols of the set of sparse category features;

determining, by a category feature model, a category vector representation from the sparse binary representation;

inputting the dense vector and the category vector representation into a prediction model, the prediction model outputting a recommendation score of the item for the user; and

providing a recommendation of the item for the user to a device based on the recommendation score,

wherein the dense model, category feature model, and prediction model are trained neural networks.

16. The non-transitory computer-readable storage medium of claim 15 , wherein each symbol in the alphabet of category symbols represents a different item in a category.

17. The non-transitory computer-readable storage medium of claim 15 , wherein the sparse binary representation has a plurality of positions and wherein the encoder applied to a symbol designates a plurality of indices; and wherein determining the sparse binary representation comprises setting positions of the sparse binary representation to a value of one if an index of the position is included in the plurality of indices for the encoder applied to any of the symbols of the set of sparse category features.

18. The non-transitory computer-readable storage medium of claim 15 , wherein the encoder includes a plurality of hash functions.

19. The non-transitory computer-readable storage medium of claim 15 , wherein the operations further comprise:

receiving a request from the device for a content recommendation for a user,

wherein the recommendation is provided to the device in response to the request.

20. The non-transitory computer-readable medium of claim 19 , wherein the set of sparse features includes items associated with the user in a category of the alphabet of category symbols.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 6, 2022
From: JHA, GOPI KRISHNA; THOMAS, ANTHONY; JAIN, NILESH
To: INTEL CORPORATION
Reel/Frame 059522/0249 →
Priority Claims (1)
IN 202141045233 · Oct 5, 2021 · national
Continuity (1)
Related Publication 20220114644A1 · Apr 14, 2022
References Cited (30)
US 7831476B2 · Foster · 2010 [cited by examiner]
US 9406024B1 · Gordon · 2016 [cited by examiner]
US 10565528B2 · Lokare · 2020 [cited by examiner]
US 10885461B2 · Garvey · 2021 [cited by examiner]
US 11250461B2 · Song · 2022 [cited by examiner]
US 11295346B1 · Pan · 2022 [cited by examiner]
US 11531927B2 · Modarresi · 2022 [cited by examiner]
US 20090097548A1 · Karczewicz · 2009 [cited by examiner]
US 20160232449A1 · Gordon · 2016 [cited by examiner]
US 20170193592A1 · Avidan · 2017 [cited by examiner]
US 20170249563A1 · Garvey · 2017 [cited by examiner]
US 20190164083A1 · Modarresi · 2019 [cited by examiner]
US 20190251467A1 · Lokare · 2019 [cited by examiner]
US 20200050846A1 · Sharma · 2020 [cited by examiner]
US 20200279288A1 · Song · 2020 [cited by examiner]
US 20210064968A1 · Lupien · 2021 [cited by examiner]
US 20210288827A1 · Celozzi · 2021 [cited by examiner]
US 20220092645A1 · Pan · 2022 [cited by examiner]
US 20220300836A1 · Rossi · 2022 [cited by examiner]
Demiriz, A., Enhancing product recommender systems on sparse binary data, (Abstract only), Data Mining and Knowledge Discovery 9.2: 147-170. Springer. Sep. 2004. (Year: 2004). [cited by examiner]
Li, Y., et al., “A Sparse Recommendation-Based Algorithm for Pattern Localization in Brain Imaging Data Analysis,” PLoS ONE 7:12: e50332. Public Library of Science. (Dec. 5, 2012). (Year: 2012). [cited by examiner]
Mehta, S., et al., “Learning to Segment Breast Biopsy Whole Slide Images,” Ithaca: Cornell University Library, arXiv.org. (Oct. 10, 2017) (Year: 2017). [cited by examiner]
Desai, Aditya, “Semantically Constrained Memory Allocation (SCMA) for Embedding in Efficient Recommendation Systems,” arXiv: 2103.06124v1 [cs.IR] Feb. 24, 2021, 14 pages. (Year: 2021). [cited by examiner]
Chen, Wenlin, et al, “Compressing Neural Networks with the Hashing Trick,” arXiv:1504.04788v1 [cs.LG] Apr. 19, 2015; 10 pages. [cited by applicant]
Ginart, A.A., “Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems,” arXiv:1909.11810v3 [cs.LG] Feb. 8, 2021; 16 pages. [cited by applicant]
Gupta, Udit, et al., “The Architectural Implications of Facebook's DNN-based Personalized Recommendation,” arXiv:1906.03109v4 [cs.DC] Feb. 15, 2020; 14 pages. [cited by applicant]
Kang, Wang-Cheng, et al., “Learning to Embed Categorical Features without Embedding Tables for Recommendation,” KDD'21, Aug. 14-18, 2021, Virtual Event, Singapore; 11 pages. [cited by applicant]
Naumov, Maxim,, et al., “Deep Learning Recommendation Model for Personalization and Recommendation Systems,” arXiv:1906.00091v1 [cs.IR] May 31, 2019; 10 pages. [cited by applicant]
Serra, Joan, et al., “Getting Deep Recommenders Fit: Bloom Embeddings for Sparse Binary Input/Output Networks,” RecSys '17, Aug. 27-31, 2017, Como, Italy; 9 pages. [cited by applicant]
Shi, Hao-Jun Michael, et al., “Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systems,” KDD '20, Aug. 23-27, Virtual Event, USA; 11 pages. [cited by applicant]