Abstract

Community detection is widely used research topic. Community detection refers to detect same type of community structure in given graph or network. Nowadays, community detection is used for many applications like fraud detection, recommendation system, segmentation, etc. In this paper, our objective is to find the label for the unlabelled node using random walk and then label propagation algorithm. In this method, labelled and unlabelled data is provided as input and then, we take random walk until we find the unlabelled node, after that label for unlabelled node is provided based on labelled node using label propagation algorithm. The output of this method will be label for unlabelled node by using this we can divide the network into community. Comparison of different algorithm for community detection is discussed in this paper.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.