Fast computation of subpath kernel for trees

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 1, Issue , 2012, Pages 393-400

  Kimura, Daisuke ^a   Kashima, Hisashi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION ALGORITHM; FAST COMPUTATION; HIERARCHICAL INFORMATION; KERNEL FUNCTION; KERNEL METHODS; PREDICTION ALGORITHMS; RUNNING TIME; STRUCTURED DATA; UNORDERED TREES;

ALGORITHMS; COMPUTATIONAL EFFICIENCY; FORESTRY; LEARNING SYSTEMS;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTATION; EFFICIENCY; FORESTRY; MATHEMATICS; TREES;

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

References (29)

1. Abouelhoda, M. I., Kurtz, S., and Ohlebusch, E. Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms, 2(1), 2004.
2. Aiolli, F., Martino, G. Da San, and Sperduti, A. Route kernels for trees. In ICML, 2009.
3. Bender, M. A. and Farach-Colton, M. The level ancestor problem simplified. Theo. Compute. Sci., 321, 2004.
4. Bentley, J. L. and Sedgewick, R. Fast algorithms for sorting and searching strings. In SODA, 1997.
5. Chang, C.-C. and Lin, C.-J. LIBSVM: a library for support vector machines, 2001.
6. Collins, M. and Duffy, N. Convolution kernels for natural language. In NIPS, 2001.
7. Daumé III, H. and Marcu, D. A tree-position kernel for document compression. In DUC, 2004.
8. Doubet, S. and Albersheim, P. Carbbank. Glycobiology, 2 (6), 1992.
9. Ferragina, P., Luccio, F., Manzini, G., and Muthukrishnan, S. Structuring labeled trees for optimal succinctness, and beyond. In FOCS, 2005.
10. Gärtner, T., Flach, P., and Wrobel, S. On graph kernels: Hardness results and efficient alternatives. In COLT, 2003.
11. Hashimoto, K., Hamajima, M., Goto, S., Masumoto, S., Kawashima, M., and Kanehisa, M. Glycan: The database of carbohydrate structures. In GIW, 14, 2003.
12. Haussler, D. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of Calfornia in Santa Cruz, 1999.
13. Kärkkäinen, J. and Sanders, P. Simple linear work suffix array construction. In ICALP, 2003.
14. Kasai, T., Lee, G., Arimura, H., Arikawa, S., and Park, K. Linear-time longest-common-prefix computation in suffix arrays and its applications. In CPM, 2001.
15. Kashima, H. Machine Learning Approaches for Structured-data. PhD thesis, Kyoto University, 2007.
16. Kashima, H. and Koyanagi, T. Kernels for semi-structured data. In ICML, 2002.
17. Kashima, H., Tsuda, K., and Inokuchi, A. Marginalized kernels between labeled graphs. In ICML, 2003.
18. Kimura, D., Kuboyama, T., Shibuya, T., and Kashima, H. A subpath kernel for rooted unordered trees. In PAKDD, 2011.
19. Kuboyama, T., Hirata, K., Aoki-Kinoshita, K. F., Kashima, H., and Yasuda, H. A gram distribution kernel applied to glycan classification and motif extraction. In GIW, 2006.
20. Leslie, C., Eskin, E., and Noble, W. S. The spectrum kernel: a string kernel for SVM protein classification. In PSB, 2002.
21. Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., and Watkins, C. Text classification using string kernels. J. Mach. Learn. Res., 2, 2002.
22. Moschitti, A. Efficient convolution kernels for dependency and constituent syntactic trees. In ECML, 2006.
23. Schölkopf, B. and Smola, A. J. Learning with Kernels. MIT Press, 2002.
24. Severyn, A. and Moschitti, A. Fast support vector machines for structural kernels. In ECML PKDD, 2011.
25. Shibuya, T. Constructing the suffix tree of a tree with a large alphabet. IEICE Trans, 86(5), 2003.
26. Sun, J., Zhang, M., and Tan, C. L. Tree sequence kernel for natural language. In AAAI, 2011.
27. Teo, C. H. and Vishwanathan, S. V. N. Fast and space efficient string kernels using suffix arrays. In ICML, 2006.
28. Vishwanathan, S. V. N. and Smola, A. Fast kernels for string and tree matching. In NIPS, 2003.
29. Zaki, M. J. and Aggarwal, C. C. Xrules: An effective structural classifier for xml data. Mach. Learn., 62(1-2), 2006.