Community Discovery Algorithm Based on Clustering and Genetic Optimization
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064


Downloads: 121 | Views: 406 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

Research Paper | Computer Science & Engineering | China | Volume 8 Issue 5, May 2019 | Popularity: 6.8 / 10


     

Community Discovery Algorithm Based on Clustering and Genetic Optimization

Befikadu Birtukan Sieyum


Abstract: Community discovery algorithm is recently active area of scientific research and a study of in real world networks such as, computer network, social networks. Social network is a complex network of includes community groups, that have relationship between people in common identity, location, interests, occupations etc. It is used to have better standard community structure in complex network. This study proposed that a combination of clustering which is specified in k-means algorithm and genetic algorithm. In community discovery research area, there are many methods to solve a problem, because of this article depends on overlapping community study used the clique percolation method (CPM) to add in both algorithm that gives a better result in previous works. The study improves to have well structure community; quality of the relationship between two nodes satisfied and accurate relationship between each network in community.


Keywords: Community discovery, Clustering algorithm, Genetic optimization, k means clustering


Edition: Volume 8 Issue 5, May 2019


Pages: 1878 - 1882



Please Disable the Pop-Up Blocker of Web Browser

Verification Code will appear in 2 Seconds ... Wait



Text copied to Clipboard!
Befikadu Birtukan Sieyum, "Community Discovery Algorithm Based on Clustering and Genetic Optimization", International Journal of Science and Research (IJSR), Volume 8 Issue 5, May 2019, pp. 1878-1882, https://www.ijsr.net/getabstract.php?paperid=ART20198308, DOI: https://www.doi.org/10.21275/ART20198308

Top