Parallel algorithms for hierarchical clustering
Hierarchical clustering is a common method used to determine clusters of similar data points in multidimensional spaces. O( n 2) algorithms are known for this problem [3,4,11,19]. This paper reviews important results for sequential algorithms and describes previous work on parallel algorithms for hi...
Saved in:
| Published in: | Parallel computing Vol. 21; no. 8; pp. 1313 - 1325 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Amsterdam
Elsevier B.V
01.08.1995
Elsevier |
| Subjects: | |
| ISSN: | 0167-8191, 1872-7336 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!