Detecting community structure in signed and unsigned social networks by using weighted label propagation
Detecting community structure is one of the most important problems in analyzing complex networks such as technological, informational, biological, and social networks and has great importance in understanding the operation and organization of these networks. One of the significant properties of social networks is the communication intensity between the users, which has not received much attention so far. Most of the proposed methods for detecting community structure in social networks have only considered communications between users. In this paper, using MinHash and label propagation, an algorithm called weighted label propagation algorithm (WLPA) has been proposed to detect community structure in signed and unsigned social networks. WLPA takes into account the intensity of communications in addition to the communications. In WLPA, first, the similarity of all adjacent nodes is estimated by using MinHash. Then, each edge is assigned a weight equal to the estimated similarity of its end nodes. The weights assigned to the edges somehow indicate the intensity of communication between users. Finally, the community structure of the network is determined through the weighted label propagation. Experiments on the benchmark networks indicate that WLPA is efficient and effective for detecting community structure in both signed and unsigned social networks.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2020 |
|---|---|
| Erschienen: |
2020 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:30 |
|---|---|
| Enthalten in: |
Chaos (Woodbury, N.Y.) - 30(2020), 10 vom: 28. Okt., Seite 103118 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Zarei, Bagher [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| Anmerkungen: |
Date Completed 14.07.2021 Date Revised 14.07.2021 published: Print Citation Status MEDLINE |
|---|
| doi: |
10.1063/1.5144139 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM317067893 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM317067893 | ||
| 003 | DE-627 | ||
| 005 | 20231225162443.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231225s2020 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1063/1.5144139 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1056.xml |
| 035 | |a (DE-627)NLM317067893 | ||
| 035 | |a (NLM)33138454 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Zarei, Bagher |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Detecting community structure in signed and unsigned social networks by using weighted label propagation |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Completed 14.07.2021 | ||
| 500 | |a Date Revised 14.07.2021 | ||
| 500 | |a published: Print | ||
| 500 | |a Citation Status MEDLINE | ||
| 520 | |a Detecting community structure is one of the most important problems in analyzing complex networks such as technological, informational, biological, and social networks and has great importance in understanding the operation and organization of these networks. One of the significant properties of social networks is the communication intensity between the users, which has not received much attention so far. Most of the proposed methods for detecting community structure in social networks have only considered communications between users. In this paper, using MinHash and label propagation, an algorithm called weighted label propagation algorithm (WLPA) has been proposed to detect community structure in signed and unsigned social networks. WLPA takes into account the intensity of communications in addition to the communications. In WLPA, first, the similarity of all adjacent nodes is estimated by using MinHash. Then, each edge is assigned a weight equal to the estimated similarity of its end nodes. The weights assigned to the edges somehow indicate the intensity of communication between users. Finally, the community structure of the network is determined through the weighted label propagation. Experiments on the benchmark networks indicate that WLPA is efficient and effective for detecting community structure in both signed and unsigned social networks | ||
| 650 | 4 | |a Journal Article | |
| 700 | 1 | |a Meybodi, Mohammad Reza |e verfasserin |4 aut | |
| 700 | 1 | |a Masoumi, Behrooz |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Chaos (Woodbury, N.Y.) |d 1991 |g 30(2020), 10 vom: 28. Okt., Seite 103118 |w (DE-627)NLM114360804 |x 1089-7682 |7 nnns |
| 773 | 1 | 8 | |g volume:30 |g year:2020 |g number:10 |g day:28 |g month:10 |g pages:103118 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1063/1.5144139 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 30 |j 2020 |e 10 |b 28 |c 10 |h 103118 | ||