Handling Noisy Constraints in Semi-supervised Overlapping Community Finding

DC FieldValueLanguage
dc.contributor.authorAlghamdi, Elham-
dc.contributor.authorRushe, Ellen-
dc.contributor.authorHossein Zadeh Bazargani, Mehran-
dc.contributor.authorMacNamee, Brian-
dc.contributor.authorGreene, Derek-
dc.date.accessioned2020-02-27T11:24:00Z-
dc.date.available2020-02-27T11:24:00Z-
dc.date.issued2019-12-12-
dc.identifier.urihttp://hdl.handle.net/10197/11290-
dc.descriptionThe 8th International Conference on Complex Networks and their Applications (Complex Networks 2019), Lisbon, Portugal, 10-12 December 2019en_US
dc.description.abstractCommunity structure is an essential property that helps us to understand the nature of complex networks. Since algorithms for detecting communities are unsupervised in nature, they can fail to uncover useful groupings, particularly when the underlying communities in a network are highly overlapping [1]. Recent work has sought to address this via semi-supervised learning [2], using a human annotator or “oracle” to provide limited supervision. This knowledge is typically encoded in the form of must-link and cannot-link constraints, which indicate that a pair of nodes should always be or should never be assigned to the same community. In this way, we can uncover communities which are otherwise difficult to identify via unsupervised techniques. However, in real semi-supervised learning applications, human supervision may be unreliable or “noisy”, relying on subjective decision making [3]. Annotators can disagree with one another, they might only have limited knowledge of a domain, or they might simply complete a labeling task incorrectly due to the burden of annotation. Thus, we might reasonably expect that the pairwise constraints used in a real semi-supervised community detection task could be imperfect or conflicting. The aim of this study is to explore the effect of noisy, incorrectly-labeled constraints on the performance of semisupervised community finding algorithms for overlapping networks. Furthermore, we propose an approach to mitigate such cases in real-world network analysis tasks. We treat noisy pairwise constraints as anomalies, and use an autoencoder, a commonlyused method in the domain of anomaly detection, to identify such constraints. Initial experiments on synthetic network demonstrate the usefulness of this approach.en_US
dc.description.sponsorshipScience Foundation Irelanden_US
dc.language.isoenen_US
dc.subjectMachine Learning & Statisticsen_US
dc.subjectCommunity structureen_US
dc.subjectComplex networksen_US
dc.titleHandling Noisy Constraints in Semi-supervised Overlapping Community Findingen_US
dc.typeConference Publicationen_US
dc.internal.webversionshttps://www.complexnetworks.org/-
dc.statusPeer revieweden_US
dc.check.date2020-04-24-
dc.neeo.contributorAlghamdi|Elham|aut|-
dc.neeo.contributorRushe|Ellen|aut|-
dc.neeo.contributorHossein Zadeh Bazargani|Mehran|aut|-
dc.neeo.contributorMacNamee|Brian|aut|-
dc.neeo.contributorGreene|Derek|aut|-
dc.date.embargo2021-04-24en_US
dc.description.adminProceedings will be published by Springer - ACen_US
dc.description.adminEmbargo until published plus 12 month embargo once published - ACen_US
dc.description.adminUpdate citation details during checkdate report - ACen_US
dc.date.updated2019-10-17T11:00:11Z-
dc.identifier.grantidSFI/12/RC/2289-
item.fulltextWith Fulltext-
item.grantfulltextembargo_20210424-
Appears in Collections:Computer Science Research Collection
Insight Research Collection
Files in This Item:
Access to this item has been restricted by the copyright holder until:2021-04-24
File Description SizeFormat 
insight_publication.pdf76.9 kBAdobe PDF    Request a copy
Show simple item record

Page view(s)

227
Last Week
4
Last month
19
checked on Aug 11, 2020

Download(s)

18
checked on Aug 11, 2020

Google ScholarTM

Check


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.