Sciweavers

504 search results - page 4 / 101
» PCS: An Efficient Clustering Method for High-Dimensional Dat...
Sort
View
PR
2006
116views more  PR 2006»
13 years 5 months ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
Stefano Rovetta, Francesco Masulli
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
13 years 10 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
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
13 years 10 months ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
13 years 10 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
13 years 10 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu