System and method of graph feature extraction based on adjacency matrix
US11531710B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 26, 2019 |
| Grant date | Dec 20, 2022 |
| Priority date | — |
| Expiry date | Jul 2, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/16
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and system of graph feature extraction and graph classification based on adjacency matrix is provided. The invention first concentrates the connection information elements in the adjacency matrix into a specific diagonal region of the adjacency matrix which reduces the non-connection information elements in advance. Then the subgraph structure of the graph is further extracted along the diagonal direction using the filter matrix. Further, it uses a stacked convolutional neural network to extract a larger subgraph structure. On one hand, it greatly reduces the amount of computation and complexity, getting rid of the limitations caused by computational complexity and window size. On the other hand, it can capture large subgraph structure through a small window, as well as deep features from the implicit correlation structures at both vertex and edge level, which improves speed and accuracy of graph classification.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.