Sciweavers

1038 search results - page 1 / 208
» A Genetic Algorithm for Clustering on Very Large Data Sets
Sort
View
CAINE
2003
13 years 5 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
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
13 years 8 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
IDEAL
2004
Springer
13 years 9 months ago
DESCRY: A Density Based Clustering Algorithm for Very Large Data Sets
Fabrizio Angiulli, Clara Pizzuti, Massimo Ruffolo
PAMI
2006
134views more  PAMI 2006»
13 years 4 months ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee
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