Boosting with structure information in the functional space: An application to graph classification

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

Volumn , Issue , 2010, Pages 643-651

  Fei, Hongliang ^a   Huan, Jun ^a  

^a University of Kansas   (United States)

Author keywords

Boosting; Feature selection; Graph classification; L1 regularization; Semi structured data

Indexed keywords

BOOSTING; FEATURE SELECTION; GRAPH CLASSIFICATION; L1 REGULARIZATION; SEMI STRUCTURED DATA;

ALGORITHMS; FEATURE EXTRACTION; LEARNING SYSTEMS;

DATA MINING;

EID: 77956212133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835886     Document Type: Conference Paper

References (45)

1. C. Chang and C. Lin. Libsvm: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/cjlin/libsvm.
2. F. Chung. Spectral graph theory. CBMS Reginal Conferences Series, 92, 1997.
3. W. Dai, Q. Yang, G. rong Xue, and Y. Yu. Boosting for transfer learning. In International Conference on Machine Learning, 2007.
4. J. Duchi and Y. Singer. Boosting with structural sparsity. In ICML '09: Proceedings of the 26th Annual International Conference on Machine Learning, pages 297-304, 2009.
5. H. Fei and J. Huan. Structure feature selection for graph classification. In Proc. ACM 17th Conference on Information and Knowledge Management, 2008.
6. H. Fei and J. Huan. L2 norm regularized feature kernel regression for graph data. In CIKM '09: Proceeding of the 18th ACM conference on Information and knowledge management, pages 593-600, 2009.
7. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121:256-285, 1995.
8. Y. Freund and R. Shapire. A decision-theoretic generalization of on-line learning and an application to boosting. In Proceedings of the Second European Conference on Computational Learning Theory, 1995.
9. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: a statistical view of boosting. Annals of Statistics, 28(2):337-407, 2000.
10. J. Friedman, T. Hastie, and R. Tibshirani. Regularization paths for generalized linear models via coordinate descent. The Annals of Applied Statistics, page to be appeared, 2009.
11. 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.
12. G. Haffari, Y. Wang, S. Wang, G. Mori, and F. Jiao. Boosting with incomplete information. In International Conference on Machine Learning, 2008.
13. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer-Verlag, 2009.
14. 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.
15. L. Jacob, G. Obozinski, and J.-P. Vert. Group lasso with overlap and graph lasso. In ICML '09: Proceedings of the 26th Annual International Conference on Machine Learning, pages 433-440, 2009.
16. N. Jin, C. Young, and W. Wang. Graph classification based on pattern co-occurrence. In CIKM '09: Proceeding of the 18th ACM conference on Information and knowledge management, pages 573-582, 2009.
17. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In Proc. of the Twentieth Int. Conf. on Machine Learning (ICML), 2003.
18. S. Kim and E. P. Xing. Structured feature selection in highdimensional space via block regularized regression. In In Proceedings of the 24th International Conference on Conference on Uncertainty in Artificial Intelligence, 2008.
19. R. I. Kondor, N. Shervashidze, and K. M. Borgwardt. The graphlet spectrum. In ICML09, volume 382, page 67. ACM, 2009.
20. T. Kudo, E. Maeda, and Y. Matsumoto. An application of boosting to graph classification. In NIPS, 2004.
21. C. Leslie, E. Eskin, and W. Noble. The spectrum kernel: a string kernel for svm protein classification. In Pac Symp Biocomput, pages 564-75, 2002.
22. C. Li and H. Li. Newwork-constrained regularization and variable selection for analysis of genomic data. Bioinformatics, 24(9):1175-1182, 2008.
23. P. Li. Adaptive base class boost for multi-class classification. In International Conference on Machine Learning, 2008.
24. N. Loeff, D. Forsyth, and D. Ramachandran. Manifoldboost: Stagewise function approximation for fully-, semiand un-supervised learning. In International Conference on Machine Learning, 2008.
25. P. M. Long and R. A. Servedio. Random classification noise defeats all convex potential boosters. In International Conference on Machine Learning, pages 608-615, 2008.
26. A. C. Lozano and N. Abe. Multi-class cost-sensitive boosting with p-norm loss functions. In ACM SIGKDD International Conference on Knowledge Discovery and Data mining, 2008.
27. A. Murzin, S. Brenner, T. Hubbard, and C. Chothia. SCOP: a structural classification of proteins database for the investigation of sequences and structures. Journal of Molecular Biology, 247:536-40, 1995.
28. S. Nowozin, K. Tsuda, T. Uno, T. Kudo, and G. Bakir. Weighted substructure mining for image analysis. In Computer Vision and Pattern Recognition 2007. CVPR '07, pages 1-8, 2007.
29. G. Pandey, S. Chawla, S. Poon, B. Arunasalam, and J. G. Davis. Association rules network: Definition and applications. Stat. Anal. Data Min., 1(4):260-279, 2009.
30. H. Saigo and et. al. gboost: Graph learning toolbox for matlab, 2007. http://www.kyb.tuebingen.mpg.de/bs/people/nowozin/gboost/.
31. H. Saigo, N. Krämer, and K. Tsuda. Partial least squares regression for graph mining. In Proc. SIGKDD08, 2008.
32. H. Saigo, S. Nowozin, T. Kadowaki, T. Kudo, and K. Tsuda. gboost: a mathematical programming approach to graph classification and regression. Journal of Machine Learning, 75(1):69-89, 2009.
33. T. Sandler, P. P. Talukdar, and L. H. Ungar. Regularized learning with networks of features. In NIPS08, 2008.
34. R. Schapire. The strength of weak learnability. Machine Learning, 5:197-227, 1990.
35. R. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37:297-336, 1999.
36. M. Thoma, H. Cheng, A. Gretton, J. Han, H.-P. Kriegel, A. J. Smola, L. Song, P. S. Yu, X. Yan, and K. M. Borgwardt. Near-optimal supervised feature selection among frequent subgraphs. In Proccedings of the 2009 SIAM Conference on Data Mining (SDM 2009), pages 1076-1087. Philadelphia, PA, USA, 2009.
37. R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight. Sparsity and smoothness via the fused lasso. J. R. Statist. Soc., 67(1)):91-108, 2005.
38. K. Tsuda. Entire regularization paths for graph data. In ICML07, 2007.
39. R. Yan, J. Tesic, and J. R. Smith. Model-shared subspace boosting for multi-label classification. In ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pages 834-843, 2007.
40. X. Yan, H. Cheng, J. Han, and P. Yu. Mining significant graph patterns by leap search. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 433-444. ACM, 2008.
41. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B, 68:49-67, 2006.
42. P. Zhao and B. Yu. Grouped and hierarchical model selection through composite absolute penalties. Annals of Statistics, 2006.
43. L. Zheng, S. Wang, C. hoon Lee, and Y. Liu. Information theoretic regularization for semi-supervised boosting. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2009.
44. H. Zou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society B, 67:301-320, 2005.
45. H. Zou and M. Yuan. F∞ norm support vector machine. Statistica Sinica, 18:379-398, 2008.