Semi-supervised feature selection for graph classification

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 793-801

  Kong, Xiangnan ^a   Yu, Philip S ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

Data mining; Feature selection; Graph classification; Semi supervised learning

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CURRENT RESEARCHES; EMPIRICAL STUDIES; FEATURE EVALUATION; FEATURE MINING; FEATURE SELECTION; FEATURE SELECTION METHODS; FEATURE SETS; GRAPH CLASSIFICATION; GRAPH DATA; NOVEL SOLUTIONS; REAL-WORLD TASK; SEARCH SPACES; SEMI-SUPERVISED; SEMI-SUPERVISED LEARNING; SUBGRAPHS;

ALGORITHMS; DATA MINING; GRAPHIC METHODS; MINING; OPTIMIZATION; SUPERVISED LEARNING; VECTOR SPACES;

FEATURE EXTRACTION;

EID: 77956201235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835905     Document Type: Conference Paper

References (16)

1. A. Bar-Hillel, T. Hertz, N. Shental, and D. Weinshall. Learning a mahalanobis metric from equivalence constraints. Journal of Machine Learning Research, 6:937-965, 2005.
2. C. Borgelt and M. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In Proceedings of the 2nd International Conference on Data Mining, pages 211-218, Maebashi City, Japan, 2002.
3. C. Helma, R. King, S. Kramer, and A. Srinivasan. The predictive toxicology challenge 2000-2001. Bioinformatics, 17(1):107-108, 2001.
4. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In Proceedings of the 3rd International Conference on Data Mining, pages 549-552, Melbourne, FL, 2003.
5. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pages 13-23, Lyon, France, 2000.
6. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proceedings of the 20th International Conference on Machine Learning, pages 321-328, Washington, DC, 2003.
7. T. Kudo, E. Maeda, and Y. Matsumoto. An application of boosting to graph classification. In L. K. Saul, Y. Weiss, and L. Bottou, editors, Advances in Neural Information Processing Systems 17, pages 729-736. Cambridge, MA: MIT Press, 2005.
8. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proceedings of the 1st International Conference on Data Mining, pages 313-320, San Jose, CA, 2001.
9. K. V. Mardia, J. T. Kent, and J. M. Bibby. Multivariate Analysis. Academic Press, San Diego, CA, 1980.
10. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 647-652, Seattle, WA, 2004.
11. J. Ren, Z. Qiu, W. Fan, H. Cheng, and P. S. Yu. Forword semi-supervised feature selection. In Proceedings of the 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pages 970-976, Osaka, Japan, 2008.
12. W. Tang and S. Zhong. Pairwise constraints-guided dimensionality reduction. In SIAM International Conference on Data Mining Workshop on Feature Selection for Data Mining, Bethesda, MD, 2006.
13. 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 Proceedings of the SIAM International Conference on Data Mining, pages 1075-1086, Sparks, Nevada, 2009.
14. X. Yan, H. Cheng, J. Han, and P. Yu. Mining significant graph patterns by leap search. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 433-444, Vancouver, BC, 2008.
15. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proceedings of the 2nd International Conference on Data Mining, pages 721-724, Maebashi City, Japan, 2002.
16. Z. Zhao and H. Liu. Semi-supervised feature selection via spectral analysis. In Proceedings of the SIAM International Conference on Data Mining, pages 641-646, Minneapolis, MN, 2007.