Subgraph feature extraction based on multi-view dictionary learning for graph classification

摘要

Subgraph feature extraction of graph data has an efficiency problem that has become increasingly significant. A new architecture of subgraph feature extraction named GMADL is proposed in this paper. Dictionary learning approaches are put forward to extract the features of graph data to enhance the discrimination of model. To improve the efficiency of extraction, the analysis dictionary is designed as a bridge to generate the sparse code directly. Each sparse code represents the feature matrix of a graph. Through constructing the multi-view support vector machine (SVM) classifiers, the problem can be transferred into the multi-view problem so that the information of the whole view is utilized to predict the classification model. The comparison of the proposed architecture with the state-of-the-art approaches manifests the feasibility and the competitive performance in graph classification.