✦ LIBER ✦

A comparative study of efficient initialization methods for the k-means clustering algorithm

✍ Scribed by Celebi, M. Emre; Kingravi, Hassan A.; Vela, Patricio A.

Book ID: 120439693
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 364 KB
Volume: 40
Category: Article
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2012.07.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An empirical comparison of four initiali

An empirical comparison of four initialization methods for the K-Means algorithm

✍ J.M Peña; J.A Lozano; P Larrañaga 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 600 KB

A new algorithm for initial cluster cent

A new algorithm for initial cluster centers in k-means algorithm

✍ Murat Erisoglu; Nazif Calis; Sadullah Sakallioglu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Cluster Center Initialization Method for

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters

✍ Chun Sheng Li 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 619 KB

A study of K-Means-based algorithms for

A study of K-Means-based algorithms for constrained clustering

✍ Covões, Thiago F. ;Hruschka, Eduardo R. ;Ghosh, Joydeep 📂 Article 📅 2013 🏛 IOS Press 🌐 English ⚖ 255 KB

An extended study of the K-means algorit

An extended study of the K-means algorithm for data clustering and its applications

✍ Chen, Ja-Shen; Ching, Russell K H; Lin, Yi-Shen 📂 Article 📅 2004 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 222 KB

A computational study of several relocat

A computational study of several relocation methods for k-means algorithms

✍ Agostino Tarsitano 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 188 KB

The core of a k-means algorithm is the reallocation phase. A variety of schemes have been suggested for moving entities from one cluster to another and each of them may give a di erent clustering even though the data set is the same. The present paper describes shortcomings and relative merits of 17