Empirical comparison of graph classification algorithms

2009 IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009 - Proceedings

Volumn , Issue , 2009, Pages 259-266

  Ketkar, Nikhil S ^a   Holder, Lawrence B ^a   Cook, Diane J ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ADABOOST; ARTIFICIAL DATA; AVERAGE DEGREE; BENCHMARK DATA; CONNECTED GRAPH; DATA SETS; DISCONNECTED GRAPH; EMPIRICAL COMPARISON; FREQUENT SUBGRAPH MINING; GRAPH CLASSIFICATION; GRAPH DATABASE; GRAPH KERNELS; HYPOTHESIS SPACE; REAL WORLD DATA;

ADAPTIVE BOOSTING; ARTIFICIAL INTELLIGENCE; GRAPH THEORY; MINING; SET THEORY; SUPPORT VECTOR MACHINES;

DATA MINING;

EID: 67650434711     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIDM.2009.4938658     Document Type: Conference Paper

References (23)

1. J. Gonzalez, L. Holder, and D. Cook, Graph-based relational concept learning, Proceedings of the Nineteenth International Conference on Machine Learning, 2002.
2. M. Deshpande, M. Kuramochi, and G. Karypis, Frequent Sub-Structure- Based Approaches for Classifying Chemical Compounds, IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 8, pp. 1036- 1050, 2005. (Pubitemid 41259847)
3. P. Nguyen, K. Ohara, A. Mogi, H. Motoda, and T. Washio, Constructing Decision Trees for Graph-Structured Data by Chunkingless Graph-Based Induction, Proc. of PAKDD, pp. 390-399, 2006. (Pubitemid 44019438)
4. T. Kudo, E. Maeda, and Y. Matsumoto, An application of boosting to graph classification, Advances in Neural Information Processing Systems, vol. 17, pp. 729-736, 2005.
5. T. Gärtner, P. Flach, and S. Wrobel, On graph kernels: Hardness results and efficient alternatives, Sixteenth Annual Conference on Computational Learning Theory and Seventh Kernel Workshop, COLT. Springer, 2003.
6. H. Kashima, K. Tsuda, and A. Inokuchi, Marginalized kernels between labeled graphs, Proceedings of the Twentieth International Conference on Machine Learning, pp. 321-328, 2003.
7. J. Rissanen, Stochastic Complexity in Statistical Inquiry Theory. World Scientific Publishing Co., Inc., River Edge, NJ, 1989.
8. A. Inokuchi, T. Washio, and H. Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, Principles of Data Mining and Knowledge Discovery: 4th European Conference, PKDD 2000, Lyon, France, September 13-16, 2000: Proceedings, 2000.
9. M. Kuramochi and G. Karypis, Frequent subgraph discovery, Proceedings of the 2001 IEEE International Conference on Data Mining, pp. 313-320, 1929.
10. X. Yan and J. Han, gSpan: Graph-based substructure pattern mining, Proc. 2002 Int. Conf. on Data Mining (ICDM02), pp. 721-724, 2002.
11. S. Nijssen and J. Kok, A quickstart in frequent structure mining can make a difference, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 647-652, 2004. (Pubitemid 40114985)
12. D. Cook and L. Holder, Substructure Discovery Using Minimum Description Length and Background Knowledge, Journal of Artificial Intelligence Research, vol. 1, pp. 231-255, 1994.
13. H. Motoda and K. Yoshida, Machine learning techniques to make computers easier to use, Artificial Intelligence, vol. 103, no. 1-2, pp. 295-321, 1998. (Pubitemid 128399882)
14. Y. Freund and R. Schapire, Experiments with a new boosting algorithm, Machine Learning: Proceedings of the Thirteenth International Conference, vol. 148, p. 156, 1996.
15. T. Matsuda, H. Motoda, T. Yoshida, and T. Washio, Mining Patterns from Structured Data by Beam-Wise Graph-Based Induction, Discovery Science: 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002: Proceedings, 2002.
16. J. Quinlan, C4. 5: Programs for Machine Learning. Morgan Kaufmann, 1993.
17. A. Srinivasan, S. Muggleton, M. Sternberg, and R. King, Theories for mutagenicity: a study in first-order and feature-based induction, Artificial Intelligence, vol. 85, no. 1-2, pp. 277-299, 1996. (Pubitemid 126363732)
18. C. Helma, R. King, S. Kramer, and A. Srinivasan, The Predictive Toxicology Challenge 2000-2001, pp. 107-108, 2001.
19. N. Ketkar, L. Holder, and D. Cook, Subdue: compression-based frequent pattern discovery in graph data, Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, pp. 71-76, 2005.
20. T. Joachims, SVMLight: Support Vector Machine, SVM-Light Support Vector Machine http://svmlight. joachims. org/, University of Dortmund, November, 1999.
21. I. Witten, E. Frank, L. Trigg, M. Hall, G. Holmes, and S. Cunningham, Weka: Practical Machine Learning Tools and Techniques with Java Implementations, ICONIP/ANZIIS/ANNES, pp. 192-196, 1999.
22. F. Provost, T. Fawcett, and R. Kohavi, The case against accuracy estimation for comparing induction algorithms, Proceedings of the Fifteenth International Conference on Machine Learning, pp. 445-453, 1998.
23. T. Fawcett, Using rule sets to maximize roc performance, IEEE Conference on Data Mining, p. 131, 2001.