𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A conceptual version of the K-means algorithm

✍ Scribed by H. Ralambondrainy


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
680 KB
Volume
16
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A faster version of the ASG algorithm
✍ N.L. Boland; A.T. Ernst; C.J. Goh; A.I. Mees πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 300 KB
A note on constrained k-means algorithms
✍ Michael K. Ng πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 102 KB

This paper describes extensions to the k-means algorithm for clustering data sets. By adding suitable constraints into the mathematical program formulation, an approach is developed, which allows the use of the k-means paradigm to e$ciently cluster data sets with the "xed number of objects in each c