- Research Article
253
- 10.1086/soutjanth.10.1.3629074
Cultures of the Central Highlands, New Guinea
- Apr 01, 1954
- Southwestern Journal of Anthropology
- K E Read
Cultures of the Central Highlands, New Guinea
Abstract Community detection in complex networks is fundamental across social, biological, and technological domains. While traditional single-objective methods like Louvain and Leiden are computationally efficient, they suffer from resolution bias and structural degeneracy. Multi-objective evolutionary algorithms (MOEAs) address these limitations by simultaneously optimizing conflicting structural criteria, however, their high computational costs have historically limited their application to small networks. We present HP-MOCD, a High-Performance Evolutionary Multiobjective Community Detection Algorithm built on Non-dominated Sorting Genetic Algorithm II (NSGA-II), which overcomes these barriers through topology-aware genetic operators, full parallelization, and bit-level optimizations–achieving theoretical $$O(G \cdot N_p |V|)$$ O ( G · N p | V | ) complexity. We conduct experiments on both synthetic and real-world networks. Results demonstrate strong scalability, with HP-MOCD processing networks of over 1,000,000 nodes while maintaining high quality across varying noise levels. It outperforms other MOEAs by more than 531 times in runtime on synthetic datasets, achieving runtimes as low as 57 s for graphs with 40,000 nodes on moderately powered hardware. Across 14 real-world networks, HP-MOCD was the only MOEA capable of processing the six largest datasets within reasonable time, with results competitive with single-objective approaches. Unlike single-solution methods, HP-MOCD produces a Pareto Front, enabling individual-specific trade-offs and providing decision-makers with a spectrum of high-quality community structures. It introduces the first open-source MOEA library compatible with and for large-scale community detection.
Loading PDF
Cultures of the Central Highlands, New Guinea
Cultures of the Central Highlands, New Guinea
A local information based multi-objective evolutionary algorithm for community detection in complex networks
A local information based multi-objective evolutionary algorithm for community detection in complex networks
A Macro-Micro Population-Based Co-Evolutionary Multi-Objective Algorithm for Community Detection in Complex Networks [Research Frontier
Recently, multi-objective evolutionary algorithms (MOEAs) have shown promising performance in terms of community detection in complex networks. However, most studies have focused on designing different strategies to achieve good community detection performance based on a single population. Unlike these studies, this study proposes a macro-micro population-based co-evolutionary multi-objective algorithm called MMCoMO for community detection in complex networks to obtain a better trade-off between exploration and exploitation. This algorithm employs two populations, i.e., macro-population and micro-population, for co-evolution to obtain better community structures. In particular, the macro-population prefers exploration and is responsible for quickly determining approximate partitions of the network to obtain good rough community structures as early as possible, whereas the micro-population favors exploitation and is responsible for searching for good fine community structures through the local search process. Thus, these two populations can be used to improve each other through interactions in the co-evolutionary process. In particular, a guiding strategy is designed using the elite (non-dominated) solutions of the macro-population to guide the micro-population, and an influencing strategy is further designed using the elite solutions of the micro-population to positively influence the macro-population. Experiments on synthetic networks and 14 real-world networks demonstrate the superiority of the proposed algorithm over several state-of-the-art community detection algorithms.
Read moreA Systematic Analysis of Community Detection in Complex Networks
Numerous techniques have been proposed by researchers to uncover the hidden patterns of real-world complex networks. Finding a hidden community is one of the crucial tasks for community detection in complex networks. Despite the presence of multiple methods for community detection, identification of the best performing method over different complex networks is still an open research question. In this article, we analyzed eight state-of-the-art community detection algorithms on nine complex networks of varying sizes covering various domains including animal, biomedical, terrorist, social, and human contacts. The objective of this article is to identify the best performing algorithm for community detection in real-world complex networks of various sizes and from different domains. The obtained results over 100 iterations demonstrated that the multi-scale method has outperformed the other techniques in terms of accuracy. Multi-scale method achieved 0.458 average value of modularity metric whereas multiple screening resolution, unfolding fast, greedy, multi-resolution, local fitness optimization, sparse Geosocial community detection algorithm, and spectral clustering, respectively obtained the modularity values 0.455, 0.441, 0.436, 0.421, 0.368, 0.341, and 0.340..
Read moreA multi-objective adaptive evolutionary algorithm to extract communities in networks
A multi-objective adaptive evolutionary algorithm to extract communities in networks
Multiobjective Particle Swarm Optimization Based on Network Embedding for Complex Network Community Detection
Community detection in complex networks is significant to social network analysis. Most of the algorithms take advantage of single-objective optimization methods, which may not be effective for complex networks. Compared with single-objective algorithms, multiobjective evolutionary algorithms can avoid local optimization. However, multiobjective evolutionary algorithms often encounter problems of excessive search space and low efficiency. To solve these issues, this study introduces network embedding into the multiobjective particle swarm algorithm and maps nodes into a low-latitude space, thereby effectively reducing the search space while increasing search efficiency via a consensus propagation strategy. Experimental results demonstrate that a novel effective algorithm based on multiobjective particle swarm optimization (NE-PSO) performs effectively and has competitive performance in comparison with state-of-the-art approaches on synthetic and real-world networks, especially the large-scale ones.
Read moreA Comparative Study of State-of-the-Art Evolutionary Multi-objective Algorithms for Optimal Crop-mix planning
This study compared the performances of three state-of-theart evolutionary multi-objective optimization algorithms: the Non-Dominated Sorted Genetic Algorithm II (NSGA-II), the Epsilon-Dominance Non-Dominated Sorted Genetic Algorithm II (e -NSGA-II) and the Epsilon-Dominance Multi-Objective Evolutionary Algorithm ( e MOEA), on a constrained biobjective crop-mix planning problem (BCP). The BCP test case objectives were to: (i) maximize crop production and (ii) minimize planting area. The BCP problem was enumerated to provide the true Pareto-optimal solution set to facilitate rigorous testing of the evolutionary multi-objective optimization algorithms. The performances of the three algorithms were assessed and compared using three performance metrics (additive epsilon indicator, inverted generational distance and spacing). For the comparative study, a graphical comparison with respect to true Pareto front of optimal crop planning problem was provided. Results of the analyses indicated that the e MOEA greatly outperforms the NSGAII and the e -NSGA-II.
Read moreA Mixed Representation-Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection.
Designing multiobjective evolutionary algorithms (MOEAs) for community detection in complex networks has attracted much attention of researchers recently. However, most of the existing methods focus on addressing the task of nonoverlapping community detection, where each node must belong to one and only one community. In fact, communities are often overlapped with each other in many real-world networks, thus it is necessary to design overlapping community detection algorithms. To this end, this paper proposes a mixed representation-based MOEA (MR-MOEA) for overlapping community detection. In MR-MOEA, a mixed individual representation scheme is proposed to fast encode and decode the overlapping divisions of complex networks. Specifically, this mixed representation consists of two parts: one represents all potential overlapping nodes and the other delegates all nonoverlapping nodes. These two parts evolve together to detect the overlapping communities of networks based on different updating strategies suggested in MR-MOEA. We verify the effectiveness of the proposed algorithm MR-MOEA on ten real-world complex networks and the experimental results demonstrate that MR-MOEA is superior over six representative algorithms for overlapping community detection.
Read moreDistributed Multi-Objective Community Detection in Large-Scale and Complex Networks
Community detection has arisen as an important topic of many different research areas such as sociology, biology and computer science. However, with the appearance of big data and the rapid increasing size of real-world networks, a traditional evolutionary algorithm is unable or inefficient to solve the community detection problem in large-scale networks. In this paper, a distributed multi-objective evolutionary algorithm (DMOCD) for community detection is proposed. DMOCD is implemented based on Apache Spark and Resilient Distributed Datasets. The proposed distributed framework maintains a set of evolving populations (sub-populations) which evolve separately with different crossover and mutation parameters and an external repository as an elite archive to store the non-dominated individuals. A label propagation-based initialization method, a segmented crossover and mutation tactic for large-scale network are introduced. Experiments on both artificial and real-world networks prove that the proposed method is effective for community detection problems in small-scale networks and is able to process the large-scale networks which the stand-alone multi-objective evolutionary algorithms cannot deal with.
Read moreInverse modelling-based multi-objective evolutionary algorithm with decomposition for community detection in complex networks
Inverse modelling-based multi-objective evolutionary algorithm with decomposition for community detection in complex networks
Read moreA Community Detection Method Based on Multi-Objective Optimization Method
Community detection in complex network has been an active research area in data mining and machine learning. This paper proposed a community detection method based on multi-objective evolutionary algorithm, named CDMOEA, which tries to find the Pareto front by maximize two objectives, community score and community fitness. Fast and Elitist Multi-objective Genetic Algorithm is used to attained a set of optimal solutions, and then use Modularity function to choose the best one from them. The locus based adjacency representation is used to realize genetic representation, which ensures the effective connections of the nodes in the network during the process of population Initialization and other genetic operator. Uniform crossover is introduced to ensure population’s diversity. We compared it with some popular community detection algorithms in computer generated network and real world networks. Experiment results show that it is more efficient in community detection.
Read moreLICOD: A Leader-driven algorithm for community detection in complex networks
Leader-driven community detection algorithms (LdCD hereafter) constitute a new trend in devising algorithms for community detection in large-scale complex networks. The basic idea is to identify some particular nodes in the target network, called leader nodes , around which local communities can be computed. Being based on local computations, they are particularly attractive to handle large-scale networks. In this paper, we describe a framework for implementing LdCD algorithms, called LICOD. We propose also a new way for evaluating performances of community detection algorithms. This consists on transforming data clustering problems into a community detection problems. External criteria for evaluating obtained clusters can then be used for comparing performances of different community detection approaches. Results we obtain show that our approach outperforms top state of the art algorithms for community detection in complex networks.
Read moreCommunity Detection in Complex Networks
With the rapidly growing evidence that various systems in nature and society can be modeled as complex networks, community detection in networks becomes a hot research topic in physics, sociology, computer society, etc. Although this investigation of community structures has motivated many diverse algorithms, most of them are unsuitable when dealing with large networks due to their computational cost. In this paper, we present a faster algorithm ComTector, which is more efficient for the community detection in large complex networks based on the nature of overlapping cliques. This algorithm does not require any priori knowledge about the number or the original division of the communities. With respect to practical applications, ComTector is challenging with five different types of networks including the classic Zachary Karate Club, Scientific Collaboration Network, South Florida Free Word Association Network, Urban Traffic Network, North America Power Grid and the Telecommunication Call Network. Experimental results show that our algorithm can discover meaningful communities that meet both the objective basis and our intuitions.
Read moreA parallel multi-objective evolutionary algorithm for community detection in large-scale complex networks
A parallel multi-objective evolutionary algorithm for community detection in large-scale complex networks
Overlapping community detection in complex networks using multi-objective evolutionary algorithm
Community structure is an important topological property of complex networks, which has great significance for understanding the function and organization of networks. Generally, community detection can be formulated as a single-objective or multi-objective optimization problem. Most existing optimization-based community detection algorithms are only applicable to disjoint community structure. However, it has been shown that in most real-world networks, a node may belong to multiple communities implying overlapping community structure. In this paper, we propose a multi-objective evolutionary algorithm for identifying overlapping community structure in complex networks based on the framework of non-dominated sorting genetic algorithm. Two negatively correlated evaluation metrics of community structure, termed as negative fitness sum and unfitness sum, are adopted as the optimization objectives. In our algorithm, link-based adjacency representation of overlapping community structure and a population initialization method based on local expansion are proposed. Extensive experimental results on both synthetic and real-world networks demonstrate that the proposed algorithm is effective and promising in detecting overlapping community structure in complex networks.
Read more