Sciweavers

498 search results - page 1 / 100
» DESCRY: A Density Based Clustering Algorithm for Very Large ...
Sort
View
IDEAL
2004
Springer
13 years 10 months ago
DESCRY: A Density Based Clustering Algorithm for Very Large Data Sets
Fabrizio Angiulli, Clara Pizzuti, Massimo Ruffolo
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
13 years 9 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
AI
2005
Springer
13 years 10 months ago
A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets
Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we ...
Xin Wang, Howard J. Hamilton
CAINE
2003
13 years 6 months ago
A Genetic Algorithm for Clustering on Very Large Data Sets
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
Jim Gasvoda, Qin Ding
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
13 years 9 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos