Exploiting parallelism to support scalable hierarchical clustering.
A distributed memory parallel version of the group average hierarchical agglomerative clustering algorithm is proposed to enable scaling the document clustering problem to large collections. Using standard message passing operations reduces interprocess communication while maintaining efficient load...
| Published in: | Journal of the American Society for Information Science & Technology Vol. 58; no. 8; pp. 1207 - 1222 |
|---|---|
| Main Authors: | , , , , |
| Format: | algorithm equations & formulas research tables/charts Journal Article |
| Published: |
Wiley-Blackwell
Jun2007
|
| Online Access: | View this record in EBSCOhost |