PeerMatcher: Decentralized Partnership Formation

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

This paper presents PeerMatcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pairwise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, PeerMatcher 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 PeerMatcher demonstrates its accuracy, efficiency, and scalability.
Original languageEnglish
Title of host publicationIEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems
Publication statusPublished - 2015

Fingerprint

Scalability
Computational complexity
Communication

Cite this

Bozdog, N. V., Voulgaris, S., Bal, H. E., & van Halteren, A. (2015). PeerMatcher: Decentralized Partnership Formation. In IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems
Bozdog, N.V. ; Voulgaris, S. ; Bal, H.E. ; van Halteren, A. / PeerMatcher: Decentralized Partnership Formation. IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems. 2015.
@inproceedings{4c9b54a894bf4de7b21b499ab6c25f8d,
title = "PeerMatcher: Decentralized Partnership Formation",
abstract = "This paper presents PeerMatcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pairwise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, PeerMatcher 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 PeerMatcher demonstrates its accuracy, efficiency, and scalability.",
author = "N.V. Bozdog and S. Voulgaris and H.E. Bal and {van Halteren}, A.",
year = "2015",
language = "English",
booktitle = "IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems",

}

Bozdog, NV, Voulgaris, S, Bal, HE & van Halteren, A 2015, PeerMatcher: Decentralized Partnership Formation. in IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems.

PeerMatcher: Decentralized Partnership Formation. / Bozdog, N.V.; Voulgaris, S.; Bal, H.E.; van Halteren, A.

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

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - PeerMatcher: Decentralized Partnership Formation

AU - Bozdog, N.V.

AU - Voulgaris, S.

AU - Bal, H.E.

AU - van Halteren, A.

PY - 2015

Y1 - 2015

N2 - This paper presents PeerMatcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pairwise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, PeerMatcher 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 PeerMatcher demonstrates its accuracy, efficiency, and scalability.

AB - This paper presents PeerMatcher, a fully decentralized algorithm solving the k-clique matching problem. The aim of k-clique matching is to cluster a set of nodes having pairwise weights into k-size groups of maximal total weight. Since solving the problem requires exponential time, PeerMatcher 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 PeerMatcher demonstrates its accuracy, efficiency, and scalability.

M3 - Conference contribution

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

ER -

Bozdog NV, Voulgaris S, Bal HE, van Halteren A. PeerMatcher: Decentralized Partnership Formation. In IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems. 2015