# US 2025/0148280 A1 · Techniques for learning co-engagement and semantic relationships using graph neural networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0148280 A1
- Document ID: US20250148280A1
- Status: Published application
- Kind: A1
- Application number: 18/905,006
- Filed: 2024-10-02
- Published: 2025-05-08
- Earliest claimed: 2023-11-06
- Assignees: Netflix, Inc.
- Applicants: Netflix, Inc.
- Inventors: Anne O’Donnell COCOS; Baolin LI; Hafez ASGHARZADEH; Evan Gabriel Turitz COX; Zijie HUANG; Sudarshan Dnyaneshwar LAMKHEDE; Lingyi LIU; Colby J. WISE
- Web page: https://patentgrep.com/patent/US20250148280A1

## CPC

- G06N 3/08: Learning methods
- G06N 3/042: Knowledge-based neural networks; Logical representations of neural networks
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

One embodiment of a method for training a machine learning model includes generating a graph based on one or more semantic concepts associated with a plurality of entities and user engagement with the plurality of entities, and performing one or more operations to train an untrained machine learning model based on the graph to generate a trained machine learning model.

## Claims

### Claim 1

A computer-implemented method for training a machine learning model, the method comprising:
generating a graph based on one or more semantic concepts associated with a plurality of entities and user engagement with the plurality of entities; and
performing one or more operations to train an untrained machine learning model based on the graph to generate a trained machine learning model.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the machine learning model comprises a graph neural network.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the graph includes a first set of nodes representing the plurality of entities and a second set of nodes representing the one or more semantic concepts, and performing the one or more operations to train the untrained machine learning model comprises:
generating a plurality of subgraphs based on the graph, wherein each subgraph included in the plurality of subgraphs includes the second set of nodes and a different subset of nodes from the first set of nodes; and
training the untrained machine learning model using a plurality of processors, wherein each processor included in the plurality of processors stores a different subgraph included in the plurality of subgraphs.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein generating the plurality of subgraphs comprises:
partitioning a first subset of nodes included in the first set of nodes into a plurality of partitions, wherein each node included in the first subset of nodes is linked within the graph to at least one other node included in the first set of nodes;
assigning each node included in a second subset of nodes included in the first set of nodes to one partition included in the plurality of partitions; and
adding the second set of nodes to each partition included in the plurality of partitions.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the graph includes a first set of nodes representing the plurality of entities and a second set of nodes representing the one or more semantic concepts, and performing the one or more operations to train the untrained machine learning model comprises:
generating one or more feature vectors for the second set of nodes; and
training the untrained machine learning model based on the graph, the one or more feature vectors, and one or more features associated with plurality of entities.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein generating the one or more feature vectors comprises performing one or more knowledge graph embedding operations based on the graph.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the one or more operations to train the untrained machine learning model are further based on a loss that reduces a distance within a latent space between at least two entities represented by at least two nodes included in the graph that are linked to one another.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the graph includes a plurality of first nodes representing the plurality of entities, one or more second nodes representing the one or more semantic concepts, one or more first links between at least one first node included in the plurality of first nodes and at least one other first node included in the plurality of first nodes, and one or more second links between at least one second node included in the one or more second nodes and at least one first node included in the plurality of first nodes.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, further comprising:
processing another graph using the trained machine learning model to generate a plurality of embeddings associated with another plurality of entities; and
generating one or more search results based on the plurality of embeddings.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, further comprising:
processing another graph using the trained machine learning model to generate a plurality of embeddings associated with another plurality of entities; and
generating one or more recommendations based on the plurality of embeddings.

### Claim 11

One or more non-transitory computer-readable media storing instructions that, when executed by at least one processor, cause the at least one processor to perform steps comprising:
generating a graph based on one or more semantic concepts associated with a plurality of entities and user engagement with the plurality of entities; and
performing one or more operations to train an untrained machine learning model based on the graph to generate a trained machine learning model.

### Claim 12 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the machine learning model comprises a graph neural network.

### Claim 13 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the graph includes a first set of nodes representing the plurality of entities and a second set of nodes representing the one or more semantic concepts, and performing the one or more operations to train the untrained machine learning model comprises:
generating a plurality of subgraphs based on the graph, wherein each subgraph included in the plurality of subgraphs includes the second set of nodes and a different subset of nodes from the first set of nodes; and
training the untrained machine learning model using a plurality of processors, wherein each processor included in the plurality of processors stores a different subgraph included in the plurality of subgraphs.

### Claim 14 (depends on 13)

The one or more non-transitory computer-readable media of claim 13, wherein generating the plurality of subgraphs comprises:
partitioning a first subset of nodes included in the first set of nodes into a plurality of partitions, wherein each node included in the first subset of nodes is linked within the graph to at least one other node included in the first set of nodes;
assigning each node included in a second subset of nodes included in the first set of nodes to one partition included in the plurality of partitions; and
adding the second set of nodes to each partition included in the plurality of partitions.

### Claim 15 (depends on 13)

The one or more non-transitory computer-readable media of claim 13, wherein generating the plurality of subgraphs is further based on a user-specified subset of the first set of nodes.

### Claim 16 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the graph includes a first set of nodes representing the plurality of entities and a second set of nodes representing the one or more semantic concepts, and performing the one or more operations to train the untrained machine learning model comprises:
generating one or more feature vectors for the second set of nodes; and
training the untrained machine learning model based on the graph, the one or more feature vectors, and one or more features associated with plurality of entities.

### Claim 17 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the trained machine learning model includes one or more weights that are aware of one or more types of semantic relationships.

### Claim 18 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the instructions, when executed by the at least one processor, further cause the at least one processor to perform the steps of:
processing another graph using the trained machine learning model to generate a plurality of embeddings associated with another plurality of entities; and
generating at least one search result or recommendation based on the plurality of embeddings.

### Claim 19 (depends on 11)

The one or more non-transitory computer-readable media of claim 11, wherein the plurality of entities includes at least one media content title, person, or book.

### Claim 20

A system, comprising:
one or more memories storing instructions; and
one or more processors coupled to the one or more memories that, when executing the instructions, perform the steps of:
generate a graph based on one or more semantic concepts associated with a plurality of entities and user engagement with the plurality of entities, and
perform one or more operations to train an untrained machine learning model based on the graph to generate a trained machine learning model.
