Journal of University of Science and Technology of China ›› 2016, Vol. 46 ›› Issue (9): 749-756.DOI: 10.3969/j.issn.0253-2778.2016.09.006

• Original Paper • Previous Articles    

Dimensionality reduction method of graph kernel based on KLDA

YU Yajun, PAN Zhisong, HU Guyu, MO Xiaoyong, XUE Jiao   

  1. College of Command Information System, PLA University of Science and Technology, Nanjing 210007, China
  • Received:2016-03-01 Revised:2016-09-17 Accepted:2016-09-17 Online:2016-09-17 Published:2016-09-17

Abstract: Graph structure has strong expression ability and high flexibility. The identification and classification of graph structure data fall into the category of structural pattern recognition. The research idea of the graph structure data is to transform the graph structure data to the vector in the vector space, then the traditional machine learning algorithm is used to analyze the vector. Data representation and analysis based on graph structure has become a hot research topic in the field of machine learning. The classical graph kernel method was extended. The kernel linear discriminant analysis (KLDA) was employed to reduce the dimension of the high dimension feature space, and the low dimensional feature space corresponding to the original graph structure data was obtained. Then the traditional machine learning algorithm was used to analyze these new data. The effectiveness of the proposed method is verified by the experimental results on standard data sets.

Key words: graph classification, graph kernel, kernel linear discriminant analysis, dimensionality reduction

CLC Number: