A generalization of Haussler's convolution kernel - Mapping kernel

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 944-951

  Shin, Kilho ^a   Kuboyama, Tetsuji ^b  

^a Carnegie Mellon CyLab Japan   (Japan)

^b GAKUSHUIN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTION; FUNCTIONS; LEARNING SYSTEMS; ROBOT LEARNING; SET THEORY; TURBULENT FLOW;

APPLICATIONS.; CONVOLUTION KERNELS; CROSS PRODUCTS; DATA OBJECTS; EDIT DISTANCES; FINITE SETS; INPUT DATUMS; NATURAL GENERALIZATIONS; NECESSARY AND SUFFICIENT CONDITIONS; POSITIVE SEMIDEFINITENESS; RETURN VALUES; SIMILARITY MEASUREMENTS; DATA TYPES; INPUT DATUM; SUFFICIENT CONDITIONS;

CONFORMAL MAPPING; CONVOLUTION;

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

References (23)

1. Aoki, K. F., Yamaguchi, A., Okuno, Y., Akutsu, T., Ueda, N., Kanehisa, M., & Mamitsuka, H. (2003). Efficient tree-matching methods for accurate carbohydrate database query. Genome Informatics, 14, 134-143.
2. Barnard, D., Clarke, G., & Duncan, N. (1995). Tree-to-tree correction for document trees (Technical Report 95-375). Queen's University, Kingston, Ontario K7L 3N6 Canada.
3. Berry, V., & Nicolas, F. (2004). Maximum Agreement and Compatible Supertrees (Extended Abstract). CPM (pp. 205-219).
4. Bunke, H. (1997). On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18, 689-694.
5. Collins, M., & Duffy, N. (2001). Convolution kernels for natural language. Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Nutural and Synthetic, NIPS 2001] (pp. 625-632). MIT Press.
6. Cristianini, N., & Shawe-Taylor, J. (2000). An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press.
7. Haussler, D. (1999). Convolution kernels on discrete structuresUCSC-CRL 99-10). Dept. of Computer Science, University of California at Santa Cruz.
8. Hein, J., Jiang, T., Wang, L., & Zhang, K. (1996). On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71, 153-169.
9. Jansson, J., Ng, J. H. K., Sadakane, K., & Sung, W. K. (2005). Rooted maximum agreement supertrees. Algorithmica, 293-307.
10. Kashima, H., & Koyanagi, T. (2002). Kernels for semistructured data. the 9th International Conference on Machine Learning (ICML 2002) (pp. 291-298).
11. Kuboyama, T., Shin, K., & Kashima, H. (2006). Flexible tree kernels based on counting the number of tree mappings. Proc. of Machine Learning with Graphs.
12. Leslie, C. S., Eskin, E., Cohen, A., Weston, J., & Noble, W. S. (2004). Mismatch string kernels for discriminative protein classification. Bioinformatics, 20.
13. Li, H., & Jiang, T. (2005). A class of edit kernels for svms to predict translation initiation sites in eukaryotic nirnas. Trans. on Comput. Syst. Bio. II, LNBI 3680, 48-58.
14. Lodhi, H., Shawe-Taylor, J., Cristianini, N., & Watkins, C. J. C. H. (2001). Text classificatio using string kernels. Advances in Neural Information Processing Systems, 13.
15. Lu, C. L., Su, Z.-Y., & Tang, G. Y. (2001). A New Measure of Edit Distance between Labeled Trees. LNCS (pp. pp. 338-348). Springer-Verlag Heidelberg.
16. Menchetti, S., Costa, F., & Frasconi, P. (2005). Weighted decomposition kernel. Proc. of the 22nd International Conference on Machine Learning.
17. Pelillo, M. (2002). Matching free trees, maximal cliques, and monotone game dynamics. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 1535-1541.
18. Salzberg, S. L. (1997). A method for identifying splice sites and translational staqr sites in eukaryotic nirna. Computer Applications in the Biosciences, 13, 365-376.
19. Suzuki, J., Isozaki, H., & Maeda, E. (2004). Convolution kernels with feature selection for natural language processing tasks. Proc. of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL) (pp. 119-126).
20. Tai, K. C. (1979). The Tree-to-Tree Correction Problem. JACM, 26, 422-433.
21. Wagner, R., & Fischer, M. (1974). The string-to-string correction problem. JACM, 21, 168-173.
22. Zhang, K. (1995). Algorithms for the constrained editing distance between ordered labeled trees and related problems. PR, 28, 463-474.
23. Zien, A., Ratsch, G., Mika, S., Schölkopf, B., Lengauer, T., & Müller, K. R. (2000). Engineering support vector machne kernels that recognize translation initiation sites. Bioinformatics, 16, 799807.