对等匹配:分散的伙伴关系形成

2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems Pub Date : 2015-09-21 DOI:10.1109/SASO.2015.11

N. V. Bozdog, Spyros Voulgaris, H. Bal, A. V. Halteren

{"title":"对等匹配:分散的伙伴关系形成","authors":"N. V. Bozdog, Spyros Voulgaris, H. Bal, A. V. Halteren","doi":"10.1109/SASO.2015.11","DOIUrl":null,"url":null,"abstract":"This paper presents Peer Matcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pair wise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, Peer Matcher employs a novel set of heuristics that aim at converging to the optimal grouping while keeping the associated time and computational complexity low. A key feature is the use of peer-to-peer communication. An extensive evaluation of Peer Matcher demonstrates its accuracy, efficiency, and scalability.","PeriodicalId":162395,"journal":{"name":"2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Peer Matcher: Decentralized Partnership Formation\",\"authors\":\"N. V. Bozdog, Spyros Voulgaris, H. Bal, A. V. Halteren\",\"doi\":\"10.1109/SASO.2015.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents Peer Matcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pair wise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, Peer Matcher employs a novel set of heuristics that aim at converging to the optimal grouping while keeping the associated time and computational complexity low. A key feature is the use of peer-to-peer communication. An extensive evaluation of Peer Matcher demonstrates its accuracy, efficiency, and scalability.\",\"PeriodicalId\":162395,\"journal\":{\"name\":\"2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SASO.2015.11\",\"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 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SASO.2015.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文提出了一种完全分散的算法Peer Matcher，用于解决k-clique匹配问题。k-团匹配的目的是将一组具有成对权值的节点聚类到总权值最大的k个大小的组中。由于解决问题需要指数级的时间，Peer Matcher采用了一组新颖的启发式算法，旨在收敛到最优分组，同时保持较低的相关时间和计算复杂度。一个关键特性是点对点通信的使用。对Peer Matcher的广泛评估证明了它的准确性、效率和可扩展性。

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

查看原文本刊更多论文

Peer Matcher: Decentralized Partnership Formation

This paper presents Peer Matcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pair wise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, Peer Matcher employs a novel set of heuristics that aim at converging to the optimal grouping while keeping the associated time and computational complexity low. A key feature is the use of peer-to-peer communication. An extensive evaluation of Peer Matcher demonstrates its accuracy, efficiency, and scalability.

求助全文

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

来源期刊

2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems

自引率

0.00%

发文量