Sciweavers

4039 search results - page 55 / 808
» A Method for Dynamic Clustering of Data
Sort
View
PRL
2007
150views more  PRL 2007»
14 years 11 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
ICDM
2002
IEEE
152views Data Mining» more  ICDM 2002»
15 years 4 months ago
Concept Tree Based Clustering Visualization with Shaded Similarity Matrices
One of the problems with existing clustering methods is that the interpretation of clusters may be difficult. Two different approaches have been used to solve this problem: conce...
Jun Wang, Bei Yu, Les Gasser
ICDM
2006
IEEE
127views Data Mining» more  ICDM 2006»
15 years 5 months ago
The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering
The nonnegative matrix factorization (NMF) has been shown recently to be useful for clustering. Various extensions of NMF have also been proposed. In this paper we present an over...
Tao Li, Chris H. Q. Ding
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
15 years 1 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
DMIN
2006
151views Data Mining» more  DMIN 2006»
15 years 1 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain