IP Library Granted Patent US 12,536,241
Granted Patent B2
US 12,536,241 · App. 19/195,181 · Granted Jan 27, 2026

Combined wide and deep machine learning models for automated database element processing systems, methods and apparatuses

Inventors: Bing Song (La Canada, CA); Jeffrey Michael Balbien (Los Angeles, CA); Hao Lu (Los Angeles, CA); Phillip Yang (Los Angeles, CA); Patrick Soon-Shiong (Los Angeles, CA)
Assignee: NantMedia Holdings, LLC
G06F16/9535G06F40/284G06F40/40G06N3/045
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,536,241
App. No.
19/195,181
Granted
Jan 27, 2026
Kind
B2
Abstract

A method of automated database element processing includes training a wide machine learning model with historical feature vector inputs to generate a wide ranked element output. The method includes training a deep machine learning model with the historical feature vector inputs to generate a deep ranked element output. The method includes generating a set of inputs specific to an individual entity, obtaining a set of current article database elements, and creating a feature vector input according to the set of inputs and the set of current article database elements. The method includes processing the feature vector input with the wide machine learning model to generate a wide ranked element list, processing the feature vector input with the deep machine learning model to generate a deep ranked element list, and merging database elements of the wide and deep ranked element lists to generate a ranked element recommendation output.

Claims (42)

1 . A computer-implemented method of managing news recommendation filter bubbles, comprising:

receiving, via at least one processor, a set of articles previously accessed by a user;

determining whether a number of articles previously accessed by the user satisfies read articles count criteria;

identifying, via the at least one processor, patterns from the set of articles previously accessed by the user;

identifying, via the at least one processor, terms opposing the patterns in the set of articles previously accessed by the user;

obtaining, via the at least one processor, a set of candidate articles having opposing content to the patterns based on the identified opposing terms;

receiving, via the at least one processor, user configuration input specifying how opposing content articles should be presented;

generating, via the at least one processor, a recommendation list including at least one article having opposing content according to the user configuration input; and

displaying on a display device, via the at least one processor, the recommendation list to the user.

2 . The method of claim 1 , wherein the opposing content comprises factual articles.

3 . The method of claim 1 , wherein the opposing content comprises opinion articles.

4 . The method of claim 1 , further comprising quantifying semantics for obtaining the set of candidate articles, which includes:

training a wide machine learning model using unsupervised learning; and

training a deep machine learning model using unsupervised learning.

5 . The method of claim 4 , wherein the wide machine learning model comprises a term frequency-inverse document frequency (TFIDF) model.

6 . The method of claim 4 , wherein the deep machine learning model comprises a Doc2Vec model.

7 . The method of claim 1 , further comprising determining a freshness score for each article having opposing content.

8 . The method of claim 7 , wherein the freshness score is based on a time period between when a recommendation is generated and when the article was published.

9 . The method of claim 1 , further comprising determining a section score for each article having opposing content based on a section overlap with the set of articles previously accessed by the user.

10 . The method of claim 1 , wherein receiving user configuration input comprises receiving a selection between factual opposing content articles and opinion opposing content articles.

11 . The method of claim 1 , further comprising obtaining a popular article list when the number does not satisfy the read articles count criteria.

12 . The method of claim 1 , further comprising retraining a Word2Vec model periodically, thereby updating the identified opposing terms.

13 . The method of claim 1 , wherein analyzing the set of candidate articles comprises:

generating a feature vector for each candidate article; and

comparing the feature vector against the identified opposing terms.

14 . The method of claim 1 , further comprising calculating a similarity score between each candidate article and the articles previously accessed by the user.

15 . The method of claim 14 , further comprising removing candidate articles having a similarity score above a threshold to ensure opposing content.

16 . The method of claim 1 , wherein the recommendation list includes both similar content articles and opposing content articles.

17 . The method of claim 1 , further comprising identifying user engagement with recommended opposing content articles including at least one of the following: a number of user views, a view time, and an eye movement.

18 . The method of claim 1 , further comprising identifying the opposing terms via Word2Vec.

19 . The method of claim 1 , further comprising capturing a change of interest of the user based on at least one sliding window.

20 . The method of claim 1 , wherein generating the recommendation list includes processing the set of candidate articles by a trained wide machine learning model to generate a wide ranked element list, processing the set of candidate articles by a trained deep machine learning model to generate a deep ranked element list, and merging elements of the wide ranked element list and the deep ranked element list to generate the recommendation list.

21 . A computer-implemented method of managing news recommendation filter bubbles, comprising:

receiving, via at least one processor, a set of articles previously accessed by a user;

identifying, via the at least one processor, patterns from the set of articles previously accessed by the user;

identifying, via the at least one processor, terms opposing the patterns in the set of articles previously accessed by the user;

obtaining, via the at least one processor, a set of candidate articles having opposing content to the patterns based on the identified opposing terms;

