Attribute graph group discovery method based on maximized mutual information and graph neural network

A technology that maximizes mutual information and neural networks, applied in the field of big data, can solve problems such as unsupervised difficulties and lack of modeling, achieve high accuracy and facilitate iterative updates

Pending Publication Date: 2020-11-24
FUDAN UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, when this method is reconstructed, only the edge-related information is used as the optimization goal, and it lacks the modeling of the attribute characteristics of the attribute graph itself.
Moreover, th

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Attribute graph group discovery method based on maximized mutual information and graph neural network
  • Attribute graph group discovery method based on maximized mutual information and graph neural network
  • Attribute graph group discovery method based on maximized mutual information and graph neural network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] In order to make the technical means, creative features, goals and effects achieved by the present invention easy to understand, the method for discovering attribute graph groups based on maximizing mutual information and graph neural networks of the present invention will be described in detail below in conjunction with the embodiments and accompanying drawings.

[0032]

[0033] figure 1 It is a flow chart of an attribute graph group discovery method based on maximizing mutual information and a graph neural network according to an embodiment of the present invention.

[0034] Such as figure 1 As shown, the process of the attribute graph group discovery method based on maximizing mutual information and graph neural network includes the following steps:

[0035]Step S1, obtaining node information of each node in the attribute graph to be processed, and processing all node information to obtain a matrix to be processed including an adjacency matrix and an attribute ma...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides an attribute graph group discovery method based on maximum mutual information and a graph neural network. The method is characterized in that the method comprises steps of carrying out the representation learning of a to-be-processed matrix through a pre-trained graph neural network, obtaining a preliminary node representation, and carrying out the mutual information calculation of a to-be-processed attribute graph, and obtaining a global mutual information value; dividing the preliminary node representation to the centers of a plurality of groups by using soft clustering to obtain an allocation matrix; carrying out modularity and mutual information calculation in the to-be-processed attribute graph on the original group according to the allocation matrix to obtain amodularity value and group mutual information; and calculating total loss according to the modularity value, the group mutual information and the global mutual information value, and iteratively updating the graph neural network through gradient return according to the total loss till a group discovery result is obtained. According to the method, the end-to-end updating graph neural network doesnot need to be realized step by step, the node attribute relationship can be better captured, and a group discovery result with higher accuracy is obtained.

Description

technical field [0001] The invention belongs to the technical field of big data, and in particular relates to a method for discovering attribute graph groups based on maximizing mutual information and a graph neural network. Background technique [0002] A network graph consists of several nodes and links connecting these nodes. It exists widely in real life and can be used to represent the connection between objects. Representing the structure of network graphs and node attributes in the form of vector data has attracted the attention of many researchers, especially representing the nodes contained in complex and irregular network graphs as vectors of equal length and low dimensionality is the focus of research. As the basis of machine learning, this vector can make machine learning tasks such as node classification, node clustering, anomaly detection and link prediction perform better. [0003] Currently, Community Detection is widely used in node clustering tasks. Among...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06N3/04G06N3/08G06K9/62G06F16/906
CPCG06N3/084G06N3/088G06F16/906G06N3/048G06N3/045G06F18/23
Inventor 熊贇张天奇张尧朱扬勇
Owner FUDAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products