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...

Full description

Saved in:
Bibliographic Details
Published inPattern recognition letters Vol. 29; no. 9; pp. 1385 - 1391
Main Author Žalik, Krista Rizman
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.07.2008
Elsevier
Subjects
Online AccessGet full text

Cover

Loading…