层次聚类的单链路启发式快速并行算法

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing Pub Date : 1992-12-01 DOI:10.1109/SPDP.1992.242746

E. Dahlhaus

{"title":"层次聚类的单链路启发式快速并行算法","authors":"E. Dahlhaus","doi":"10.1109/SPDP.1992.242746","DOIUrl":null,"url":null,"abstract":"A fast parallel algorithm of single link heuristics of hierarchical clustering is presented. Its time processor product is optimal and the parallel time is the square of the logarithm. The algorithm is based on computing a minimum spanning tree which can be done in O(log/sup 2/ n) time using O(n/sup 2//log/sup n/) processors. The main gap to be filled is to compute a hierarchical clustering tree (dendrogram) from a minimum spanning tree. The author proves that this can be done in O(log n) time using O(n) processors. Therefore, the overall time-processor product of O(n/sup 2/) is optimal.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"240 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Fast parallel algorithm for the single link heuristics of hierarchical clustering\",\"authors\":\"E. Dahlhaus\",\"doi\":\"10.1109/SPDP.1992.242746\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A fast parallel algorithm of single link heuristics of hierarchical clustering is presented. Its time processor product is optimal and the parallel time is the square of the logarithm. The algorithm is based on computing a minimum spanning tree which can be done in O(log/sup 2/ n) time using O(n/sup 2//log/sup n/) processors. The main gap to be filled is to compute a hierarchical clustering tree (dendrogram) from a minimum spanning tree. The author proves that this can be done in O(log n) time using O(n) processors. Therefore, the overall time-processor product of O(n/sup 2/) is optimal.<<ETX>>\",\"PeriodicalId\":265469,\"journal\":{\"name\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"volume\":\"240 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPDP.1992.242746\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1992.242746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

提出了一种快速并行的单链路启发式分层聚类算法。其时间处理器积是最优的，并行时间是对数的平方。该算法基于最小生成树的计算，使用O(n/sup 2//log/sup n/)个处理器，在O(log/sup 2//log/sup n/)时间内完成。要填补的主要空白是从最小生成树计算分层聚类树(树形图)。作者证明，这可以在O(log n)时间内完成，使用O(n)个处理器。因此，总的时间处理器积为0 (n/sup 2/)是最优的

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast parallel algorithm for the single link heuristics of hierarchical clustering

A fast parallel algorithm of single link heuristics of hierarchical clustering is presented. Its time processor product is optimal and the parallel time is the square of the logarithm. The algorithm is based on computing a minimum spanning tree which can be done in O(log/sup 2/ n) time using O(n/sup 2//log/sup n/) processors. The main gap to be filled is to compute a hierarchical clustering tree (dendrogram) from a minimum spanning tree. The author proves that this can be done in O(log n) time using O(n) processors. Therefore, the overall time-processor product of O(n/sup 2/) is optimal.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing

自引率

0.00%

发文量