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

The use of sampling to cluster large data sets

โœ Scribed by Philip K. Hopke; Leonard Kaufman


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
980 KB
Volume
8
Category
Article
ISSN
0169-7439

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

Efficient clustering of large data sets
โœ V.S. Ananthanarayana; M.Narasimha Murty; D.K. Subramanian ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB