Discriminative feature selection for uncertain graph classification

Proceedings of the 2013 SIAM International Conference on Data Mining, SDM 2013

Volumn , Issue , 2013, Pages 82-93

  Kong, Xiangnan ^a   Yu, Philip S ^a,b   Wang, Xue ^c   Ragin, Ann B ^c  

^a University of Illinois at Chicago   (United States)

^b KING ABDULAZIZ UNIVERSITY   (Saudi Arabia)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALUMINUM COMPOUNDS; BRANCH AND BOUND METHOD; DATA MINING; DYNAMIC PROGRAMMING; FEATURE EXTRACTION; GRAPHIC METHODS; NEURODEGENERATIVE DISEASES; NEUROIMAGING; PROBABILITY DISTRIBUTIONS; UNCERTAINTY ANALYSIS; ALGORITHMS;

ALZHEIMERS DISEASE; BRANCH-AND-BOUND ALGORITHMS; DISCRIMINATIVE FEATURES; FEATURE SELECTION METHODS; GRAPH CLASSIFICATION; STATISTICAL MEASURES; STRUCTURAL UNCERTAINTY; STRUCTURE OF GRAPH;

CLASSIFICATION (OF INFORMATION);

EID: 84945954858     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972832.10     Document Type: Conference Paper

References (28)

1. C. Borgelt and M. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM, pages 211-218, 2002.
2. E. Bullmore and O. Sporns. Complex brain networks: graph theoretical analysis of structural and functional systems. Nature Reviews Neuroscience, 10(3):186-198, 2009.
3. 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.
4. H. Cheng, D. Lo, Y. Zhou, X. Wang, and X. Yan. Identifying bug signatures using discrimative graph mining. In ISSTA, pages 141-152, 2009.
5. C. Gao and J. Wang. Direct mining of discriminative patterns for classifying uncertain data. In KDD, pages 861-870, 2010.
6. S. Huang, J. Li, L. Sun, J. Ye, K. Chen, and T. Wu. Learning brain connectivity of azheimer's disease from neuroimaging data. In NIPS, pages 808-816, 2009.
7. S. Huang, J. Li, J. Ye, A. Fleisher, K. Chen, T. Wu, and E. Reiman. Brain effective connectivity modeling for alzheimer's disease by sparse gaussian bayesian network. In KDD, pages 931-939, 2011.
8. S. Huang, J. Li, J. Ye, A. Fleisher, T.Wu, K. Chen, and E. Reiman. Learning brain connectivity of alzheimer's disease by exploratory graphical models. NeuroImage, 50:935-949, 2010.
9. A. Inokuchi, T. Washio, and H. Motoda. An aprioribased algorithm for mining frequent substructures from graph data. In ECML/PKDD, pages 13-23, 2000.
10. N. Jin and W. Wang. LTS: Discriminative subgraph mining by learning from search history. In ICDE, pages 207-218, 2011.
11. N. Jin, C. Young, and W. Wang. GAIA: graph classification using evolutionary computation. In SIGMOD, pages 879-890, 2010.
12. R. Jin, L. Liu, and C. Aggarwal. Discovering highly reliable subgraphs in uncertain graphs. In KDD, pages 992-1000, 2011.
13. X. Kong, W. Fan, and P. S. Yu. Dual active feature and sample selection for graph classification. In KDD, pages 654-662, 2011.
14. X. Kong and P. S. Yu. Semi-supervised feature selection for graph classification. In KDD, pages 793-802, 2010.
15. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
16. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
17. O. Papapetrou, E. Ioannou, and D. Skoutas. Efficient discovery of frequent subgraph patterns in uncertain graph databases. In EDBT, pages 355-366, 2011.
18. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-nearest neighbors in uncertain graphs. In VLDB, pages 997-1008, 2010.
19. L. Sun, R. Cheng, D. Cheung, and J. Cheng. Mining uncertain data with probabilistic guarantees. In KDD, pages 273-282, 2010.
20. 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.
21. X. Wang, P. Foryt, R. Ochs, J. Chung, Y. Wu, T. Parrish, and A. Ragin. Abnormalities in resting-state functional connectivity in early human immunodeficiency virus infection. Brain Connectivity, 1(3):207, 2011.
22. X. Yan, H. Cheng, J. Han, and P. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444, 2008.
23. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
24. Y. Yuan, G. Wang, H. Wang, and L. Chen. Efficient subgraph search over large uncertain graphs. In VLDB, pages 876-886, 2011.
25. J. Zhou, L. Yuan, J. Liu, and J. Ye. A multi-task learning formulation for predicting disease progression. In KDD, pages 814-822, 2011.
26. Z. Zou, H. Gao, and J. Li. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In KDD, pages 633-642, 2010.
27. Z. Zou, J. Li, H. Gao, and S. Zhang. Frequent subgraph pattern mining on uncertain graph data. In CIKM, pages 583-592, 2009.
28. Z. Zou, J. Li, H. Gao, and S. Zhang. Mining frequent subgraph patterns from uncertain graph data. IEEE Transactions on Knowledge and Data Engineering, 22(9):1203-1218, 2010.