Dual active feature and sample selection for graph classification

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

Volumn , Issue , 2011, Pages 654-662

  Kong, Xiangnan ^a   Fan, Wei ^b   Yu, Philip S ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Algorithm; Experimentation; Performance

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA MINING; FEATURE SELECTION;

ACTIVE LEARNING; EXPERIMENTATION; GRAPH CLASSIFICATION; GRAPH DATA; LABELINGS; PERFORMANCE; QUERY GRAPH; SAMPLES SELECTION; SELECTION PROBLEMS; SUBGRAPHS;

OPTIMIZATION;

EID: 80052686799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020511     Document Type: Conference Paper

References (30)

1. M. F. Balcan, A. Z. Broder, and T. Zhang. Margin based active learning. In COLT, pages 35-50, 2007.
2. C. Borgelt and M. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM, pages 211-218, 2002.
3. K. M. Borgwardt. Graph Kernels. PhD thesis, Ludwig-Maximilians-University Munich, 2007.
4. 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.
5. H. Cheng, D. Lo, Y. Zhou, X. Wang, and X. Yan. Identifying bug signatures using discrimative graph mining. In ISSTA, pages 141-152, 2009.
6. I. Dagan and S. P. Engenlson. Committee-based sampling for training probabilistic classifiers. In ICML, pages 150-157, 1995.
7. S. Dasgupta and D. Hsu. Hierarchical sampling for active learning. In ICML, pages 208-215, 2008.
8. P. Donmez, J. G. Carbonell, and P. N. Bennett. Dual strategy active learning. In ECML, pages 116-127, 2007.
9. W. Fan, K. Zhang, H. Cheng, J. Gao, X. Yan, J. Han, P. S. Yu, and O. Verscheure. Direct mining of discriminative and essential frequent patterns via model-based search tree. In KDD, pages 230-238, 2008.
10. Y. Freund, E. S. H. S. Seung, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168, 1997. (Pubitemid 127506338)
11. T. Gärtner, P. A. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In COLT/Kernel, 2003.
12. A. Gretton, O. Bousquet, A. Smola, and B. Schölkopf. Measuring statistical dependence with Hilbert-Schmidt norms. In ALT, pages 63-77, Singapore, 2005.
13. T. Horvath, T. Gärtner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. In KDD, 2004.
14. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In ICDM, pages 549-552, 2003.
15. S.-J. Huang, R. Jin, and Z.-H. Zhou. Active learning by querying informative and representative examples. In NIPS. 2011.
16. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, pages 13-23, 2000.
17. N. Jin, C. Young, and W. Wang. GAIA: graph classification using evolutionary computation. In SIGMOD, pages 879-890, 2010.
18. X. Kong and P. S. Yu. Semi-supervised feature selection for graph classification. In KDD, pages 793-802, 2010.
19. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
20. H. T. Nguyen and A. W. M. Smeulders. Active learning using pre-cluster. In ICML, pages 623-630, 2004.
21. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004. (Pubitemid 40114985)
22. M. Opper, H. S. Seung, and H. Sompolinsky. Query by committee. In COLT, pages 287-294, 1992. (Pubitemid 23615454)
23. B. Settles. Active learning literature survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison, 2009.
24. 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, pages 1075-1086, 2009.
25. S. Tong and D. Koller. Support vector machine active learning with applications to text classification. In ICML, pages 999-1006, 2000.
26. X. Yan, H. Cheng, J. Han, and P. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444, 2008.
27. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
28. X. Yan, P. S. Yu, and J. Han. Graph indexing based on discriminative frequent struture analysis. ACM Transactions on Database Systems, 30(4):960-993, 2005.
29. B. Yang, J. Sun, T. Wang, and Z. Chen. Effective multi-label active learning for text classification. In KDD, pages 917-926, 2009.
30. K. Yu, J. Bi, and V. Tresp. Active learning via transductive experimental design. In ICML, pages 1081-1088, 2006.