An efficient k′-means clustering algorithm
This paper introduces k′-means algorithm that performs correct clustering without pre-assigning the exact number of clusters. This is achieved by minimizing a suggested cost-function. The cost-function extends the mean-square-error cost-function of k-means. The algorithm consists of two separate ste...
Saved in:
Published in | Pattern recognition letters Vol. 29; no. 9; pp. 1385 - 1391 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
01.07.2008
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!