Fast Kernels for String and Tree Matching

  title={Fast Kernels for String and Tree Matching},
  author={S. V. N. Vishwanathan and Alexander J. Smola},
In this chapter we present a new algorithm suitable for matching discrete objects such as strings and trees in linear time, thus obviating dynamic programming with quadratic time complexity. This algorithm can be extended in various ways to provide linear time prediction cost in the length of the sequence to be classified. We demonstrate extensions in the case of position dependent weights, sliding window classifiers for a long sequence, and efficient algorithms for dealing with weights given… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 443 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 225 extracted citations

443 Citations

Citations per Year
Semantic Scholar estimates that this publication has 443 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 21 references

Exponential families in feature space

  • A. J. Smola, T. Hofmann
  • In Advances in Neural Information Processing…
  • 2003
1 Excerpt

Convolution kernels for natural language

  • S. Eddy, A. Krogh
  • Biological Sequence Analysis : Probabilistic…
  • 2001

Joachims . Making large - scale SVM learning practical

  • T.
  • Advances in Kernel Methods — Support Vector…
  • 2000

Similar Papers

Loading similar papers…