Sciweavers

587 search results - page 61 / 118
» New Algorithms for Text Fingerprinting
Sort
View
ICPR
2010
IEEE
15 years 1 months ago
Spatial Representation for Efficient Sequence Classification
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
Pavel Kuksa, Vladimir Pavlovic
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 2 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
DMKD
2003
ACM
148views Data Mining» more  DMKD 2003»
15 years 3 months ago
A symbolic representation of time series, with implications for streaming algorithms
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
Jessica Lin, Eamonn J. Keogh, Stefano Lonardi, Bil...
FLAIRS
2006
14 years 11 months ago
Constrained Lexical Attraction Models
Lexical Attraction Models (LAMs) were first introduced by Deniz Yuret in (Yuret 1998) to exemplify how an algorithm can learn word dependencies from raw text. His general thesis i...
Radu Ion, Verginica Barbu Mititelu
AIIA
2007
Springer
15 years 4 months ago
Harvesting Relational and Structured Knowledge for Ontology Building in the WPro Architecture
We present two algorithms for supporting semi-automatic ontology building, integrated in WPro, a new architecture for ontology learning from Web documents. The first algorithm auto...
Daniele Bagni, Marco Cappella, Maria Teresa Pazien...