✦ LIBER ✦

A note on constrained k-means algorithms

✍ Scribed by Michael K. Ng

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 102 KB
Volume: 33
Category: Article
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(99)00057-6

No coin nor oath required. For personal study only.

✦ Synopsis

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 cluster. The new algorithm is presented and the e!ectiveness of the algorithm is demonstrated with experimental results.

📜 SIMILAR VOLUMES

A note on genetic algorithms for degree-

A note on genetic algorithms for degree-constrained spanning tree problems

✍ Zhou, Gengui; Gen, Mitsuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to

A note on constrained OWA aggregation

✍ Christer Carlsson; Robert Fullér; Péter Majlender 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 189 KB

A note on the constrained shortest-path

A note on the constrained shortest-path problem

✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

A note on convex hull algorithms

✍ S.K. Ghosh 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 62 KB

A note on hop-constrained walk polytopes

✍ Geir Dahl; Njål Foldnes; Luis Gouveia 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A conceptual version of the K-means algo

A conceptual version of the K-means algorithm

✍ H. Ralambondrainy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 680 KB