A FAST ALGORITHM FOR OVERLAPPING COMMUNITY DETECTION

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.

Elyasi Mostafa; Meybodi Mohammadreza; Rezvanian Alireza; AMIRHAERI MARYAM

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY
Year:2016 | Issue:8

Download Full-Text

View:

186

Download:

126

Information Seminar Paper

Title

A FAST ALGORITHM FOR OVERLAPPING COMMUNITY DETECTION

Author(s)

Elyasi Mostafa | Meybodi Mohammadreza | Rezvanian Alireza | AMIRHAERI MARYAM | Issue Writer Certificate

Keywords

COMMUNITY DETECTION

OVERLAPPING COMMUNITIES

SOCIAL NETWORK ANALYSIS

BELONGING MATRIX

LARG NETWORKS

FAST ALGORITHM

Abstract

NOWADAYS, THE EMERGENCE OF ONLINE SOCIAL NETWORKS HAVE EMPOWERED PEOPLE TO EASILY SHARE INFORMATION AND MEDIA WITH FRIENDS. INTERACTING USERS OF SOCIAL NETWORKS WITH SIMILAR USERS AND THEIR FRIENDS FORM COMMUNITY STRUCTURES OF NETWORKS. UNCOVERING COMMUNITIES OF THE ONLINE USERS IN SOCIAL NETWORKS PLAYS AN IMPORTANT ROLE IN NETWORK ANALYSIS WITH MANY APPLICATIONS SUCH AS FINDING A SET OF EXPERT USERS, FINDING A SET OF USERS WITH COMMON ACTIVITIES, FINDING A SET OF SIMILAR PEOPLE FOR MARKETING GOALS, TO MENTION A FEW. ALTHOUGH, SEVERAL ALGORITHMS FOR DISJOINT COMMUNITY DETECTION HAVE BEEN PRESENTED IN THE LITERATURE, ONLINE USERS SIMULTANEOUSLY INTERACT WITH THEIR FRIENDS HAVING DIFFERENT INTERESTS. ALSO USERS ARE ABLE TO JOIN MORE THAN ONE GROUP AT THE SAME TIME WHICH LEADS TO THE FORMATION OF OVERLAPPING COMMUNITIES. THUS, FINDING OVERLAPPING COMMUNITIES CAN REALIZE A REALISTIC ANALYSIS OF NETWORKS. IN THIS PAPER, WE PROPOSE A FAST ALGORITHM FOR OVERLAPPING COMMUNITY DETECTION. IN THE PROPOSED ALGORITHM, IN THE FIRST PHASE, THE LOUVAIN METHOD IS APPLIED TO THE GIVEN NETWORK AND IN THE SECOND PHASE A BELONGING MATRIX IS UPDATED WHERE AN EACH ELEMENT OF BELONGING MATRIX DETERMINES HOW MUCH A NODE BELONGS TO A COMMUNITY. FINALLY, SOME OF THE FOUND COMMUNITIES ARE MERGED BASED ON THE MODULARITY MEASURE. THE PERFORMANCE OF THE PROPOSED ALGORITHM IS STUDIED THROUGH THE SIMULATION ON THE POPULAR NETWORKS WHICH INDICATES THAT THE PROPOSED ALGORITHM OUTPERFORMS SEVERAL WELL-KNOWN OVERLAPPING COMMUNITY DETECTION ALGORITHMS.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Elyasi, Mostafa, Meybodi, Mohammadreza, Rezvanian, Alireza, & AMIRHAERI, MARYAM. (2016). A FAST ALGORITHM FOR OVERLAPPING COMMUNITY DETECTION. INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY. SID. https://sid.ir/paper/947598/en

Vancouver: Copy

Elyasi Mostafa, Meybodi Mohammadreza, Rezvanian Alireza, AMIRHAERI MARYAM. A FAST ALGORITHM FOR OVERLAPPING COMMUNITY DETECTION. 2016. Available from: https://sid.ir/paper/947598/en

IEEE: Copy

Mostafa Elyasi, Mohammadreza Meybodi, Alireza Rezvanian, and MARYAM AMIRHAERI, “A FAST ALGORITHM FOR OVERLAPPING COMMUNITY DETECTION,” presented at the INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY. 2016, [Online]. Available: https://sid.ir/paper/947598/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops