IP Library › Granted Patent US 12,236,468
Granted Patent B2
US 12,236,468 · App. 17/718,012 · Granted Feb 25, 2025

Method and apparatus for guiding content selection within an information distribution system based on modelling user behavior

Inventor: Philip Joseph Renaud (Toronto, CA)
Assignee: AUDIENSE GLOBAL HOLDINGS LIMITED.
G06Q30/0631G06F16/9535G06F16/9536G06F16/9537G06F18/24137G06Q30/0201G06Q50/01
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,236,468
App. No.
17/718,012
Granted
Feb 25, 2025
Kind
B2
Abstract

Method and apparatus for measuring and influencing article selection in a social network are disclosed. A learning-and-guiding module tracks access to articles by users of the social network and determines patterns of users' attraction to articles based on contents of articles and attributes of users. The module utilizes learned user-articles characteristics to influence article selection through communicating with users through the social network. The module relies on historical usage data characterizing user's affinity to articles. To guard against usage data obsolescence due to shifting interests, usage data are frequently adjusted to place more emphasis on recent usage patterns.

Claims (92)

1. A method, implemented at a computing system, of guiding content selection within an information distribution system, the method comprising:

acquiring pairwise similarity levels of a plurality of articles;

continually detecting access by individual users, of a plurality of users, to respective articles through the information distribution system, and for each individual user:

determining a complementing article to succeed a respective article based on:

said pairwise similarity levels; and

a gravitation measure of article-access transitions for each directed article pair emanating from said respective article, said gravitation measure being a count of article-access transitions effected by said plurality of users;

communicating an identifier of said complementing article to said each individual user;

detecting a specific directed article-access transition from said respective article to a subsequent article;

increasing a corresponding gravitation measure;

and

adjusting said gravitation measure for said each directed article pair based on

a count of transitions from said respective article; and

a global cyclic age of said gravitation measure.

2. The method of claim 1 wherein said adjusting comprises attenuating said gravitation measure for said each directed article pair subject to at least one of:

a total number of transitions from said respective article exceeding a predefined value; and

said global cyclic age of said gravitation measure exceeding a predefined time period.

3. The method of claim 1 wherein said cyclic age of gravitational measure is determined as a time interval between a time instant of a current article-access transition and a most recent time instant at which the gravitation measure has been adjusted.

4. The method of claim 1 wherein said total number of transitions is a count of all transitions from the respective article to any other article of the plurality of articles.

5. The method of claim 1 wherein said adjusting comprises reducing said gravitation measure according to one of:

a predefined multiplier; and

a function of a value of said gravitation measure.

6. The method of claim 1 further comprising:

determining a composite affinity level of said respective article to each candidate article of a set of candidate articles of said plurality of articles as a weighted sum of:

a similarity level between said respective article and said each candidate article; and

a gravitation measure from said respective article to said each candidate article; and

selecting a candidate article of said set of candidate articles as said complementing article according to a respective composite affinity level.

7. The method of claim 1 further comprising:

obtaining a specific user type of said each individual user;

refining said determining said complementing article to be further based on an attraction measure of article-access transitions for said each directed article pair, said attraction measure being a count of article-access transitions effected by users of a same user type.

8. The method of claim 7 further comprising:

updating a corresponding attraction measure of said each directed article pair for said specific user type; and

adjusting said attraction measure for said each directed article pair for said specific user type subject to a number of transitions from said respective article for said specific user type exceeding a predefined lower bound.

9. The method of claim 7 wherein said obtaining comprises:

acquiring characteristics of individual users of said plurality of users;

segmenting said plurality of users into clusters based on said characteristics; and

assigning for each user a respective user type equivalent to an identifier a cluster to which the user belongs.

10. The method of claim 7 further comprising selecting a set of candidate articles, of said plurality of articles, to complement said respective article, with each candidate article satisfying at least one of:

a respective similarity level, between said respective article and said each candidate article, exceeding a predefined similarity lower-bound;

a respective gravitation measure, from said respective article to said each candidate article, exceeding a predefined gravitation lower bound; and

a respective attraction measure, from said respective article to said each candidate article for said specific user type, exceeding a predefined attraction lower bound.

11. The method of claim 10 further comprising:

determining a composite affinity level of said respective article to each candidate article of a set of candidate articles of said plurality of articles as a weighted sum of:

said respective similarity level;

said respective gravitation measure; and

said respective attraction measure;

ranking candidate articles of said set of candidate articles according to values of respective composite affinity levels; and

performing a process of weighted random selection of said complementing article from a prescribed number of candidate articles of highest ranking.

12. An apparatus for guiding content selection within an information distribution system comprising a pool of processors executing instructions organized into:

a tracking module configured to continually detect access by individual users, of a plurality of users, to respective articles of a plurality of articles through the information distribution system;

a recommendation module configured to:

determine a complementing article to succeed a particular article based on:

acquired pairwise similarity levels of said plurality of articles;

and

a gravitation measure of article-access transitions for each directed article pair emanating from said particular article, said gravitation measure being a count of article-access transitions effected by said plurality of users;

communicate an identifier of said complementing article to a specific user currently accessing said particular article;

a module for usage-data accruing configured to:

detect a directed article-access transition from said particular article to a subsequent article; and

increase a corresponding gravitation measure;

and

a module for usage-data weighting configured to adjust said gravitation measure for said each directed article pair based on

a count of transitions from said particular article; and

a global cyclic age of said gravitation measure.

13. The apparatus of claim 12 wherein said module for usage-data weighting attenuates said gravitation measure for said each directed article pair subject to at least one of:

a total number of transitions from said particular article exceeding a predefined value; and

said global cyclic age of said gravitation measure exceeding a predefined time period;

said total number of transitions being a count of all transitions from the particular article to any other article of the plurality of articles.

14. The apparatus of claim 13 wherein said module for usage-data weighting reduces said gravitation measure according to one of:

a predefined multiplier; and

a function of a value of said gravitation measure.

15. The apparatus of claim 12 wherein said module for usage-data weighting determines said cyclic age of gravitational measure as a time interval between a time instant of a current article-access transition and a most recent time instant at which the gravitation measure has been adjusted.

16. The apparatus of claim 12 wherein said recommendation module is further configured to:

determine a composite affinity level of said particular article to each candidate article of a set of candidate articles of said plurality of articles as a weighted sum of:

a similarity level between said particular article and said each candidate article; and

a gravitation measure from said particular article to said each candidate article; and

select a candidate article of said set of candidate articles as said complementing article according to a respective composite affinity level.

17. The apparatus of claim 12 wherein said recommendation module is further configured to:

obtain a specific user type of said specific user;

refine said determining said complementing article to be further based on an attraction measure of article-access transitions for said each directed article pair, said attraction measure being a count of article-access transitions effected by users of a same user type.

18. The apparatus of claim 17 wherein said recommendation module is further configured to:

update a corresponding attraction measure of said each directed article pair for said specific user type; and

adjust said attraction measure for said each directed article pair for said specific user type subject to a number of transitions from said particular article for said specific user type exceeding a predefined lower bound.

19. The apparatus of claim 17 wherein said recommendation module is further configured to select a set of candidate articles, of said plurality of articles, to complement said particular article, with each candidate article satisfying at least one of:

a respective similarity level, between said particular article and said each candidate article, exceeding a predefined similarity lower-bound;

a respective gravitation measure, from said particular article to said each candidate article, exceeding a predefined gravitation lower bound; and

a respective attraction measure, from said particular article to said each candidate article for said specific user type, exceeding a predefined attraction lower bound.

20. The apparatus of claim 19 wherein said recommendation module is further configured to:

determine a composite affinity level of said particular article to each candidate article of a set of candidate articles of said plurality of articles as a weighted sum of:

said respective similarity level;

said respective gravitation measure; and

said respective attraction measure;

rank candidate articles of said set of candidate articles according to values of respective composite affinity levels; and

perform a process of weighted random selection of said complementing article from a prescribed number of candidate articles of highest ranking.

Assignments (6)
SECURITY INTEREST Recorded Aug 1, 2023
From: AUDIENSE GLOBAL HOLDINGS LIMITED
To: AFFINIO HOLDINGS INC.
Reel/Frame 064455/0571 →
CONFIRMATION OF ASSIGNMENT Recorded May 23, 2023
From: AFFINIO HOLDINGS INC.
To: AUDIENSE GLOBAL HOLDINGS LIMITED
Reel/Frame 063727/0963 →
MERGER Recorded May 23, 2023
From: AFFINIO INC.
To: AFFINIO HOLDINGS INC.
Reel/Frame 064046/0004 →
CHANGE OF ADDRESS Recorded Jul 13, 2022
From: AFFINIO INC.
To: AFFINIO INC.
Reel/Frame 060649/0808 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 11, 2022
From: RENAUD, PHILIP JOSEPH
To: AFFINIO INC.
Reel/Frame 059564/0871 →
CHANGE OF ADDRESS Recorded Apr 11, 2022
From: AFFINIO INC.
To: AFFINIO INC.
Reel/Frame 059677/0622 →
Continuity (3)
Continuation 16304838
Provisional Application 62349268 · Jun 13, 2016
Related Publication 20220245711A1 · Aug 4, 2022
References Cited (73)
US 6263334B1 · Fayyad · 2001 [cited by applicant]
US 6438579B1 · Hosken · 2002 [cited by applicant]
US 8385662B1 · Yoon et al. · 2013 [cited by applicant]
US 8489515B2 · Mathur · 2013 [cited by applicant]
US 8712929B1 · Bickford · 2014 [cited by applicant]
US 9183285B1 · Brown et al. · 2015 [cited by applicant]
US 9286391B1 · Dykstra et al. · 2016 [cited by applicant]
US 9348886B2 · Arnoux et al. · 2016 [cited by applicant]
US 9454726B1 · Yao et al. · 2016 [cited by applicant]
US 9684656B2 · Ning · 2017 [cited by examiner]
US 9760619B1 · Lattanzi et al. · 2017 [cited by applicant]
US 9792332B2 · Spiegel · 2017 [cited by applicant]
US 9886676B1 · Bos et al. · 2018 [cited by applicant]
US 9984392B2 · Kendall et al. · 2018 [cited by applicant]
US 10095771B1 · Dykstra et al. · 2018 [cited by applicant]
US 10152549B1 · Vanderwater et al. · 2018 [cited by applicant]
US 10325289B2 · Koran · 2019 [cited by applicant]
US 10600072B2 · Lamontagne et al. · 2020 [cited by applicant]
US 10607302B1 · Garcia-Martinez et al. · 2020 [cited by applicant]
US 10614504B2 · Wilkinson et al. · 2020 [cited by applicant]
US 10657544B2 · Cecchi et al. · 2020 [cited by applicant]
US 10657559B2 · Sinha et al. · 2020 [cited by applicant]
US 11301915B2 · Renaud et al. · 2022 [cited by applicant]
US 20020194058A1 · Eldering · 2002 [cited by applicant]
US 20030074369A1 · Schuetze et al. · 2003 [cited by applicant]
US 20040249774A1 · Caid et al. · 2004 [cited by applicant]
US 20050159996A1 · Lazarus et al. · 2005 [cited by applicant]
US 20060020662A1 · Robinson · 2006 [cited by applicant]
US 20060112098A1 · Renshaw · 2006 [cited by applicant]
US 20070217676A1 · Grauman et al. · 2007 [cited by applicant]
US 20100138452A1 · Henkin · 2010 [cited by applicant]
US 20110010307A1 · Bates · 2011 [cited by examiner]
US 20110196733A1 · Li · 2011 [cited by applicant]
US 20110208709A1 · Holthausen · 2011 [cited by applicant]
US 20120254184A1 · Choudhary et al. · 2012 [cited by applicant]
US 20130024415A1 · Herzog · 2013 [cited by applicant]
US 20130046772A1 · Gu et al. · 2013 [cited by applicant]
US 20130124298A1 · Li et al. · 2013 [cited by applicant]
US 20130262465A1 · Galle et al. · 2013 [cited by applicant]
US 20140089048A1 · Bruich · 2014 [cited by applicant]
US 20140257990A1 · Cudgma · 2014 [cited by applicant]
US 20140278799A1 · McLean · 2014 [cited by applicant]
US 20140278930A1 · Brixius et al. · 2014 [cited by applicant]
US 20140354649A1 · Asku et al. · 2014 [cited by applicant]
US 20150039620A1 · Ning · 2015 [cited by applicant]
US 20150100587A1 · Walkingshaw et al. · 2015 [cited by applicant]
US 20150106444A1 · Schneider et al. · 2015 [cited by applicant]
US 20160012485A1 · Dong · 2016 [cited by applicant]
US 20160042375A1 · Herman et al. · 2016 [cited by applicant]
US 20160071162A1 · Ogawa et al. · 2016 [cited by applicant]
US 20160076908A1 · Pang et al. · 2016 [cited by applicant]
US 20160140623A1 · Gupta et al. · 2016 [cited by applicant]
US 20160156945A1 · Romrell et al. · 2016 [cited by applicant]
US 20160328748A1 · Koran · 2016 [cited by applicant]
US 20170091471A1 · Su et al. · 2017 [cited by applicant]
US 20170142481A1 · Caruana et al. · 2017 [cited by applicant]
US 20170213242A1 · Sundaram et al. · 2017 [cited by applicant]
US 20190146981A1 · Hankinson · 2019 [cited by applicant]
US 20200265450A1 · Hankinson · 2020 [cited by applicant]
WO 0106398 · 2001 [cited by applicant]
WO 2010085874 · 2010 [cited by applicant]
WO PCTCA2017000144 · 2017 [cited by applicant]
WO 2017214703 · 2017 [cited by applicant]
Fred et al., “Learning Pairwise Similarity for Data Clustering”, 18th International Conference on Pattern Recognition (ICPR'06), 2006, vol. 1, pp. 925-928. [cited by applicant]
Burke, “Hybrid Recommender Systems: Survey and Experiments”, User Modeling and User-Adapted Interaction, Nov. 2002 (Nov. 2002), vol. 12(4), pp. 331-370. [cited by applicant]
Lindsay Kolowich, “How the News Feed Algorithms Work on Facebook, Twitter & Instagram”. Apr. 14, 2016 (Apr. 14, 2016), <https://web.archive.org/web/20161118231817/http://blog.hubspot.com:80/marketing/how-algorithm-works… [cited by applicant]
“A model-based music recommendation system for individual users and implicit user groups,” Hu, Yajie. University of Miami. ProQuest Dissertations Publishing, 2014; Dialog #1557780169 116pgs. (Year: 2014). [cited by applicant]
“Innovative Content Tech Continues Hot Streak with $4M Investment in Affinio,” Business Wire Nov. 3, 2015, Dialog #1729009642 3pgs. (Year: 2015). [cited by applicant]
“Leveraging multiviews of trust and similarity to enhance clustering-based recommender systems,” Guo et al., Knowledge-Based Systems, 15pgs. (Year: 2015). [cited by applicant]
Beel et al., “Mr. DLib: Recommendations-as-a-Service (RaaS) for Academia”, 978-1-5386-3861-3/17/$31.00, 2017, IEEE. [cited by applicant]
Jang et al., “DBSCAN++: Towards fast and scalable density clustering,” archive of Cornell University: arXiv:1810.13105 [cs.LG] Oct. 2018 <https://arxiv.org/abs/1810.13105>. [cited by applicant]
Roughgarden et al., “The Complexity of the k-means Method,” 24th Annual European Symposium on Algorithms (ESA 2016), Dagstuhl Research Online Publication Server citation: 10.4230/LIPIcs.ESA.2016.78 <https://drops.dagstu… [cited by applicant]
Beel et al., “Mr. DLib: Recommendations-as-a-Service (RaaS) for Academia”, 978-1-5386-3861-3/17/$31.00, Jun. 2017, IEEE. [cited by applicant]