Overlapping Community Detection Algorithms On Bipartite Networks: Comparative Analysis

DSpace/Manakin Repository

Show simple item record

dc.contributor.advisor Orlando, Salvatore it_IT
dc.contributor.author Abebe, Seyum Assefa <1987> it_IT
dc.date.accessioned 2017-06-21 it_IT
dc.date.accessioned 2017-09-29T12:57:53Z
dc.date.issued 2017-07-06 it_IT
dc.identifier.uri http://hdl.handle.net/10579/10491
dc.description.abstract In today's connected world there are complex systems and the science of network has been given significant time and advances to understand those complex structures. The community structure of real networks and finding those communities become a motivation to study. One of the most important methodology in community detection is clustering, in which an independent part of a network can be found and the overlapping among those compartments of a network can be uncovered. These days the bipartite network has been given a separate attention and category to understand the structure within it. The network formulated by bipartite network data are presented in two different vertices and the interaction is between those vertices. There are many algorithms proposed to understand and uncover the community structure in the bipartite network. Most of the analysis are done using a small network data or synthetic data. Here we are trying to assess different algorithms which are used to detect communities in the bipartite network. Using conventional comparison methods, we evaluate the performance of each algorithm. The considered algorithms are BCFinder, BigClam, CODA and PaNDa+. The first two algorithms are clique based algorithms while BigClam uses cluster affiliation model, and CODA is an extension of BigClam which include directed networks arises from cohesive and 2-mode communities. PaNDA+ a Top-k pattern mining algorithm can be used to detect overlapping communities from bipartite networks. We test the algorithms against artificial benchmark networks and also with networks which have ground truth dataset. it_IT
dc.language.iso en it_IT
dc.publisher Università Ca' Foscari Venezia it_IT
dc.rights © Seyum Assefa Abebe, 2017 it_IT
dc.title Overlapping Community Detection Algorithms On Bipartite Networks: Comparative Analysis it_IT
dc.title.alternative Overlapping Community Detection Algorithms In Bipartite Networks: Comparative Analysis it_IT
dc.type Bachelor Thesis it_IT
dc.degree.name Informatica - computer science it_IT
dc.degree.level Laurea magistrale it_IT
dc.degree.grantor Dipartimento di Scienze Ambientali, Informatica e Statistica it_IT
dc.description.academicyear 2016/2017 sessione estiva it_IT
dc.rights.accessrights closedAccess it_IT
dc.thesis.matricno 854877 it_IT
dc.subject.miur INF/01 INFORMATICA it_IT
dc.description.note it_IT
dc.degree.discipline it_IT
dc.contributor.co-advisor it_IT
dc.date.embargoend 10000-01-01
dc.provenance.upload Seyum Assefa Abebe (854877@stud.unive.it), 2017-06-21 it_IT
dc.provenance.plagiarycheck Salvatore Orlando (orlando@unive.it), 2017-07-03 it_IT


Files in this item

This item appears in the following Collection(s)

Show simple item record