Sciweavers

216 search results - page 28 / 44
» Compression-based data mining of sequential data
Sort
View
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 5 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 9 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
14 years 23 days ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
KDD
1998
ACM
212views Data Mining» more  KDD 1998»
14 years 26 days ago
Learning to Predict Rare Events in Event Sequences
Learning to predict rare events from sequences of events with categorical features is an important, real-world, problem that existing statistical and machine learning methods are ...
Gary M. Weiss, Haym Hirsh
BMVC
2010
13 years 6 months ago
Probabilistic Latent Sequential Motifs: Discovering Temporal Activity Patterns in Video Scenes
This paper introduces a novel probabilistic activity modeling approach that mines recurrent sequential patterns from documents given as word-time occurrences. In this model, docum...
Jagannadan Varadarajan, Rémi Emonet, Jean-M...