The Clustering Method Based on the Consequential Running of k-Means with Calculation of the Distances to the Active Centroids

• Datum: 2012
• Hauptverfasser: Ткаченко, О. М., Біліченко, Н. О., Грійо Тукало, О. Ф., Дзісь, О. В.
• Format: Artikel
• Sprache: Ukrainian
• Veröffentlicht: Інститут проблем реєстрації інформації НАН України 2012
• Schlagworte: code books; clustering; k-means; centroids; kd-trees
• Online Zugang: http://drsp.ipri.kiev.ua/article/view/311801
• Назва журналу: Data Recording, Storage & Processing

A variant of the clustering problem solution based on k-means algorithm is considered. This algorithm is widely used in many fields of science and technology. The main drawbacks of k-means algorithm are the clustering results dependence on the choice of the initial configuration of centroids (initia...