收缩相关聚类

2015 Federated Conference on Computer Science and Information Systems (FedCSIS) Pub Date : 2015-11-09 DOI:10.15439/2015F137

László Aszalós, Tamás Mihálydeák

{"title":"收缩相关聚类","authors":"László Aszalós, Tamás Mihálydeák","doi":"10.15439/2015F137","DOIUrl":null,"url":null,"abstract":"We suggest an effective method for solving the problem of correlation clustering. This method is based on an extension of a partial tolerance relation to clusters. We present several implementation of this method using different data structures, and we show a method to speed up the execution by a quasi-parallelism.","PeriodicalId":276884,"journal":{"name":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Correlation clustering by contraction\",\"authors\":\"László Aszalós, Tamás Mihálydeák\",\"doi\":\"10.15439/2015F137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We suggest an effective method for solving the problem of correlation clustering. This method is based on an extension of a partial tolerance relation to clusters. We present several implementation of this method using different data structures, and we show a method to speed up the execution by a quasi-parallelism.\",\"PeriodicalId\":276884,\"journal\":{\"name\":\"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)\",\"volume\":\"143 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15439/2015F137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Federated Conference on Computer Science and Information Systems (FedCSIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15439/2015F137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

提出了一种解决相关聚类问题的有效方法。该方法基于对聚类的部分容差关系的扩展。我们给出了使用不同数据结构实现该方法的几种方法，并展示了一种通过准并行来加快执行速度的方法。

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

查看原文本刊更多论文

Correlation clustering by contraction

We suggest an effective method for solving the problem of correlation clustering. This method is based on an extension of a partial tolerance relation to clusters. We present several implementation of this method using different data structures, and we show a method to speed up the execution by a quasi-parallelism.

求助全文

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

来源期刊

2015 Federated Conference on Computer Science and Information Systems (FedCSIS)

自引率

0.00%

发文量