Sciweavers

4 search results - page 1 / 1
» Learning prediction suffix trees with Winnow
Sort
View
ICML
2009
IEEE
13 years 2 months ago
Learning prediction suffix trees with Winnow
Nikolaos Karampatziakis, Dexter Kozen
ICML
2006
IEEE
14 years 5 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
NIPS
2004
13 years 5 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
13 years 1 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar