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

✍ Scribed by Agostino Tarsitano

• Book ID: 104161734
• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 188 KB
• Volume: 36
• Category: Article
• ISSN: 0031-3203
• DOI: 10.1016/s0031-3203(03)00190-0

✦ Synopsis

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 relocation methods in connection with randomly generated data sets.