We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
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...
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...
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...
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...