A Label Propagation Based Algorithm for Community Detection in Social Networks

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Tabatabaei Azadeh; Zandi Nezhad Mozhgan

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2022 | Issue:8

Download Full-Text

View:

Download:

Information Seminar Paper

Title

A Label Propagation Based Algorithm for Community Detection in Social Networks

Author(s)

Tabatabaei Azadeh | Zandi Nezhad Mozhgan

Keywords

Social Networks

Community Detection

Label Propagation Algorithm

Overlapping Communities

Abstract

Social network analysis with large volumes of data and complex communication structures is so difficult and time-consuming. Community Detection is one of the major challenges in network analysis. A community is a set of individuals or organizations whose communication density is more than other network entities. Community Detection or clustering can reveal the structure of groups in Social Networks, or relationships between entities. The Label Propagation Algorithms with neighbor node influence have less complexity than traditional algorithms, such as clustering, to recognize communities. Also, the algorithms can identify Overlapping Communities. In our Label Propagation Algorithm, which is based on the neighbor node influence, important nodes are more likely to publish their labels, while less important nodes have a small chance of spreading the label. The degree of similarity of nodes and the effect of nodes in a social network depends on the parameter of path length between nodes. In the proposed method, increasing this parameter leads to more accurate identification of overlapping and stable communities. The proposed algorithm detects Overlapping Communities with the same accuracy as the previous algorithms with fewer iterations, in less time. The algorithm is implemented on real and artificial Social Networks with weightless graphs and weighted graphs with weighting by Jacquard similarity criterion, in all of which the execution time is improved.

Cites

No record.

References

No record.

Cite

APA: Copy

Tabatabaei, Azadeh, & Zandi Nezhad, Mozhgan. (2022). A Label Propagation Based Algorithm for Community Detection in Social Networks. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949659/en

Vancouver: Copy

Tabatabaei Azadeh, Zandi Nezhad Mozhgan. A Label Propagation Based Algorithm for Community Detection in Social Networks. 2022. Available from: https://sid.ir/paper/949659/en

IEEE: Copy

Azadeh Tabatabaei, and Mozhgan Zandi Nezhad, “A Label Propagation Based Algorithm for Community Detection in Social Networks,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2022, [Online]. Available: https://sid.ir/paper/949659/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops