Boosting for multi-graph classification

IEEE Transactions on Cybernetics

Volumn 45, Issue 3, 2015, Pages 416-429

  Wu, Jia ^a,b   Pan, Shirui ^b   Zhu, Xingquan ^c   Cai, Zhihua ^a  

^a CHINA UNIVERSITY OF GEOSCIENCES   (China)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^c FLORIDA ATLANTIC UNIVERSITY   (United States)

Author keywords

Boosting; graph classification; multi graph; multi instance learning; subgraph mining

Indexed keywords

ITERATIVE METHODS; WEBSITES;

BOOSTING; GRAPH CLASSIFICATION; MULTI-GRAPH; MULTI-INSTANCE LEARNING; SUBGRAPH MINING;

GRAPHIC METHODS;

EID: 85027920186     PISSN: 21682267     EISSN: 21682275     Source Type: Journal    
DOI: 10.1109/TCYB.2014.2327111     Document Type: Article

References (57)

1. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis, "Frequent substructure-based approaches for classifying chemical compounds," IEEE Trans. Knowl. Data Eng., vol. 17, no. 8, pp. 1036-1050, Aug. 2005.
2. W. Lian, D.-L. Cheung, N. Mamoulis, and S.-M. Yiu, "An efficient and scalable algorithm for clustering XML documents by structure," IEEE Trans. Knowl. Data Eng., vol. 16, no. 1, pp. 82-96, Jan. 2004.
3. C. Chen et al., "Mining graph patterns efficiently via randomized summaries," in Proc. 35th Int. Conf. VLDB, Lyon, France, 2009, pp. 742-753.
4. H. Wang, H. Huang, and C. Ding, "Image categorization using directed graphs," in Proc. 11th ECCV, Crete, Greece, 2010, pp. 762-775.
5. R. Angelova and G. Weikum, "Graph-based text classification: Learn from your neighbors," in Proc. 29th Annu. Int. ACM SIGIR, Seattle, WA, USA, 2006, pp. 485-492.
6. Z. Harchaoui and F. Bach, "Image classification with segmentation graph kernels," in Proc. 20th IEEE Conf. CVPR, Minneapolis, MN, USA, 2007, pp. 1-8.
7. M. Kuramochi and G. Karypis, "Frequent subgraph discovery," in Proc. 1st ICDM, 2001, pp. 313-320.
8. M. Thoma et al., "Near-optimal supervised feature selection among frequent subgraphs," in Proc. 9th SDM, 2009, pp. 1075-1086.
9. S. Pan, X. Zhu, C. Zhang, and P. Yu, "Graph stream classification using labeled and unlabeled graphs," in Proc. 29th IEEE ICDE, Brisbane, QLD, USA, 2013, pp. 398-409.
10. R. Kohavi and G. H. John, "Wrappers for feature subset selection," Artif. Intell., vol. 97, nos. 1-2, pp. 273-324, 1997.
11. T. Dietterich, R. Lathrop, and T. Lozano-Pérez, "Solving the multiple instance problem with axis-parallel rectangles," Artif. Intell., vol. 89, no. 1-2, pp. 31-71, 1997.
12. Z. Fu, A. Robles-Kelly, and J. Zhou, "MILIS: Multiple instance learning with instance selection," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 5, pp. 958-977, May 2011.
13. Z.-H. Zhou, K. Jiang, and M. Li, "Multi-instance learning based web mining," Appl. Intell., vol. 22, no. 2, pp. 135-147, 2005.
14. D. Kelly, J. McDonald, and C. Markham, "Weakly supervised training of a sign language recognition system using multiple instance learning density matrices," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 41, no. 2, pp. 526-541, Apr. 2011.
15. Z. Zhou, M. Zhang, S. Huang, and Y. Li, "Multi-instance multi-label learning," Artif. Intell., vol. 176, no. 1, pp. 2291-2320, 2012.
16. J. Wang, "Solving the multiple-instance problem: A lazy learning approach," in Proc. 17th ICML, San Francisco, CA, USA, 2000, pp. 1119-1125.
17. H. Blockeel and A. Srinivasan, "Multi-instance tree learning," in Proc. 22th ICML, Bonn, Germany, 2005, pp. 57-64.
18. L. Bjerring and E. Frank, "Beyond trees: Adopting MITI to learn rules and ensemble classifiers for multi-instance data," in Proc. 24th Int. Conf. Adv. AI, Berlin, Heidelberg, 2011, pp. 41-50.
19. Y. Chevaleyre and J. Zucker, "A framework for learning rules from multiple instance data," in Proc. 12th ECML, Freiburg, Germany, 2001, pp. 49-60.
20. M. Zhang and Z. Zhou, "Improve multi-instance neural networks through feature selection," Neural Process. Lett., vol. 19, no. 1, pp. 1-10, 2004.
21. X. Qi and Y. Han, "Incorporating multiple SVMs for automatic image annotation," Pattern Recogn., vol. 40, no. 2, pp. 728-741, 2007.
22. S. Ray and M. Craven, "Supervised versus multiple instance learning: An empirical comparison," in Proc. 22nd ICML, New York, NY, USA, 2005, pp. 697-704.
23. H. Yuan, M. Fang, and X. Zhu, "Hierarchical sampling for multi-instance ensemble learning," IEEE Trans. Knowl. Data Eng., vol. 25, no. 12, pp. 2900-2905, Dec. 2013.
24. X. Xu and E. Frank, "Logistic regression and boosting for labeled bags of instances," in Proc. 8th PAKDD, 2004, pp. 272-281.
25. M. Telgarsky, "A primal-dual convergence analysis of boosting," J. Mach. Learn. Res., vol. 13, no. 1, pp. 561-606, 2012.
26. O. Maron and T. Lozano-Pérez, "A framework for multiple-instance learning," in Proc. 12th Annu. Conf. NIPS, Cambridge, MA, USA, 1998, pp. 570-576.
27. Q. Zhang and S. Goldman, "EM-DD: An improved multiple-instance learning technique," in Proc. 15th Annu. Conf. NIPS, 2001, pp. 1073-1080.
28. P. Auer and R. Ortner, "A boosting approach to multiple instance learning," in Proc. 15th ECML, Pisa, Italy, 2004, pp. 63-74.
29. J. Wu, X. Zhu, C. Zhang, and Z. Cai, "Multi-instance multi-graph dual embedding learning," in Proc. 13th ICDM, Dallas, TX, USA, 2013, pp. 827-836.
30. S. V. N. Vishwanathan, K. M. Borgwardt, R. I. Kondor, and N. N. Schraudolph, "Graph kernels," J. Mach. Learn. Res., vol. 11, pp. 1201-1242, Apr. 2008.
31. P. Mahe, N. Ueda, T. Akutsu, J. Pettet, and J. Vert, "Extensions of marginalized graph kernels," in Proc. 21st ICML, New York, NY, USA, 2004, pp. 552-559.
32. K. Riesen and H. Bunke, "Graph classification by means of Lipschitz embedding," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 39, no. 6, pp. 1472-1483, Dec. 2009.
33. K. Riesen and H. Bunke, Graph Classification and Clustering Based on Vector Space Embedding. Singapore: World Scientific, 2010.
34. X. Yan and J. Han, "gSpan: Graph-based substructure pattern mining," in Proc. 2nd ICDM, Washington, DC, USA, 2002, pp. 721-724.
35. A. Inokuchi, T. Washio, and H. Motoda, "An apriori-based algorithm for mining frequent substructures from graph data," in Proc. 4th Eur. Conf. PKDD, Lyon, France, 2000, pp. 13-23.
36. C. Borgelt and M. Berthold, "Mining molecular fragments: Finding relevant substructures of molecules," in Proc. 2nd ICDM, 2002, pp. 51-58.
37. S. Nijssen and J. Kok, "A quickstart in frequent structure mining can make a difference," in Proc. 10th ACM SIGKDD, Seattle, WA, USA, 2004, pp. 647-652.
38. X. Yan, H. Cheng, J. Han, and P. S. Yu, "Mining significant graph patterns by leap search," in Proc. 27th ACM SIGMOD, Vancouver, BC, Canada, 2008, pp. 433-444.
39. H. Saigo, N. Krämer, and K. Tsuda, "Partial least squares regression for graph mining," in Proc. 14th ACM SIGKDD, Las Vegas, NV, USA, 2008, pp. 578-586.
40. N. Jin, C. Young, and W. Wang, "GAIA: Graph classification using evolutionary computation," in Proc. 29th ACM SIGMOD, Indianapolis, IN, USA, 2010, pp. 879-890.
41. T. Kudo, E. Maeda, and Y. Matsumoto, "An application of boosting to graph classification," in Proc. 18th Annu. Conf. NIPS, 2004, pp. 729-736.
42. S. Nowozin, K. Tsuda, T. Uno, T. Kudo, and G. Bakir, "Weighted substructure mining for image analysis," in Proc. 20th IEEE Conf. CVPR, Minneapolis, MN, USA, 2007, pp. 1-8.
43. H. Saigo, S. Nowozin, T. Kadowaki, T. Kudo, and K. Tsuda, "gBoost: A mathematical programming approach to graph classification and regression," Mach. Learn., vol. 75, no. 1, pp. 69-89, 2009.
44. S. Pan and X. Zhu, "Graph classification with imbalanced class distributions and noise," in Proc. 23rd IJCAI, 2013, pp. 1586-1592.
45. H. Fei and J. Huan, "Boosting with structure information in the functional space: An application to graph classification," in Proc. 16th ACM SIGKDD, Washington, DC, USA, 2010, pp. 643-652.
46. B. Zhang et al., "Multi-class graph boosting with subgraph sharing for object recognition," in Proc. 20th ICPR, Istanbul, Turkey, 2010, pp. 1541-1544.
47. M. Grbovic, C. Dance, and S. Vucetic, "Sparse principal component analysis with constraints," in Proc. 26th Conf. AAAI, 2012, pp. 935-941.
48. W. Dai, Q. Yang, G. Xue, and Y. Yu, "Boosting for transfer learning," in Proc. 24th ICML, Corvallis, OR, USA, 2007, pp. 193-200.
49. J. Tang et al., "ArnetMiner: Extraction and mining of academic social networks," in Proc. 14th ACM SIGKDD, Las Vegas, NV, USA, 2008, pp. 990-998.
50. K. Perusich and M. McNeese, "Using fuzzy cognitive maps for knowledge management in a conflict environment," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 36, no. 6, pp. 810-821, Nov. 2006.
51. X. L. Q. Hu, W. Xu, and Z. Yu, "Discovery of textual knowledge flow based on the management of knowledge maps," Concurr. Comput. Pract. Exp., vol. 20, no. 15, pp. 1791-1806, 2008.
52. X. Luo, Z. Xu, J. Yu, and X. Chen, "Building association link network for semantic link on web resources," IEEE Trans. Autom. Sci. Eng., vol. 8, no. 3, pp. 482-494, Jul. 2011.
53. J. Wu et al., "Multi-graph learning with positive and unlabeled bags," in Proc. 14th SIAM Int. Conf. Data Mining, 2014, pp. 217-225.
54. J. Wu, X. Zhu, C. Zhang, and P. Yu, "Bag constrained structure pattern mining for multi-graph classification," IEEE Trans. Knowl. Data Eng., to be published.
55. T. Gartner, P. A. Flach, A. Kowalczyk, and A. J. Smola, "Multi-instance kernels," in Proc. 19th ICML, 2002, pp. 179-186.
56. I. H. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques, 2nd ed. Amsterdam, The Netherlands: Morgan Kaufmann, 2005.
57. A. Demiriz, K. P. Bennett, and J. Shawe-Taylor, "Linear programming boosting via column generation," Mach. Learn., vol. 46, no. 1-3, pp. 225-254, 2002.