Structure feature selection for graph classification

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 991-999

  Fei, Hongliang ^a   Huan, Jun ^a  

^a University of Kansas   (United States)

Author keywords

Classification; Data Mining; Feature selection

Indexed keywords

APPLICATION FIELDS; CHEMINFORMATICS; CLASSIFICATION; CLASSIFICATION MODELS; CLASSIFICATION OF GRAPHS; EXISTING METHOD; FEATURE SELECTION; FEATURE SELECTION METHODS; FREQUENT SUBGRAPHS; GRAPH CLASSIFICATION; GRAPH DATA; GRAPH FEATURES; MACHINE LEARNING COMMUNITIES; SPATIAL DISTRIBUTION; SPATIAL LOCATION; STATE-OF-THE-ART METHODS; STRUCTURE FEATURES; SUBGRAPHS;

KNOWLEDGE MANAGEMENT; SIZE DISTRIBUTION;

CLASSIFICATION (OF INFORMATION);

EID: 70349251904     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458212     Document Type: Conference Paper

References (30)

1. B. Cao, D. Shen, J.-T. Sun, Q. Yang, and Z. Chen. Feature selection in a kernel space. In ICML '07: Proceedings of the 24th international conference on Machine learning, pages 121-128, New York, NY, USA, 2007. ACM.
2. C. Chang and C. Lin. Libsvm: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/cjlin/libsvm.
3. H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In Proceedings of the 23rd IEEE International Conference on Data Engineering (ICDE), 2007.
4. N. Cristianini, J. Shawe-Taylor, and A. Elisseeff. On kernel-target alignment, 2001.
5. M. Deshpande, M. Kuramochi, and G. Karypis. Frequent sub-structure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 2005.
6. T. Gäartner, P. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In Sixteenth Annual Conference on Computational Learning Theory and Seventh Kernel Workshop, 2003.
7. I. Guyon, J. Weston, S. Barnhill, and V. Vapnik. Gene selection for cancer classification using support vector machines. Machine Learning, 46:389-422, 2002 January.
8. D. Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL099-10, Computer Science Department, UC Santa Cruz, 1999.
9. J. Huan, D. Bandyopadhyay, J. Snoeyink, J. Prins, A. Tropsha, and W. Wang. Distance-based identification of spatial motifs in proteins using constrained frequent subgraph mining. in Proceedings of the IEEE Computational Systems Bioinformatics, 2006.
10. J. Huan, W. Wang, D. Bandyopadhyay, J. Snoeyink, J. Prins, and A. Tropsha. Mining protein family specific residue packing patterns >from protein structure graphs. In Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB), pages 308-315, 2004.
11. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM), pages 549-552, 2003.
12. J. Huan, W. Wang, A. Washington, J. Prins, R. Shah, and A. Tropsha. Accurate classification of protein structural families based on coherent subgraph analysis. In Proceedings of the Pacific Symposium on Biocomputing (PSB), pages 411{422, 2004.
13. I. Jolliffe. Principal Component Analysis. Springer; 2nd ed. edition, 1986.
14. R. Jorissen and M. Gilson. Virtual screening of molecular databases using a support vector machine. J. Chem. Inf. Model., 45(3):549-561, 2005.
15. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proc. of the Twentieth Int. Conf. on Machine Learning (ICML), 2003.
16. B. K.M. and K. H.-P. Shortest-path kernels on graphs. In in Proc. of International Conference on Data Mining, 2005.
17. R. Kohavi and G. H. John. Wrappers for feature subset selection. Artificial Intelligence, 97(1-2):273-324, 1997.
18. F. Li, Y. Yang, and E. P. Xing. From lasso regression to feature vector. In Advances in Neural Information Processing Systems, 2005.
19. A. M. Martinez and A. C. Kak. PCA versus LDA. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(2):228-233, 2001.
20. J. Ramon and T. Gäartner. Expressivity versus efficiency of graph kernels. In Technical Report, First International Workshop on Mining Graphs, Trees and Sequences, 2003.
21. S. T. Roweis and L. K. Saul. Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 290(5500):2323 - 2326, 2000.
22. B. Schölkopf and A. J. Smola. Learning with Kernels. the MIT Press, 2002.
23. A. Smalter, J. Huan, and G. Lushington. Structure-based pattern mining for chemical compound classification. Proceedings of the 6th Asia Pacific Bioinformatics Conference, 2008.
24. S. W. Tamas Horvath, Thomas Gartner. Cyclic pattern kernels for predictive graph mining. SIGKDD, 2004.
25. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 290(5500):2319 - 2323, 2000.
26. S. Yan, D. Xu, B. Zhang, and H.-J. Zhang. Graph embedding: A general framework for dimensionality reduction. In CVPR '05: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2, pages 830-837, Washington, DC, USA, 2005. IEEE Computer Society.
27. X. Yan and J. Han. Closegraph: Mining closed frequent graph patterns. KDD'03, 2003.
28. Y. Yang and J. O. Pedersen. A comparative study on feature selection in text categorization. In D. H. Fisher, editor, Proceedings of ICML-97, 14th International Conference on Machine Learning, pages 412-420, Nashville, US, 1997. Morgan Kaufmann Publishers, San Francisco, US.
29. H. Yu and J. Yang. A direct LDA algorithm for high-dimensional data Ů with application to face recognition. Pattern Recognition, 34(10):2067-2070, 2001.
30. Z. Zhao and H. Liu. Spectral feature selection for supervised and unsupervised learning. In Proceedings of the 24th International Conference on Machine Learning (ICML), 2007.