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

Approximate pairwise clustering for large data sets via sampling plus extension

โœ Scribed by Liang Wang; Christopher Leckie; Ramamohanarao Kotagiri; James Bezdek


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
1018 KB
Volume
44
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