Sciweavers

247 search results - page 26 / 50
» Incremental String Comparison
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Approximate maximum margin algorithms with rules controlled by the number of mistakes
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
Petroula Tsampouka, John Shawe-Taylor
75
Voted
BNCOD
2009
113views Database» more  BNCOD 2009»
14 years 10 months ago
Dimensions of Dataspaces
The vision of dataspaces has been articulated as providing various of the benefits of classical data integration, but with reduced upfront costs, combined with opportunities for in...
Cornelia Hedeler, Khalid Belhajjame, Alvaro A. A. ...
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 1 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
15 years 10 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
JMLR
2008
148views more  JMLR 2008»
14 years 9 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov