Super-Graph Classification Based on Composite Subgraph Features and Extreme Learning Machine
- 69 Downloads
A multi-graph is modeled as a bag of graphs, whose mutual relationships can be used to enhance the accuracy of multi-graph classification. However, to the best of our knowledge, research on utilizing those mutual relationships has not been reported. In this paper, we propose a novel super-graph model \(SG=(MG,AG)\), where MG denotes a multi-graph and AG represents a graph (named abstract-graph), that describes the mutual relationships among the graphs contained in MG. The super-graph classification problem is challenging to solve because of the very complex structure of the super-graph model. Furthermore, it is hard to directly select distinguished subgraphs, i.e., subgraph features, from super-graphs. A subgraph g of graph G is a graph that is isomorphic with one of the substructures of G. Moreover, the practical applications require the super-graph classification algorithm to have high precision. In this paper, we propose a concept and algorithm for selecting composite subgraph features, based on which a framework is proposed to solve the super-graph classification problem. Subgraph features denote subgraphs that can be used to distinguish super-graphs with different class labels. We first design a two-step approach to select k composite subgraph features from the subgraphs of super-graphs’ abstract-graphs and multi-graphs. Then, based on composite features and the subgraph feature representation of a super-graph, each super-graph SG is transformed into a 0-1 vector with k dimensions. If there exists a substructure in SG that is isomorphic with its i th composite feature, the i th component of the target vector is set to 1 (1 ≤ i ≤ k). Otherwise, it is set to 0. Based on the derived k-dimensional vectors, one of the existing classification algorithms is used to construct a prediction model to predict the class labels of the unseen super-graphs, such as naive Bayes or support vector machine (SVM). Specifically, we adapt the extreme learning machine (ELM) algorithm to further improve the accuracy of super-graph classification. In this paper, we propose a super-graph model and study the problem of super-graph classification. We first derive the concept of composite subgraph features that are selected by our proposed two-step method. Based on the mined composite subgraph features, we propose a super-graph classification framework (SGC) to solve the super-graph classification problem. Moreover, ELM can be used to further improve the classification accuracy. Extensive experiments on real-world image datasets show that our algorithm based on ELM is more accurate than the baseline algorithms.
KeywordsMulti-graph Super-graph Classification Extreme learning machine
The work is partially supported by the National Natural Science Foundation of China (No. 61702381, No. 61772124, No. 61872070), the Hubei Natural Science Foundation (No. 2017CFB196), the Scientific Research Foundation of Wuhan University of Science and Technology (2017xz015), and the Fundamental Research Funds for the Central Universities (150402002, 171605001). Jia Xu is supported the Key Projects of Higher Education Undergraduate Teaching Reform Project in Guangxi (No. 2017JGZ103) and the Scientific Research Foundation of GuangXi University (No. XGZ141182).
Compliance with Ethical Standards
Conflict of interests
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
Informed consent was obtained from all individual participants included in the study.
- 1.Wu J, Hong Z, Pan S, et al. Multi-graph learning with positive and unlabeled bags. SDM; 2014. p. 217–25.Google Scholar
- 2.Wu J, Zhu X, Zhang C, et al. Bag constrained structure pattern mining for multi-graph classification. TKDE 2014;26(10):2382–96.Google Scholar
- 3.Wu J, Pan S, Zhu X, et al. Boosting for multi-graph classification. T Cybern 2015;45(3):430–43.Google Scholar
- 5.Pang J, Gu Y, Xu J, et al. Parallel multi-graph classification using extreme learning machine and MapReduce. ELM; 2015. p. 77–92.Google Scholar
- 9.Kong X, Yu P. Semi-supervised feature selection for graph classification. KDD; 2010. p. 793–802.Google Scholar
- 10.Yan X, Cheng H, Han J, et al. Mining significant graph patterns by leap search. SIGMOD; 2008. p. 433–44.Google Scholar
- 11.Ranu S, Singh A. Graphsig: a scalable approach to mining significant subgraphs in large graph databases. ICDE; 2009 . p. 844–55.Google Scholar
- 12.Jin N, Wang W. LTS: discriminative subgraph mining by learning from search history. ICDE; 2011. p. 207–18.Google Scholar
- 13.Zhu Y, Yu J, Cheng H, et al. Graph classification: a diversified discriminative feature selection approach. CIKM; 2012. p. 205–14.Google Scholar
- 14.Huang G, Zhu Q, Siew CK. Extreme learning machine: a new learning scheme of feedforward neural networks. IJCNN; 2004. p. 985–90.Google Scholar
- 15.Huang G, Liang N, Rong H, et al. On-line sequential extreme learning machine. IASTED; 2005. p. 232–7.Google Scholar
- 31.Cui D, Huang G, Liu T. Smile detection using pair-wise distance vector and extreme learning machine. International joint conference on neural networks (IJCNN); 2016. p. 2298–305.Google Scholar
- 42.Spark. http://spark.apache.org/. 2017.
- 43.Basic ELM algorithms. http://www.ntu.edu.sg/home/egbhuang/elm_codes.html. 2017.
- 44.Wikipedia. https://en.wikipedia.org/wiki/Main_Page. 2017.
- 45.Naive Bayes EM algorithm. http://www.mloss.org/software/view/357/.
- 46.Joachims T. SVM-light http://svmlight.joachims.org/. 2017.
- 47.Zhou ZH, Sun YY, Li YF. Multi-instance learning by treating instances as Non-I.I.D. samples. International conference on machine learning; 2009. p. 1249–56.Google Scholar