calculating a similarity score between each candidate article and the articles previously accessed by the user;

removing candidate articles having a similarity score above a threshold to ensure opposing content;

receiving, via the at least one processor, user configuration input specifying how opposing content articles should be presented;

generating, via the at least one processor, a recommendation list including at least one article having opposing content according to the user configuration input; and

displaying on a display device, via the at least one processor, the recommendation list to the user.

Assignments (6)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2025
From: YANG, PHILLIP; SOON-SHIONG, PATRICK
To: NANTWORKS, LLC
Reel/Frame 070994/0186 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2025
From: BALBIEN, JEFFREY MICHAEL; LU, HAO
To: LOS ANGELES TIMES COMMUNICATIONS, LLC
Reel/Frame 070994/0203 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2025
From: SONG, BING
To: IMMUNITYBIO, INC.
Reel/Frame 070994/0215 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2025
From: LOS ANGELES TIMES COMMUNICATIONS, LLC
To: NANTMEDIA HOLDINGS, LLC
Reel/Frame 070994/0254 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2025
From: NANTWORKS, LLC
To: NANTMEDIA HOLDINGS, LLC
Reel/Frame 070994/0277 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2025
From: IMMUNITYBIO, INC.
To: NANTMEDIA HOLDINGS, LLC
Reel/Frame 070994/0289 →
Continuity (5)
Continuation 18988223 · Dec 19, 2024
Continuation 18807634 · Aug 16, 2024
Continuation 17643881 · Dec 13, 2021
Provisional Application 63125570 · Dec 15, 2020
Related Publication 20250272346A1 · Aug 28, 2025
References Cited (34)
US 10938979B1 · Dave et al. · 2021 [cited by applicant]
US 11210583B2 · Mathew et al. · 2021 [cited by applicant]
US 11393036B2 · Wang et al. · 2022 [cited by applicant]
US 11716400B2 · Harish et al. · 2023 [cited by applicant]
US 20140317105A1 · Jain · 2014 [cited by examiner]
US 20150088888A1 · Brennan · 2015 [cited by examiner]
US 20150293897A1 · Myslinski · 2015 [cited by examiner]
US 20170300814A1 · Shaked · 2017 [cited by examiner]
US 20180158004A1 · Davar · 2018 [cited by examiner]
US 20180276305A1 · Liu · 2018 [cited by examiner]
US 20190050750A1 · Le et al. · 2019 [cited by applicant]
US 20190139092A1 · Nomula · 2019 [cited by applicant]
US 20200026769A1 · Tripodi · 2020 [cited by examiner]
US 20210042374A1 · Davis · 2021 [cited by examiner]
US 20210097367A1 · Zhang et al. · 2021 [cited by applicant]
US 20220188366A1 · Song et al. · 2022 [cited by applicant]
US 20220197248A1 · Weinberg · 2022 [cited by applicant]
US 20220222289A1 · Srinivasan · 2022 [cited by examiner]
US 20220230226A1 · Shahrasbi et al. · 2022 [cited by applicant]
US 20220398643A1 · Sivakumar et al. · 2022 [cited by applicant]
US 20230093756A1 · Banerjee · 2023 [cited by examiner]
US 20230315781A1 · Huang · 2023 [cited by examiner]
US 20240411827A1 · Song et al. · 2024 [cited by applicant]
US 20250131055A1 · Song et al. · 2025 [cited by applicant]
Wu, F., et al., “MIND: A Large-scale Dataset for News Recommendation,” p. 1-10 (2020). [cited by applicant]
Cheng, H., et al., “Wide & Deep Learning for Recommender Systems,” Jun. 24, 2016, p. 1-4. [cited by applicant]
Le, Q., & Mikolov, T., “Distributed Representations of Sentences and Documents,” Google Inc., May 22, 2014, p. 1-9. [cited by applicant]
Wikipedia, “tf-idf” Aug. 25, 2020, https://en.wikipedia.org/wiki/Tf-idf. [cited by applicant]
Wikipedia, “Okapi BM25”, Aug. 25, 2020, http://en.wikipedia.org/wiki/Okapi_BM25. [cited by applicant]
Reimers, N., & Gurevych, I., “Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks,” Aug. 27, 2019, p. 1-11. [cited by applicant]
Vaswani, A., et al., “Attention is All You Need,” Dec. 6, 2017, p. 1-15. [cited by applicant]
Giorgi, J.M., et al., “DeCLUTR: Deep Contrastive Learing for Unsupervised Textual Representations,” Jun. 11, 2020, pp. 1-22. [cited by applicant]
W. Jing and Y. Bailong (2021). News Text Classification and Recommendation Technology Based on Wide & Deep-Bert Model. IEEE International Conference on Information Communication and Software Engineering (ICICSE), 209-21… [cited by applicant]
Non-Final Office Action from U.S. Appl. No. 18/988,223 dated Feb. 12, 2025. [cited by applicant]