13 search results - page 1 / 3 » Computation of Initial Modes for K-modes Clustering Algorith... |
IJCAI
2007
14 years 9 days ago
2007
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
ICPR
2002
IEEE
14 years 12 months ago
2002
IEEE
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
CVPR
2003
IEEE
15 years 27 days ago
2003
IEEE
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
ECCV
2008
Springer
15 years 23 days ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...