Abstract
Identification and classification of graph data is a hot research issue in pattern recognition. The conventional methods of graph classification usually convert the graph data to vector representation which ignore the sparsity of graph data. In this paper, we propose a new graph classification algorithm called graph classification based on sparse graph feature selection and extreme learning machine. The key of our method is using lasso to select sparse feature because of the sparsity of the corresponding feature space of the graph data, and extreme learning machine (ELM) is introduced to the following classification task due to its good performance. Extensive experimental results on a series of benchmark graph datasets validate the effectiveness of the proposed methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Vishwanathan, S.V.N., Schraudilph, N.N., Kondor, R.: Graph kernels. J. Mach. Learn. Res. 11, 1201–1242 (2010)
Wu X., Zhang, D.: Graph kernel based semi-supervised dimensionality reduction method. J. Front. Comput. Sci. Technol. (2010)
Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12, 2536–2561 (2011)
Borgwardt, K.M., Kriegel, H.P. M.: Shortest-path kernels on graphs. In: The 5th IEEE International Conference on Data Mining (2005)
Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: The 20th International Conference on Machine Learning (ICML) (2003)
Gartner, T., Flach, P.A., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: The 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop (COLT) (2003)
Horvath, T., Gartner, T., Wrobel, S.: Cyclic pattern kernels for predictive graph mining. In: The International Conference On Knowledge Discovery and Data Mining (2004)
Mahe, P., Vert, J.P.: Graph kernels based on tree patterns for molecules. Mach. Learn. 205–214 (2009)
Shervashidze, N., Borgwardt, K.: Fast subtree kernels on graphs. Int. Conf. Neural Inf. Process. Syst. (2009)
Tishirani, R.: Regression Shrinkage and Selection via the Lasso. J. R. Stat. Soc. Seris B, 267–288 (1996)
Liu, J., Ji, S., Ye, J.: SLEP: Sparse learning with efficient projections. Arizona State University, 6 (2009)
Huang, G.B., Chen, L., Siew, C.K.: Universal approximation using incremental constructive feedforward networks with random hidden nodes. IEEE Trans. Neural Netw. 17(4), 879–892 (2006)
Serre, D.: Matrices: Theory and Applications. Springer, New York (2002)
Debnath, A.K., Compadre, R.D., Debnath, G., et al.: Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds: correlation with molecular orbital energies and hydrophobicity. J. Med. Chem. 34, 786–797 (1991)
Helma, C., King, R.D., Kramer, S., et al.: The predictive toxicology challenge. Bioinformatics, 107–108 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Yu, Y., Pan, Z., Hu, G. (2016). Graph Classification Based on Sparse Graph Feature Selection and Extreme Learning Machine. In: Cao, J., Mao, K., Wu, J., Lendasse, A. (eds) Proceedings of ELM-2015 Volume 1. Proceedings in Adaptation, Learning and Optimization, vol 6. Springer, Cham. https://doi.org/10.1007/978-3-319-28397-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-28397-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28396-8
Online ISBN: 978-3-319-28397-5
eBook Packages: EngineeringEngineering (R0)