✦ LIBER ✦

Rapid initial clustering of large data sets

✍ Scribed by Gauch, Hugh G.

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 809 KB
Volume: 42
Category: Article
ISSN: 1573-5052
DOI: 10.1007/bf00048877

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient clustering of large data sets

✍ V.S. Ananthanarayana; M.Narasimha Murty; D.K. Subramanian 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Selective sampling for approximate clust

Selective sampling for approximate clustering of very large data sets

✍ 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

Approximate pairwise clustering for larg

Approximate pairwise clustering for large data sets via sampling plus extension

✍ Liang Wang; Christopher Leckie; Ramamohanarao Kotagiri; James Bezdek 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 1018 KB

A clustering algorithm for data-sets wit

A clustering algorithm for data-sets with a large number of classes

✍ Qiwen Zhang; Qen Ring Wang; Roger Boyle 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 682 KB

Clusla: A computer program for the clust

Clusla: A computer program for the clustering of large phytosociological data sets

✍ Louppen, J. M. W. ;Maarel, E. 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 592 KB

The use of sampling to cluster large dat

The use of sampling to cluster large data sets

✍ Philip K. Hopke; Leonard Kaufman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 980 KB