Journal article

Optimum Benefit Protocol: A fast converging, bandwidth-efficient decentralized similarity overlay

IF Bukhari, A Harwood, S Karunasekera

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | ACADEMIC PRESS INC ELSEVIER SCIENCE | Published : 2017

Abstract

Due to large volumes of data available online, techniques such as document classification and clustering are required for organization, analysis and management of data. Similarity-based Clustering (SBC) is used by many existing systems for filtering information. Decentralized gossip-based overlays offer a simple, robust and scalable solution to SBC clustering. Convergence and communication complexity are the two key areas of concern when SBC is implemented using these overlays. Convergence guarantees accurate clustering but costs bandwidth because these systems rely on message passing to achieve convergence. In this work, we address the long tail problem, experienced by low in-degree nodes i..

View full abstract