Active semi-supervised overlapping community finding with pairwise constraints
|Title:||Active semi-supervised overlapping community finding with pairwise constraints||Authors:||Alghamdi, Elham; Greene, Derek||Permanent link:||http://hdl.handle.net/10197/11048||Date:||23-Aug-2019||Online since:||2019-08-27T07:12:10Z||Abstract:||Algorithms for finding communities in complex networks are generally unsupervised, relying solely on the structure of the network. However, these methods can often fail to uncover meaningful groupings that reflect the underlying communities in the data, particularly when they are highly overlapping. One way to improve these algorithms is by incorporating human expertise or background knowledge in the form of pairwise constraints to direct the community detection process. In this work, we explore the potential of semi-supervised strategies to improve algorithms for finding overlapping communities in networks. We propose a method, based on label propagation, for finding communities using pairwise constraints. Furthermore, we introduce a new strategy, inspired by active learning, for intelligent constraint selection, which is designed to minimize the level of human annotation required. Extensive evaluations on synthetic and real-world datasets demonstrate the potential of this strategy for effectively uncovering meaningful overlapping community structures, using a limited amount of supervision.||Funding Details:||Science Foundation Ireland||metadata.dc.description.othersponsorship:||Insight Research Centre
The Ministry of Higher Education in Saudi Arabia
|Type of material:||Journal Article||Publisher:||Springer||Journal:||Applied Network Science||Volume:||4||Issue:||63||Start page:||1||End page:||27||Copyright (published version):||2019 the Authors||Keywords:||Machine Learning & Statistics; Algorithms; Communities; Social networks; PC-SLPA; AC-SLPA||DOI:||10.1007/s41109-019-0175-7||Language:||en||Status of Item:||Peer reviewed|
|Appears in Collections:||Computer Science Research Collection|
Insight Research Collection
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.