Sciweavers

144 search results - page 22 / 29
» Mining Comprehensible Clustering Rules with an Evolutionary ...
Sort
View
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
14 years 1 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu
GECCO
2006
Springer
128views Optimization» more  GECCO 2006»
13 years 11 months ago
FTXI: fault tolerance XCS in integer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
Hong-Wei Chen, Ying-Ping Chen
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 7 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
BMCBI
2008
132views more  BMCBI 2008»
13 years 7 months ago
The SeqWord Genome Browser: an online tool for the identification and visualization of atypical regions of bacterial genomes thr
Background: Data mining in large DNA sequences is a major challenge in microbial genomics and bioinformatics. Oligonucleotide usage (OU) patterns provide a wealth of information f...
Hamilton Ganesan, Anna S. Rakitianskaia, Colin F. ...
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 8 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle