Near-optimal supervised feature selection among frequent subgraphs

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 1069-1080

  Thoma, Marisa ^a   Cheng, Hong ^b   Gretton, Arthur ^c   Han, Iawei ^d   Kriegel, Hans Peter ^a   Smola, Alex ^e   Song, E ^f   Yu, Philip S ^g   Yan, Xifeng ^h   Borgwardt, Karsten ⁱ  

^a UNIVERSITY OF MUNICH   (Germany)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^d UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^e YAHOO RESEARCH   (United States)

^f Carnegie Mellon University   (United States)

^g UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^h University of California   (United States)

ⁱ UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; CLASSIFICATION (OF INFORMATION); DATA MINING; FLOW GRAPHS;

ANOMALY DETECTION; DISCRIMINATIVE FEATURES; DISCRIMINATIVE POWER; FREQUENT SUBGRAPH MINING; FREQUENT SUBGRAPHS; FUNCTION PREDICTION; GRAPH CLASSIFICATION; NEAR-OPTIMAL SOLUTIONS;

FEATURE EXTRACTION;

EID: 72749083407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), pages 487-499, 1994.
2. C. Borgelt and M. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), pages 211-218, 2002.
3. C. Borgelt, T. Meinl, and M. Berthold. Moss: a program for molecular substructure mining. In OSDM '05: Proceedings of the 1st international workshop on open source data mining, pages 6-15, New York, NY, USA, 2005. ACM.
4. E. Boros, T. Horiyama, T. Ibaraki, K. Makino, and M. Yagiura. Finding essential attributes from binary data. Ann. Math. Artif. Intell., 39(3):223-257, 2003.
5. B. Bringmann and A. Zimmermann. One in a million: picking the right patterns. Knowledge and Information Systems, 2008.
6. C. Chang and C. Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/~cjlin/ libsvm.
7. H. Cheng, X. Yan, J. Han, and C. Hsu. Discriminative frequent pattern analysis for effective classification. In Proc. of ICDE, Istanbul, Turkey, 2007.
8. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 17(8):1036-1050, 2005.
9. P. D. Dobson and A. J. Doig. Distinguishing enzyme structures from non-enzymes without alignments. J Mol Biol, 330(4):771-783, Jul 2003.
10. L. Ein-Dor, O. Zuk, and E. Domany. Thousands of samples are needed to generate a robust gene list for predicting outcome in cancer. Proc. Natl. Acad. Sci. USA, 103(15):5923-5928, Apr 2006.
11. 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 Y. Li, B. Liu, and S. Sarawagi, editors, KDD, pages 230-238. ACM, 2008.
12. H. Fröhlich, J. Wegner, F. Sieker, and A. Zell. Optimal assignment kernels for attributed molecular graphs. In Proc. Intl. Conf. Machine Learning, pages 225-232, Bonn, Germany, 2005.
13. C. Guestrin, A. Krause, and A. Singh. Near-optimal sensor placements in gaussian processes. In Proc. Intl. Conf. Machine Learning, Bonn, Germany, 2005.
14. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In Proc. 2003 Int. Conf. Data Mining (ICDM'03), pages 549-552, 2003.
15. A. Inokuchi, T. Washio, and H. Motoda. An aprioribased algorithm for mining frequent substructures from graph data. In Proc. 2000 European Symp. Principle of Data Mining and Knowledge Discovery (PKDD'00), pages 13-23, 2000.
16. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proc. of ICML, pages 321-328, Washington, DC, 2003.
17. S. Kramer, L. Raedt, and C. Helma. Molecular feature mining in HIV data. In Proc. of KDD, pages 136-143, San Francisco, CA, 2001.
18. A. Krause and C. Guestrin. Near-optimal nonmyopic value of information in graphical models. In Uncertainty in Artificial Intelligence UAI'05, 2005.
19. H. Kubinyi. Drug research: myths, hype and reality. Nature Reviews: Drug Discovery, 2:665-668, 2003.
20. T. Kudo, E. Maeda, and Y. Matsumoto. An application of boosting to graph classification. In Advances in Neural Information Processing Systems 17 (NIPS'04), pages 729-736, Vancouver, BC, Dec. 2004.
21. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. 2001 Int. Conf. Data Mining (ICDM'01), pages 313-320, 2001.
22. P. Mahë, N. Ueda, T. Akutsu, J. Perret, and J. Vert. Extensions of marginalized graph kernels. In Proc. of ICML, pages 552-559, Alberta, Canada, 2004.
23. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
24. S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In Proc. 2004 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'04), pages 647-652, 2004.
25. N. Przulj. Biological network comparison using graphlet degree distribution. In 2006 European Conference on Computational Biology (ECCB), September 2006.
26. P. Radivojac, Z. Obradovic, A. K. Dunker, and S. Vucetic. Feature selection filters based on the permutation test. In Pedreschi (Eds.), Machine Learning: ECML 2004, 15th European Conference on Machine Learning, pages 334-346. Springer, 2004.
27. N. Shervashidze, S. Vishwanathan, T. Petri, K. Mehlhorn, and K. Borgwardt. Efficient graphlet kernels for large graph comparison. In AISTATS, 2009.
28. K. Tsuda. Entire regularization paths for graph data. In Proc. Intl. Conf. Machine Learning, pages 919-926, 2007.
29. L. J. van 't Veer, H. Dai, M. J. van de Vijver, Y. D. He, A. A. M. Hart, et al. Gene expression profiling predicts clinical outcome of breast cancer. Nature, 415:530-536, 2002.
30. N. Vanetik, E. Gudes, and S. E. Shimony. Computing frequent graph patterns from semistructured data. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), pages 458-465, 2002.
31. N. Wale and G. Karypis. Comparison of descriptor spaces for chemical compound retrieval and classifies tion. In Proc. of ICDM, pages 678-689, Hong Kong, 2006.
32. S. Wernicke. A faster algorithm for detecting network motifs. In WABI, pages 165-177, 2005.
33. X. Yan, H. Cheng, J. Han, and P. S. Yu. Mining significant graph patterns by leap search. In SIGMOD Conference, pages 433-444, 2008.
34. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), pages 721-724, 2002.
35. X. Yan and J. Han. CloseGraph: mining closed frequent graph patterns. In KDD, pages 286-295, 2003.
36. Y. Yang and J. O. Pedersen. A comparative study on feature selection in text categorization. In Proc. Intl. Conf. Machine Learning, pages 412-420, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc.
37. A. Zimmermann and B. Bringmann. CTC - correlating tree patterns for classification. In Proc. 2005 Int. Conf. Data Mining (ICDM05), pages 833-836, 2005.