Sciweavers

123 search results - page 7 / 25
» Characteristic-Based Clustering for Time Series Data
Sort
View
EDBT
2004
ACM
142views Database» more  EDBT 2004»
14 years 8 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 9 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...
BMCBI
2008
259views more  BMCBI 2008»
13 years 8 months ago
DISCLOSE : DISsection of CLusters Obtained by SEries of transcriptome data using functional annotations and putative transcripti
Background: A typical step in the analysis of gene expression data is the determination of clusters of genes that exhibit similar expression patterns. Researchers are confronted w...
Evert-Jan Blom, Sacha A. F. T. van Hijum, Klaas J....
AAAI
2000
13 years 10 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
ICDM
2009
IEEE
121views Data Mining» more  ICDM 2009»
14 years 3 months ago
Finding Time Series Motifs in Disk-Resident Data
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
Abdullah Mueen, Eamonn J. Keogh, Nima Bigdely Sham...