Study of structural features associated with complex networks has its utility. In the process a key role is played by community. Online networks are showing unprecedented growth in complexity. In this context, the traditional approach used to discovery community is not sufficient to deal with large networks. Thus it leads to the problem of inability to discovery communities efficiently in the large scale networks. To overcome this problem, a Parallel Community Discovery (PCD) algorithm is proposed based on the concept of approximate optimization. The algorithm has two parts. They are known as mountain model and landslide algorithm. The former is meant for providing approximate selection of nodes that are used for representation in graph theory. It shows users and the data posted by them in the network. The landslide algorithm on the other hand updates the modularity from time to time incrementally based on the aforementioned technique named approximate optimization. Thus the proposed methodology helps in discovering communities in parallel. The process of clustering on the modularity plays important role in mountain model as it employs weight associated with each edge in the given network. The communities also exhibit relationship among them. However, they are simplified by the landslide algorithm thus helping in extraction of community structural features from large networks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.