Graph classification: A diversified discriminative feature selection approach

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 205-214

  Zhu, Yuanyuan ^a   Yu, Jeffrey Xu ^a   Cheng, Hong ^a   Qin, Lu ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

diversity; feature selection; graph classification

Indexed keywords

CLASSIFICATION ACCURACY; CLASSIFICATION APPROACH; CLASSIFICATION MODELS; COMPLEX STRUCTURE; DISCRIMINATIVE FEATURES; DIVERSITY; FEATURE SELECTION AND CLASSIFICATION; FREQUENT SUBGRAPHS; GRAPH CLASSIFICATION; GRAPH DATABASE; GRAPH MODEL; PERFORMANCE STUDY; STRUCTURAL RELATIONSHIP; SUBGRAPHS;

GRAPHIC METHODS; KNOWLEDGE MANAGEMENT;

FEATURE EXTRACTION;

EID: 84871039216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2396761.2396791     Document Type: Conference Paper

References (24)

1. D. Bandyopadhyay, J. Huan, J. Liu, J. Prins, J. Snoeyink, W. Wang, and A. Tropsha. Structure-based function inference using protein family-specific fingerprints. Protein Science, 15(6):1537-1543, 2006.
2. C.-C. Chang and C.-J. Lin. Libsvm: A library for support vector machines, 2001. software available at http://www.csie.ntu.edu.tw/cjlin/libsvm.
3. C. Chen, C. X. Lin, M. Fredrikson, M. Christodorescu, X. Yan, and J. Han. Mining graph patterns efficiently via randomized summaries. PVLDB, 2(1):742-753, 2009.
4. H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In ICDE, pages 716-725, 2007.
5. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. TKDE, 17(8):1036-1050, 2005.
6. F. Fleuret. Fast binary feature selection with conditional mutual information. JMLR, 5:1531-1555, 2004.
7. J. Han, J.Wang, Y. Lu, and P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM, pages 211-218, 2002.
8. M. A. Hasan and M. J. Zaki. Output space sampling for graph patterns. PVLDB, 2(1):730-741, 2009.
9. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, pages 549-552, 2003.
10. J. Huan, W. Wang, J. Prins, and J. Yang. Spin: mining maximal frequent subgraphs from graph databases. In KDD, pages 581-586, 2004.
11. N. Jin, C. Young, and W. Wang. Graph classification based on pattern co-occurrence. In CIKM, pages 573-582, 2009.
12. N. Jin, C. Young, and W. Wang. Gaia: graph classification using evolutionary computation. In SIGMOD, pages 879-890, 2010.
13. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
14. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
15. H. Peng, F. Long, and C. H. Q. Ding. Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy. TPAMI, 27(8):1226-1238, 2005.
16. S. Ranu and A. K. Singh. Graphsig: A scalable approach to mining significant subgraphs in large graph databases. In ICDE, pages 844-855, 2009.
17. H. Saigo, N. Krämer, and K. Tsuda. Partial least squares regression for graph mining. In KDD, pages 578-586, 2008.
18. M. Thoma, H. Cheng, A. Gretton, J. Han, H. Kriegel, A. Smola, L. Song, P. Yu, X. Yan, and K. Borgwardt. Near-optimal supervised feature selection among frequent subgraphs. In SDM, 2009.
19. J. Weston, S. Mukherjee, O. Chapelle, M. Pontil, T. Poggio, and V. Vapnik. Feature selection for svms. NIPS, pages 668-674, 2001.
20. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444, 2008.
21. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
22. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In KDD, pages 286-295, 2003.
23. S. Zhang, J. Yang, and V. Cheedella. Monkey: Approximate graph mining based on spanning trees. In ICDE, pages 1247-1249, 2007.
24. L. Zhu, W. K. Ng, and S. Han. Classifying graphs using theoretical metrics: A study of feasibility. In DASFAA, 2011.