PeerMatcher: Decentralized Partnership Formation

N.V. Bozdog; S. Voulgaris; H.E. Bal; A. van Halteren

PeerMatcher: Decentralized Partnership Formation

N.V. Bozdog, S. Voulgaris, H.E. Bal, A. van Halteren

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

202 Downloads (Pure)

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 language	English
Title of host publication	IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems
Publication status	Published - 2015

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

Paper-final-2015-07-27Final published version, 708 KB

Persistent URL (handle)

Copy link address

Cite this

@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",

}

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 -

PeerMatcher: Decentralized Partnership Formation

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this