Supercharge Your Innovation With Domain-Expert AI Agents!

Unsupervised graph topology transformation covariant representation learning method and device

A topological transformation, unsupervised technique, applied in the field of unsupervised learning

Inactive Publication Date: 2021-04-09
PEKING UNIV
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, GraphTER only explores the transformation of node features, while the graph topology has not been fully explored, but it is crucial in unsupervised graph representation learning

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
  • Unsupervised graph topology transformation covariant representation learning method and device
  • Unsupervised graph topology transformation covariant representation learning method and device
  • Unsupervised graph topology transformation covariant representation learning method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] The present invention will be described in further detail below through specific embodiments and accompanying drawings. Before introducing the main steps of the method of the present invention, first introduce the basic concept of graph and graph topology transformation.

[0041] (1) Graph and graph signal:

[0042] Define an undirected graph, is the set of vertices on the graph, N is the number of vertices on the graph; ε is the set of edges. Graph signals refer to data residing on the vertices of graphs, such as social networks, transportation networks, sensor networks, and neuronal networks, represented as matrices The i-th row of the matrix represents a C-dimensional feature on vertex i. To represent the connectivity between nodes, we define the adjacency matrix as The matrix is ​​a real symmetric matrix. if a i,j =1, it means that vertices i and j are connected; if a i,j = 0, it means that vertices i and j are not connected.

[0043] (2) Graph topolo...

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 discloses an unsupervised graph topology transformation covariant representation learning method and a device, and relates to the field of unsupervised learning. The method is a universal framework which can be applied to learning graph node feature representation in the GCNN, and graph topology transformation covariant representation is formalized by maximizing graph topology transformation and mutual information between node representation of graphs before and after transformation. At the same time, the present invention demonstrates that maximization of this mutual information can be approximated to minimize cross entropy between graph topology transforms and graph topology transforms estimated from node representations of graphs before and after transformation. Specifically, part of node pairs are sampled from an original graph, connectivity of edges between the node pairs is turned over to achieve graph topology transformation, then graph topology transformation is reconstructed from feature representation of the original graph and the transformed graph, self-training is conducted on a representation encoder, and feature representation of nodes is learned. The method is applied to node classification and graph classification tasks and is superior to the latest unsupervised method.

Description

technical field [0001] The invention relates to the field of unsupervised learning, in particular to a method and device for unsupervised graph topology transformation covariant representation learning. Background technique [0002] Graph is a natural and effective representation of irregular data / non-Euclidean data (such as 3D point cloud, social network, citation network, brain network, etc.). Due to the powerful expressiveness of graphs, more and more attention has been paid to machine learning of graph data, such as the Graph Convolutional Neural Network (GCNN) proposed in recent years. However, most existing GCNN models are trained in a supervised or semi-supervised manner, which requires a large number of labeled samples to learn effective feature representations. Due to the high labeling cost (especially on large-scale graphs), existing methods are difficult to apply widely. Therefore, we need to learn graph feature representations in an unsupervised manner in order...

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/08G06N3/04
CPCG06N3/088G06N3/04G06N3/047
Inventor 胡玮高翔郭宗明
Owner PEKING UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More