𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clustering problems in optimization models

✍ Scribed by Santosh Kabadi; Katta G. Murty; Cosimo Spera

Publisher
Springer US
Year
1996
Tongue
English
Weight
585 KB
Volume
9
Category
Article
ISSN
1572-9974

No coin nor oath required. For personal study only.

✦ Synopsis

We discuss a variety of clustering problems arising in combinatorial applications and in classifying objects into homogenous groups. For each problem we discuss solution strategies that work well in practice. We also discuss the importance of careful modelling in clustering problems.

πŸ“œ SIMILAR VOLUMES

Ant colony optimization of clustering mo
Ant colony optimization of clustering models
✍ Thomas A. Runkler πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 319 KB

The original ant system algorithm is simplified leading to a generalized ant colony optimization algorithm that can be used to solve a wide variety of discrete optimization problems. It is shown how objective function based clustering models such as hard and fuzzy c-means can be optimized using part

Phase transition in an optimal clusteriz
Phase transition in an optimal clusterization model
✍ ZoltΓ‘n NΓ©da; RΔƒzvan Florian; MΓ‘ria Ravasz; AndrΓ‘s LibΓ‘l; GΓ©za GyΓΆrgyi πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 299 KB

An optimal clusterization model resembling the infinite-range Potts glass-type model with AEJ bonds and unrestricted number of states, p ΒΌ N is introduced and studied. As a function of the q probability of ΓΎJ bonds, it is found that the r relative size of the largest cluster, or, coalition, shows a