Sciweavers

37 search results - page 2 / 8
» Time-series clustering by approximate prototypes
Sort
View
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 5 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 6 months ago
Detecting time series motifs under uniform scaling
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
Dragomir Yankov, Eamonn J. Keogh, Jose Medina, Bil...
IS
2008
13 years 5 months ago
A dimensionality reduction technique for efficient time series similarity analysis
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
Qiang Wang, Vasileios Megalooikonomou
AAAI
2000
13 years 7 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
14 years 7 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...