๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient clustering of large data sets

โœ Scribed by V.S. Ananthanarayana; M.Narasimha Murty; D.K. Subramanian


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
130 KB
Volume
34
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Selective sampling for approximate clust
โœ Liang Wang; James C. Bezdek; Christopher Leckie; Ramamohanarao Kotagiri ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 506 KB

A key challenge in pattern recognition is how to scale the computational efficiency of clustering algorithms on large data sets. The extension of non-Euclidean relational fuzzy c-means (NERF) clustering to very large (VL = unloadable) relational data is called the extended NERF (eNERF) clustering al