IP Library › Granted Patent US 12,430,678
Granted Patent B2
US 12,430,678 · App. 18/083,373 · Granted Sep 30, 2025

Solving sparse data problems in a recommendation system with freezing start

Inventors: Nick Pendar (San Ramon, CA); Seyed Farhad Faghihi (Vancouver, CA)
Assignee: SAP SE
G06Q30/0631G06Q30/0202
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,430,678
App. No.
18/083,373
Granted
Sep 30, 2025
Kind
B2
Abstract

Recommendation services typically struggle with sparse data scenarios. A freezing generated item start technique can use a matrix of external generated items to find a linking generated item. Embeddings can be used to determine distance between items. The technologies are useful for providing recommendations even in scenarios involving little or no transaction data.

Claims (52)

1. A computer-implemented method comprising: building, by at least one hardware processor of a recommendation system, a generated—

item-by-generated-item matrix representing correlations between external generated items based on observed transactions for the external generated items from an external database;

pruning, by the at least one hardware processor and a pruner, the generated-item-by-generated-item matrix;

embedding, by the at least one hardware processor, the external generated items into a high-dimensional warm embedded vector space;

for a plurality of freezing generated items, embedding, by the at least one hardware processor, the plurality of freezing generated items into a high-dimensional freezing embedded vector space;

for a freezing generated item out of the plurality of freezing generated items, determining, by the at least one hardware processor, a location of the freezing generated item in the high-dimensional warm embedded vector space;

finding, by the at least one hardware processor, a nearest neighbor external generated item r of the freezing generated item within a complementary threshold distance of the freezing generated item in the high-dimensional warm embedded vector space, comprising: calculating distances between the location of the freezing generated item and positions of the external generated items in the high-dimensional warm embedded vector space;

for a given linking external generated item out of a plurality of possible linking external generated items appearing in the matrix for r, determining, by the at least one hardware processor, whether a linked freezing nearest neighbor generated item exists for the given linking external generated item in the high-dimensional freezing embedded vector space, comprising: calculating distances between a location of the given linking external generated item and other freezing generated items in the high-dimensional freezing embedded vector space;

responsive to determining that a linked freezing nearest neighbor generated item exists, associating, by the at least one hardware processor, the freezing generated item with the linked freezing nearest neighbor generated item using the generated-item-by-generated-item matrix as a bridge to enable the association; and

outputting, to an online portal, a recommendation based on the association.

2. The method of claim 1 , further comprising:

receiving, from the online portal, a request for a recommendation for the freezing generated item; and

responsive to the request for the recommendation and based on association between the freezing generated item and the linked freezing nearest neighbor generated item, responding with the recommendation, wherein the recommendation comprises the linked freezing nearest neighbor generated item.

3. The method of claim 1 , further comprising:

filtering, by the at least one hardware processor, the linked freezing nearest neighbor item with a category tree.

4. The method of claim 1 , further comprising:

finding, by the at least one hardware processor, at least one additional linking generated item out of the plurality of possible linking external generated items; and

associating, by the at least one hardware processor, at least one additional linked freezing nearest neighbor item with the freezing generated item.

5. The method of claim 1 wherein:

the high-dimensional freezing embedded vector space and the high-dimensional warm embedded vector space are a same vector space.

6. The method of claim 5 wherein:

the high-dimensional freezing embedded vector space and the high-dimensional warm embedded vector space are represented by different indexes;

finding a nearest neighbor in the high-dimensional warm embedded vector space comprises searching a first index; and

determining whether a linked freezing nearest neighbor exists comprises searching a second index different from the first index.

7. The method of claim 1 wherein:

determining whether a linked freezing nearest neighbor generated item exists incorporates a threshold.

8. The method of claim 1 wherein:

determining whether a linked freezing nearest neighbor generated item exists comprises searching for an approximate nearest neighbor.

9. The method of claim 1 , further comprising:

wherein: the pruning comprises removing any non-warm generated items from the generated-item-by-generated-item matrix; and the pruned matrix represents warm generated items.

10. The method of claim 1 , further comprising:

normalizing, by the at least one hardware processor, the generated-item-by-generated-item matrix based on observed transactions per represented generated item.

11. The method of claim 1 , further comprising:

representing, by the at least one hardware processor, a number of observed co-occurrence transactions for a generated item in a diagonal of the generated-item-by-generated-item matrix.

12. The method of claim 1 , wherein:

embedding the external generated items into the high-dimensional warm embedded vector space comprises:

for a given item out of the external generated items, calculating vector values of text describing the given item.

