2002 FastKernelsForStringAndTreeMatching

• (Vishwanathan & Smola, 2002) ⇒ S. V. N. Vishwanathan, and Alexander J. Smola. (2002). “Fast Kernels for String and Tree Matching.” In: Proceedings of NIPS-2002 (NIPS 2002).

Subject Headings: Relational Data Kernel Function

Notes

• Republished in (et al., 2004) ⇒ Bernhard Schölkopf, Koji Tsuda, Jean-Philippe Vert (editor). (2004). “Kernel Methods in Computational Biology.” MIT Press, ISBN:0262195097
  • http://books.google.com/books?id=SwAooknaMXgC&oi=fnd&pg=PA113

Cited By

• ~217 http://scholar.google.com/scholar?q=%22Fast+Kernels+for+String+and+Tree+Matching.%22+2002+NIPS

Quotes

Abstract

In this paper 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. Furthermore, prediction cost in many cases can be reduced to linear cost in the length of the sequence to be classified, regardless of the number of support vectors. This improvement on the currently available algorithms makes string kernels a viable alternative for the practitioner.

References

---

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2002 FastKernelsForStringAndTreeMatching	S. V. N. Vishwanathan Alexander J. Smola			Fast Kernels for String and Tree Matching			http://www.stat.purdue.edu/~vishy/papers/VisSmo03.ps.gz