✦ LIBER ✦

Parallel clustering algorithms

✍ Scribed by Xiaobo Li; Zhixi Fang

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 833 KB
Volume: 11
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(89)90036-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for hierarchical clu

Parallel algorithms for hierarchical clustering

✍ Clark F. Olson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 785 KB

Efficient Parallel Algorithms for Hierar

Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses

✍ Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Clustering is a basic operation in image processing and computer vision, and it plays an important role in unsupervised pattern recognition and image segmentation. While there are many methods for clustering, the single-link hierarchical clustering is one of the most popular techniques. In this pape

Fast isodata clustering algorithms

✍ N.B. Venkateswarlu; P.S.V.S.K. Raju 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Cluster Identification Algorithms for Sp

Cluster Identification Algorithms for Spin Models — Sequential and Parallel

✍ Baillie, Clive F. ;Coddington, Paul D. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 963 KB

Fuzzy clustering with evolutionary algor

Fuzzy clustering with evolutionary algorithms

✍ Frank Klawonn; Annette Keller 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

Objective function-based fuzzy clustering aims at finding a fuzzy partition by optimizing a Ž . function that evaluates a fuzzy assignment of a given data set to clusters that are characterized by a set of parameters, the so-called prototypes. The iterative optimization technique usually requires th

Parallel Algorithms for Hierarchical Clu

Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition

✍ Elias Dahlhaus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 306 KB

We present efficient parallel algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel