Efficient computation of gapped substring kernels on large alphabets

Journal of Machine Learning Research

Volumn 6, Issue , 2005, Pages

  Rousu, Juho ^a   Shawe Taylor, John ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Kernel methods; Sparse dynamic programming; String kernels; Text categorization

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LEARNING SYSTEMS;

ALPHABETS; CHARACTERS; SUBSTRING KERNELS; TRIE-BASED ALGORITHMS;

CHARACTER RECOGNITION;

EID: 24944584599     PISSN: 15337928     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. P. Agarwal and J. Erickson. Geometric range searching and its relatives. Contemporary Mathematics 23: Advances in Discrete and Computational Geometry, pages 1-56, 1999.
2. S. Alstrup, G.S. Brodal, T. Rauhe. New Data Structures for Orthogonal Range Searching. In Proceedings of 41st Annual Symposium on Foundations of Computer Science, pages 198-207, 2000.
3. B. S. Baker and R. Giancarlo. Longest common subsequence from fragments via sparse dynamic programming. In Proceedings of Sixth Annual European Symposium on Algorithms, pages 79-90, 1998.
4. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry - Algorithms and Applications. Springer-Verlag, Berlin, 1997.
5. N. Cancedda, E. Gaussier, C. Goutte, J-M. Renders. Word-Sequence Kernels. Journal of Machine Learning Research 3:1059-1082, 2003.
6. B. Chazelle. Lower bounds for off-line range searching. In Proceedings of 27th Annual ACM Symposium on Theory of Computing, pages 733-740, 1995.
7. B. Chazelle and B. Rosenberg. Computing partial sums in multidimensional arrays. In Proceedings of 5th Annual Symposium on Computational Geometry, pages 131-139, 1989.
8. N. Cristianini and J. Shawe-Taylor. An introduction to Support Vector Machines. Cambridge University Press, 2000.
9. D. Eppstein. Efficient algorithms for sequence analysis with concave and convex gap costs. Ph.D. thesis, Columbia University, 1989.
10. D. Eppstein, Z. Galil, R. Giancarlo, and G. F. Italiano. Sparse dynamic programming I: linear cost functions. Journal of the ACM 39, 3:519-545, 1992.
11. D. Haussler. Convolution kernels on discrete structures. Technical report, University of California, Santa Cruz, 1999.
12. T. Joachims. Text Categorization with Support Vector Machines: Learning with Many Relevant Features. In Proceedings of Tenth European Conference on Machine Learning, pages 137-142, 1999.
13. C. Leslie, E. Eskin and W. Stafford Noble. The spectrum kernel: a string kernel for SVM protein classification. In Proceedings of Pacific Symposium on Biocomputing 7, pages 566-575, 2002.
14. C. Leslie, E. Eskin, J. Weston and W. Stafford Noble. Mismatch String Kernels for SVM Protein Classification. Advances in Neural Information Processing Systems 15, pages 1417-1424, 2003.
15. C. Leslie and R. Kuang. Fast Kernels for Inexact String Matching. In Proceedings of 16th Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel '2003. Lecture Notes in Computer Science 2777:114-128, 2003.
16. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini and C. Watkins. Text Classification using String Kernels. Journal of Machine Learning Research 2:419-444, 2002.
17. V. Mäkinen. Parameterized Approximate String Matching and Local-Similarity-Based Point-Pattern Matching. Report A-2003-6. Department of Computer Science, University of Helsinki, 2003.
18. M. Overmars. Efficient data structures for range searching on a grid. Journal of Algorithms 9:254-275, 1988.
19. C. Poon. Dynamic orthogonal range queries in OLAP. Theoretical Computer Science 296(3):487-510, 2003.
20. G. Salton, A. Wong and C.S. Yang. A Vector Space Model for Automatic Indexing. Communications of the ACM 18(11):613-620, 1973.
21. C. Saunders, H. Tschach and J. Shawe-Taylor. Syllables and other String Kernel Extensions. In Proceedings of 19th International Conference on Machine Learning, pages 530-537, 2002.
22. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
23. V. Vapnik. The Nature of Statistical Learning Theory. Springer Verlag, 1995.
24. S. Vishwanathan and A. Smola. Fast Kernels for String and Tree Matching. Advances in Neural Information Processing Systems 15, pages 569-576, 2003,
25. C. Watkins. Dynamic alignment kernels. In A.J. Smola, P. Bartlett, B. Schölkopf and D. Schuurmans, eds., Advances in Large Margin Classifiers, pages 39-50, 2000,