Method and apparatus for embedding data network graph, computer device, and storage medium

Patent metadata

Field	Value
Publication number	US-2025053825-A1
Application number	US-202418812341-A
Country	US
Kind code	A1
Filing date	Aug 22, 2024
Priority date	Jul 29, 2022
Publication date	Feb 13, 2025
Grant date	—

Abstract

A method for embedding a data network graph includes: performing node feature extraction on a data network graph and a negative sample network graph using a first network embedding model, to obtain a positive sample embedding vector and a negative sample embedding vector performing node feature extraction on a first enhanced graph and a second enhanced graph of the data network graph using the first network embedding model, to obtain a first global embedding vector and a second global embedding vector; determining a first matching degree and a second matching degree; adjusting a parameter of the first network embedding model based on a loss value determined based on the first matching degree and the second matching degree; and performing node feature extraction on the data network graph based on an adjusted first network embedding model, to obtain an embedding vector configured for classifying each node in the data network graph.

First claim

What is claimed is:

1 . A method for embedding a data network graph, performed by a computer device, the method comprising:
performing node feature extraction on the data network graph and a negative sample network graph using a first network embedding model, to obtain a positive sample embedding vector and a negative sample embedding vector, the data network graph being a positive sample network graph and being an imbalanced network graph constructed based on an imbalanced object dataset; performing node feature extraction on a first enhanced graph and a second enhanced graph of the data network graph using the first network embedding model, to obtain a first global embedding vector and a second global embedding vector; determining first matching degrees between the positive sample embedding vector and the first global embedding vector as well as the second global embedding vector, and determining second matching degrees between the negative sample embedding vector and the first global embedding vector as well as the second global embedding vector; determining a loss value based on the first matching degrees and the second matching degrees, and adjusting a parameter of the first network embedding model based on the loss value; and performing node feature extraction on the data network graph based on an adjusted first network embedding model, to obtain an embedding vector configured for classifying a node in the data network graph.

2 . The method according to claim 1 , further comprising:
performing first data enhancement on the data network graph, to obtain the first enhanced graph; and performing second data enhancement on the data network graph, to obtain the second enhanced graph, the first data enhancement and the second data enhancement being respectively at least one of feature masking, edge perturbation, or sub-graph extraction.

3 . The method according to claim 2 , wherein performing the first data enhancement on the data network graph, to obtain the first enhanced graph comprises:
selecting a sampling node in the data network graph, performing gradual diffusion sampling with a first sampling node as a center point, and placing a neighboring node sampled each time into a first sampling set during the gradual diffusion sampling; and when a quantity of nodes in the first sampling set reaches a target value, stopping the sampling, to obtain the first enhanced graph; and performing the second data enhancement on the data network graph, to obtain the second enhanced graph comprises: performing feature masking on the data network graph, to obtain the second enhanced graph.

4 . The method according to claim 1 , further comprising:
performing out-of-order processing on a feature corresponding to each node in the data network graph, to obtain the negative sample network graph, a node structure of the negative sample network graph being consistent with a node structure of the data network graph.

5 . The method according to claim 1 , further comprising:
obtaining the object dataset and an association relationship between each piece of object data in the object dataset; and constructing the data network graph using each piece of object data in the object dataset as a node and using the association relationship as an edge of the node.

6 . The method according to claim 1 , wherein performing the node feature extraction on the first enhanced graph and the second enhanced graph of the data network graph using the first network embedding model, to obtain the first global embedding vector and the second global embedding vector comprises:
extracting a first local embedding vector and a second local embedding vector of each node from the first enhanced graph and the second enhanced graph respectively using the first network embedding model; and performing pooling on the first local embedding vector and the second local embedding vector respectively, to obtain the first global embedding vector and the second global embedding vector.

7 . The method according to claim 6 , wherein extracting the first local embedding vector and the second local embedding vector of each node from the first enhanced graph and the second enhanced graph respectively using the first network embedding model comprises:
obtaining a first adjacency matrix and a first feature matrix of nodes in the first enhanced graph; inputting the first adjacency matrix and the first feature matrix into the first network embedding model, to cause the first network embedding model to generate the first local embedding vector of each node in the first enhanced graph based on the first adjacency matrix, a degree matrix of the first adjacency matrix, the first feature matrix, and a weight matrix of the first network embedding model; and obtaining a second adjacency matrix and a second feature matrix of nodes in the second enhanced graph; and inputting the second adjacency matrix and the second feature matrix into the first network embedding model, to cause the first network embedding model to generate the second local embedding vector of each node in the second enhanced graph based on the second adjacency matrix, a degree matrix of the second adjacency matrix, the second feature matrix, and the weight matrix of the first network embedding model.

8 . The method according to claim 1 , further comprising:
classifying the embedding vector using a classifier, to obtain a prediction result; performing parameter adjustment on the classifier based on a loss value between the prediction result and a classification label; and stopping a training process when an adjusted classifier reaches a convergence condition.

9 . The method according to claim 8 , further comprising:
obtaining a document citation relationship graph; extracting a first embedding vector of the document citation relationship graph using the first network embedding model; and classifying the first embedding vector using the classifier, to obtain a subject or field of each document.

10 . The method according to claim 8 , further comprising:
obtaining a media interaction graph; extracting a second embedding feature of the media interaction graph using the first network embedding model; classifying the second embedding feature using the classifier, to obtain an interest type corresponding to an object node; and recommending target media to a media account corresponding to the object node based on the interest type.

11 . The method according to claim 8 , further comprising:
obtaining a social relationship graph; extracting a third embedding feature of the social relationship graph using the first network embedding model; classifying the third embedding feature using the classifier, to obtain a communication group in which a social object is interested; and pushing the communication group in which the social object is interested to the social object.

12 . The method according to claim 1 , further comprising:
performing node feature extraction on the data network graph using a second network embedding model, and reconstructing a target adjacency matrix based on an extracted node feature; adjusting a parameter of the second network embedding model based on a loss value between the target adjacency matrix and a matrix label; obtaining, when an adjusted second network embedding model reaches a convergence condition, structural information of each node in the data network graph using the adjusted second network embedding model; and using a spliced vector between the embedding vector and the structural information as a target embedding vector configured for classifying each node in the data network graph.

Assignees

• Tencent Tech Shenzhen Co Ltd

Inventors

• Zhang Jie
• Huang Wen
• Dong Jingran
• Chen Shouzhi
• Chen Chuan
• Zhang Ziyang

Classifications

• G06N3/04

  Architecture, e.g. interconnection topology · CPC title

• G06N3/045

  Combinations of networks · CPC title

• G06N3/098 Primary

  Distributed learning, e.g. federated learning · CPC title

• G06N3/042

  Knowledge-based neural networks; Logical representations of neural networks · CPC title

• G06N3/0464

  Convolutional networks [CNN, ConvNet] · CPC title