A Distributed Hybrid Community Detection Methodology for Social Networks
Nowadays, the amount of digitally available information has tremendously grown, with real-world data graphs outreaching the millions or even billions of vertices. Hence, community detection, where groups of vertices are formed according to a well-defined similarity measure, has never been more essen...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-08-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/12/8/175 |
| _version_ | 1817988435747536896 |
|---|---|
| author | Konstantinos Georgiou Christos Makris Georgios Pispirigos |
| author_facet | Konstantinos Georgiou Christos Makris Georgios Pispirigos |
| author_sort | Konstantinos Georgiou |
| collection | DOAJ |
| description | Nowadays, the amount of digitally available information has tremendously grown, with real-world data graphs outreaching the millions or even billions of vertices. Hence, community detection, where groups of vertices are formed according to a well-defined similarity measure, has never been more essential affecting a vast range of scientific fields such as bio-informatics, sociology, discrete mathematics, nonlinear dynamics, digital marketing, and computer science. Even if an impressive amount of research has yet been published to tackle this NP-hard class problem, the existing methods and algorithms have virtually been proven inefficient and severely unscalable. In this regard, the purpose of this manuscript is to combine the network topology properties expressed by the loose similarity and the local edge betweenness, which is a currently proposed Girvan−Newman’s edge betweenness measure alternative, along with the intrinsic user content information, in order to introduce a novel and highly distributed hybrid community detection methodology. The proposed approach has been thoroughly tested on various real social graphs, roundly compared to other classic divisive community detection algorithms that serve as baselines and practically proven exceptionally scalable, highly efficient, and adequately accurate in terms of revealing the subjacent network hierarchy. |
| first_indexed | 2024-04-14T00:34:09Z |
| format | Article |
| id | doaj.art-8f803f38d71c4e8b8829fad669fdafa9 |
| institution | Directory Open Access Journal |
| issn | 1999-4893 |
| language | English |
| last_indexed | 2024-04-14T00:34:09Z |
| publishDate | 2019-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Algorithms |
| spelling | doaj.art-8f803f38d71c4e8b8829fad669fdafa92022-12-22T02:22:27ZengMDPI AGAlgorithms1999-48932019-08-0112817510.3390/a12080175a12080175A Distributed Hybrid Community Detection Methodology for Social NetworksKonstantinos Georgiou0Christos Makris1Georgios Pispirigos2Department of Computer Engineering and Informatics, University of Patras, 26504 Patras, GreeceDepartment of Computer Engineering and Informatics, University of Patras, 26504 Patras, GreeceDepartment of Computer Engineering and Informatics, University of Patras, 26504 Patras, GreeceNowadays, the amount of digitally available information has tremendously grown, with real-world data graphs outreaching the millions or even billions of vertices. Hence, community detection, where groups of vertices are formed according to a well-defined similarity measure, has never been more essential affecting a vast range of scientific fields such as bio-informatics, sociology, discrete mathematics, nonlinear dynamics, digital marketing, and computer science. Even if an impressive amount of research has yet been published to tackle this NP-hard class problem, the existing methods and algorithms have virtually been proven inefficient and severely unscalable. In this regard, the purpose of this manuscript is to combine the network topology properties expressed by the loose similarity and the local edge betweenness, which is a currently proposed Girvan−Newman’s edge betweenness measure alternative, along with the intrinsic user content information, in order to introduce a novel and highly distributed hybrid community detection methodology. The proposed approach has been thoroughly tested on various real social graphs, roundly compared to other classic divisive community detection algorithms that serve as baselines and practically proven exceptionally scalable, highly efficient, and adequately accurate in terms of revealing the subjacent network hierarchy.https://www.mdpi.com/1999-4893/12/8/175community detectiondistributed computingsocial networksnode attributeshomophily |
| spellingShingle | Konstantinos Georgiou Christos Makris Georgios Pispirigos A Distributed Hybrid Community Detection Methodology for Social Networks Algorithms community detection distributed computing social networks node attributes homophily |
| title | A Distributed Hybrid Community Detection Methodology for Social Networks |
| title_full | A Distributed Hybrid Community Detection Methodology for Social Networks |
| title_fullStr | A Distributed Hybrid Community Detection Methodology for Social Networks |
| title_full_unstemmed | A Distributed Hybrid Community Detection Methodology for Social Networks |
| title_short | A Distributed Hybrid Community Detection Methodology for Social Networks |
| title_sort | distributed hybrid community detection methodology for social networks |
| topic | community detection distributed computing social networks node attributes homophily |
| url | https://www.mdpi.com/1999-4893/12/8/175 |
| work_keys_str_mv | AT konstantinosgeorgiou adistributedhybridcommunitydetectionmethodologyforsocialnetworks AT christosmakris adistributedhybridcommunitydetectionmethodologyforsocialnetworks AT georgiospispirigos adistributedhybridcommunitydetectionmethodologyforsocialnetworks AT konstantinosgeorgiou distributedhybridcommunitydetectionmethodologyforsocialnetworks AT christosmakris distributedhybridcommunitydetectionmethodologyforsocialnetworks AT georgiospispirigos distributedhybridcommunitydetectionmethodologyforsocialnetworks |