Sciweavers

50 search results - page 3 / 10
» CLOPE: a fast and effective clustering algorithm for transac...
Sort
View
ESANN
2006
13 years 6 months ago
An algorithm for fast and reliable ESOM learning
The training of Emergent Self-organizing Maps (ESOM ) with large datasets can be a computationally demanding task. Batch learning may be used to speed up training. It is demonstrat...
Mario Nöcker, Fabian Mörchen, Alfred Ult...
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 5 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
14 years 5 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 5 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
13 years 11 months ago
Hierarchical Density Shaving: A clustering and visualization framework for large biological datasets
In many clustering applications for bioinformatics, only part of the data clusters into one or more groups while the rest needs to be pruned. For such situations, we present Hiera...
Gunjan Gupta, Alexander Liu, Joydeep Ghosh