𝔖 Bobbio Scriptorium

✦ LIBER ✦

Expected-time complexity results for hierarchic clustering algorithms which use cluster centres

✍ Scribed by F. Murtagh

Book ID: 113162598
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 406 KB
Volume: 16
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90095-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE Computing (TISC) - Chennai, India

[IEEE Computing (TISC) - Chennai, India (2010.12.17-2010.12.19)] Trendz in Information Sciences & Computing(TISC2010) - An efficient K-Means clustering algorithm for reducing time complexity using uniform distribution data points

✍ Napoleon, D.; Lakshmi, P. Ganga 📂 Article 📅 2010 🏛 IEEE ⚖ 100 KB