Defragging Subgraph Features for Graph Classification

Publisher:
ACM
Publication Type:
Conference Proceeding
Citation:
Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, 2015, pp. 1687 - 1690
Issue Date:
2015-10-19
Full metadata record
Files in This Item:
Filename Description Size
Haishuai-Wang.CIKM 2015.p1687-wang.pdfPublished version1.27 MB
Adobe PDF
Graph classification is an important tool for analysing structured and semi-structured data, where subgraphs are commonly used as the feature representation. However, the number and size of subgraph features crucially depend on the threshold parameters of frequent subgraph mining algorithms. Any improper setting of the parameters will generate many trivial short-pattern subgraph fragments which dominate the feature space, distort graph classifiers and bury interesting long-pattern subgraphs. In this paper, we propose a new Subgraph Join Feature Selection (SJFS) algorithm. The SJFS algorithm, by forcing graph classifiers to join short-pattern subgraph fragments, can defrag trivial subgraph features and deliver long-pattern interesting subgraphs. Experimental results on both synthetic and real-world social network graph data demonstrate the performance of the proposed method.
Please use this identifier to cite or link to this item: