Deep topology classification: A new approach for massive graph classification

Citations Over TimeTop 10% of 2016 papers

Abstract

The classification of graphs is a key challenge within many scientific fields using graphs to represent data and is an active area of research. Graph classification can be critical in identifying and labelling unknown graphs within a dataset and has seen application across many scientific fields. Graph classification poses two distinct problems: the classification of elements within a graph and the classification of the entire graph. Whilst there is considerable work on the first problem, the efficient and accurate classification of massive graphs into one or more classes has, thus far, received less attention. In this paper we propose the Deep Topology Classification (DTC) approach for global graph classification. DTC extracts both global and vertex level topological features from a graph to create a highly discriminate representation in feature space. A deep feed-forward neural network is designed and trained to classify these graph feature vectors. This approach is shown to be over 99% accurate at discerning graph classes over two datasets. Additionally, it is shown to be more accurate than current state of the art approaches both in binary and multi-class graph classification tasks.

Related Papers

• → Learning Node Embeddings in Interaction Graphs(2017)63 cited
• → GPENs: Graph Data Learning With Graph Propagation-Embedding Networks(2021)15 cited
• → HyperJOIE: Two-View Hyperbolic Knowledge Graph Embedding with Entities and Concepts Jointly(2021)1 cited
• → Co-embedding of Nodes and Edges with Graph Neural Networks(2020)
• → Learning Attentive Attribute-Aware Node Embeddings in Dynamic Environments(2022)