13. The method of claim 12 , wherein:

the text describing the given item comprises a title of the given item.

14. The method of claim 12 , wherein:

calculating vector values of text describing the given item comprises incorporating context of words in the text.

15. One or more non-transitory computer-readable media having stored therein computer-executable instructions that when executed by a computing system, cause the computing system to perform a method of outputting a generated item recommendation from a plurality of possible generated items, the method comprising:

building, by at least one hardware processor of a recommendation system, a generated-item-by-generated-item matrix representing correlations between external generated items based on observed transactions for the external generated items from an external database;

pruning, by the at least one hardware processor, the generated-item-by-generated-item matrix;

normalizing, by the at least one hardware processor, the generated-item-by-generated-item matrix;

embedding, by the at least one hardware processor, the external generated items into a high-dimensional warm embedded vector space based on titles of the external generated items;

for a plurality of freezing generated items, embedding, by the at least one hardware processor, the plurality of freezing generated items into a high-dimensional freezing embedded vector space based on titles of the freezing generated items;

for a freezing generated item out of the plurality of freezing generated items, determining, by the at least one hardware processor, a location of the freezing generated item in the high-dimensional warm embedded vector space;

finding, by the at least one hardware processor, a nearest neighbor external generated item r of the freezing generated item within a complementary threshold distance of the freezing generated item in the high-dimensional warm embedded vector space;

for a given linking external generated item out of a plurality of possible linking external generated items appearing in rows and columns for r within the matrix, determining, by the at least one hardware processor, whether a linked freezing nearest neighbor generated item exists for the given linking external generated item in the high-dimensional freezing embedded vector space;

responsive to determining that a linked freezing nearest neighbor generated item exists, associating, by the at least one hardware processor, the freezing generated item with the linked freezing nearest neighbor generated item using the generated-item-by-generated-item matrix as a bridge to enable the association; and

