𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An effective web document clustering algorithm based on bisection and merge

✍ Scribed by Ingyu Lee; Byung-Won On


Publisher
Springer Netherlands
Year
2011
Tongue
English
Weight
513 KB
Volume
36
Category
Article
ISSN
0269-2821

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A new efficient algorithm based on DC pr
✍ Le Thi Hoai An; M. Tayeb Belghiti; Pham Dinh Tao πŸ“‚ Article πŸ“… 2006 πŸ› Springer US 🌐 English βš– 221 KB

In this paper, a version of K-median problem, one of the most popular and best studied clustering measures, is discussed. The model using squared Euclidean distances terms to which the K-means algorithm has been successfully applied is considered. A fast and robust algorithm based on DC (Difference