eduzhai > Applied Sciences > Engineering >

Greedy Approach for Unfolding Communities from Massive Networks Using Multi-Threading

  • Save

... pages left unread,continue reading

Document pages: 6 pages

Abstract: A couple of the Internet and large-scale public networks (i.e. YouTube, Facebook, LinkedIn, and Twitter etc.) are having a deep and prolific effect on the learning of social networks. Real-world social networks are to divide into small partitions. The aim of this research work is to develop sturdy and faster Community Detection Algorithms using a parallel approach with multi-threading, which finds strong groups from given social network. We have proposed a Greedy Incremental Community Detection using Multi-Threading (GICDMT) and it is tested on various well-known standard datasets with Eigenvector based community detection algorithm.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×