outputting, to an online portal, a recommendation based on the association.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 6, 2023
From: PENDAR, NICK; FAGHIHI, SEYED FARHAD
To: SAP SE
Reel/Frame 062303/0088 →
Continuity (1)
Related Publication 20240202798A1 · Jun 20, 2024
References Cited (83)
US 7987188B2 · Neylon · 2011 [cited by examiner]
US 8386336B1 · Fox · 2013 [cited by examiner]
US 8417713B1 · Blair-Goldensohn · 2013 [cited by examiner]
US 9058765B1 · Mallick et al. · 2015 [cited by applicant]
US 9075861B2 · Aravamudan et al. · 2015 [cited by applicant]
US 9524518B1 · Singer · 2016 [cited by examiner]
US 9734634B1 · Mott · 2017 [cited by examiner]
US 11321580B1 · Walczak et al. · 2022 [cited by applicant]
US 11769193B2 · Klein et al. · 2023 [cited by applicant]
US 20010021914A1 · Jacobi · 2001 [cited by examiner]
US 20050162670A1 · Shuler · 2005 [cited by examiner]
US 20050256778A1 · Boyd et al. · 2005 [cited by applicant]
US 20070043338A1 · Moll · 2007 [cited by examiner]
US 20070046675A1 · Iguchi · 2007 [cited by examiner]
US 20070197896A1 · Moll · 2007 [cited by examiner]
US 20090069229A1 · Smith · 2009 [cited by examiner]
US 20090110089A1 · Green · 2009 [cited by examiner]
US 20090125371A1 · Neylon · 2009 [cited by examiner]
US 20100268661A1 · Levy · 2010 [cited by examiner]
US 20110093249A1 · Holmes · 2011 [cited by examiner]
US 20110153362A1 · Valin et al. · 2011 [cited by applicant]
US 20110238083A1 · Moll · 2011 [cited by examiner]
US 20120321759A1 · Marinkovich · 2012 [cited by examiner]
US 20130091034A1 · Gudmundsson · 2013 [cited by applicant]
US 20130215116A1 · Siddique et al. · 2013 [cited by applicant]
US 20130325558A1 · Rosenberg · 2013 [cited by examiner]
US 20140081701A1 · Lakshminarayanan · 2014 [cited by examiner]
US 20140195931A1 · Kwon · 2014 [cited by examiner]
US 20140201126A1 · Zadeh et al. · 2014 [cited by applicant]
US 20140289167A1 · Rosenberg · 2014 [cited by examiner]
US 20140351079A1 · Dong · 2014 [cited by examiner]
US 20150242949A1 · Phillips · 2015 [cited by applicant]
US 20150290795A1 · Oleynik · 2015 [cited by examiner]
US 20150379732A1 · Sayre, III · 2015 [cited by examiner]
US 20160059412A1 · Oleynik · 2016 [cited by examiner]
US 20160127710A1 · Saban · 2016 [cited by examiner]
US 20160162975A1 · Chen et al. · 2016 [cited by applicant]
US 20160210602A1 · Siddique · 2016 [cited by examiner]
US 20170171580A1 · Hirsch · 2017 [cited by examiner]
US 20170193997A1 · Chen · 2017 [cited by examiner]
US 20170323368A1 · Eastman · 2017 [cited by examiner]
US 20180047208A1 · Marin et al. · 2018 [cited by applicant]
US 20180204111A1 · Zadeh et al. · 2018 [cited by applicant]
US 20180217990A1 · Kumar · 2018 [cited by examiner]
US 20180218063A1 · Nag · 2018 [cited by examiner]
US 20180218082A1 · Mitra · 2018 [cited by examiner]
US 20180218087A1 · Rapaka · 2018 [cited by examiner]
US 20180276869A1 · Matts et al. · 2018 [cited by applicant]
US 20180276883A1 · D'Alessandro et al. · 2018 [cited by applicant]
US 20190098039A1 · Gates · 2019 [cited by examiner]
US 20190099124A1 · Mattis · 2019 [cited by examiner]
US 20190295124A1 · Ramesh · 2019 [cited by examiner]
US 20190304000A1 · Simpson · 2019 [cited by examiner]
US 20200184278A1 · Zadeh et al. · 2020 [cited by applicant]
US 20200302337A1 · Jeffery et al. · 2020 [cited by applicant]
US 20200394211A1 · Pendar · 2020 [cited by applicant]
US 20210055973A1 · Pendar et al. · 2021 [cited by applicant]
US 20210109961A1 · Pendar · 2021 [cited by applicant]
US 20210110457A1 · Polanía Cabrera · 2021 [cited by examiner]
US 20210342701A1 · Ayush et al. · 2021 [cited by applicant]
US 20210366023A1 · Maldonado · 2021 [cited by examiner]
US 20220058714A1 · Chen · 2022 [cited by examiner]
US 20220084296A1 · Sadalgi · 2022 [cited by examiner]
US 20220121884A1 · Zadeh et al. · 2022 [cited by applicant]
US 20220179895A1 · Pendar · 2022 [cited by applicant]
US 20220198388A1 · Simpson · 2022 [cited by examiner]
US 20220198562A1 · Cella et al. · 2022 [cited by applicant]
US 20220215471A1 · Simpson · 2022 [cited by applicant]
US 20220230189A1 · Jeffery et al. · 2022 [cited by applicant]
US 20220245574A1 · Cella et al. · 2022 [cited by applicant]
US 20220245702A1 · Sundaresan · 2022 [cited by examiner]
US 20220300828A1 · Daly et al. · 2022 [cited by applicant]
US 20240202797A1 · Pendar et al. · 2024 [cited by applicant]
Jafri, Syed Irteza Hussain, et al. “Deep transfer learning with multimodal embedding to tackle cold-start and sparsity issues in recommendation system.” Plos one 17.8 (2022) (Year: 2022). [cited by examiner]
Bell, Robert M., and Yehuda Koren. “Improved neighborhood-based collaborative filtering.” KDD cup and workshop at the 13th ACM SIGKDD international conference on knowledge discovery and data mining. sn, 2007. (Year: 200… [cited by examiner]
“Approximate Nearest Neighbors Oh Yeah (ANNOY),” AAU Social Data Science Deep Learning, 2019 Portfolio, Aalborg University, sds-aau.github.io, visited Nov. 16, 2022, 7 pages. [cited by applicant]
“Nearest Neighbor Search,” [cited by applicant]
Hwang, “A Fast Nearest Neighbor Search Algorithm by Nonlinear Embedding,” [cited by applicant]
Trabelsi, “Comprehensive Guide to Approximate Nearest Neighbors Algorithms,” [cited by applicant]
“Word2vec,” [cited by applicant]
“Hierarchical Navigable Small Worlds (HNSW): Vector Search,” [cited by applicant]
Zhu et al., “Learning to warm up cold item embeddings for cold-start recommendation with meta scaling and shifting networks,” Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Inf… [cited by applicant]
Wei et al., “Contrastive Learning for Cold-Start Recommendation,” MM -21, Oct. 20-24, 2021, Virtual Event, China, pp. 5382-5390. [cited by applicant]