𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristic Methods for Large Centroid Clustering Problems

✍ Scribed by Éric D. Taillard

Book ID
110411809
Publisher
Springer US
Year
2003
Tongue
English
Weight
190 KB
Volume
9
Category
Article
ISSN
1381-1231

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient heuristic for large set cov
An efficient heuristic for large set covering problems
✍ Francis J. Vasko 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB

## Abstract A heuristic solution procedure for set covering is presented that works well for large, relatively dense problems. In addition, a confidence interval is established about the unknown global optimum. Results are presented for 30 large randomly generated problems.

Fast support-based clustering method for
Fast support-based clustering method for large-scale problems
✍ Kyu-Hwan Jung; Daewon Lee; Jaewook Lee 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 604 KB

In many support vector-based clustering algorithms, a key computational bottleneck is the cluster labeling time of each data point which restricts the scalability of the method. In this paper, we review a general framework of support vector-based clustering using dynamical system and propose a novel