Community Detection Approach Research Articles

Bird flock effect-based dynamic community detection: Unravelling network patterns over time

Community structure is essential for topological analysis, function study, and pattern detection in complex networks. As establishing community structure in a dynamic network is difficult, it gives a unique perspective in many interdisciplinary fields. Many researchers have explored the challenging technique that requires parameter specification and optimization for quality result. This study proposed an eco-system conceptual framework based on bird flock effect. Relying on the natural law of rule, we designed a dynamic community detection named DCDBFE. The design of algorithm was based on the three basic rules of bird flock: separation, alignment, and cohesion phase. Then, we provide an explanation of similarity measure used between vertices to identify the modules attraction. DCDBFE employs an incremental community detection approach to repeatedly detect communities in each network snapshot or time step. The contributions are obtained for high quality community detected, free-parameter and well stability. To test its performance, extensive experiments were conducted on both synthetic and real-world networks. The outcomes demonstrate that our approach can effectively find satisfaction from each time step by comparison with the other well-known algorithms.

An integrative network-based approach to identify driving gene communities in chronic obstructive pulmonary disease

Chronic obstructive pulmonary disease (COPD) is an etiologically complex disease characterized by acute exacerbations and stable phases. We aimed to identify biological functions modulated in specific COPD conditions, using whole blood samples collected in the AERIS clinical study (NCT01360398). Considered conditions were exacerbation onset, severity of airway obstruction, and presence of respiratory pathogens in sputum samples. With an integrative multi-network gene community detection (MNGCD) approach, we analyzed expression profiles to identify communities of correlated genes. The approach combined different layers of gene interactions for each explored condition/subset of samples: gene expression similarity, protein-protein interactions, transcription factors, and microRNAs validated regulons. Heme metabolism, interferon-alpha, and interferon-gamma pathways were modulated in patients at both exacerbation and stable-state visits, but with the involvement of distinct sets of genes. An important gene community was enriched with G2M checkpoint, E2F targets, and mitotic spindle pathways during exacerbation. Targets of TAL1 regulator and hsa−let−7b − 5p microRNA were modulated with increasing severity of airway obstruction. Bacterial infections with Moraxella catarrhalis and, particularly, Haemophilus influenzae triggered a specific cellular and inflammatory response in acute exacerbations, indicating an active reaction of the host to infections. In conclusion, COPD is a complex multifactorial disease that requires in-depth investigations of its causes and features during its evolution and whole blood transcriptome profiling can contribute to capturing some relevant regulatory mechanisms associated with this disease. In this work, we explored multi-network modeling that integrated diverse layers of regulatory gene networks and enhanced our comprehension of the biological functions implicated in the COPD pathogenesis.

Multi-agent distributed control of integrated process networks using an adaptive community detection approach

This paper focuses on developing an adaptive system decomposition approach for multi-agent distributed model predictive control (DMPC) of integrated process networks. The proposed system decomposition employs a refined spectral community detection method to construct an optimal distributed control framework based on the weighted graph representation of the state space process model. The resulting distributed architecture assigns controlled outputs and manipulated inputs to controller agents and delineates their interactions. The decomposition evolves as the process network undergoes various operating conditions, enabling adjustments in the distributed architecture and DMPC design. This adaptive architecture enhances the closed-loop performance and robustness of DMPC systems. The effectiveness of the multi-agent distributed control approach is investigated for a benchmark benzene alkylation process under two distinct operating conditions characterized by medium and low recycle ratios. Simulation results demonstrate that adaptive decompositions derived through spectral community detection, utilizing weighted graph representations, outperform the commonly employed unweighted hierarchical community detection-based system decompositions in terms of closed-loop performance and computational efficiency.

Influence detection in dynamic networks: a novel overlapping community detection approach applied to COVID-19 spread analysis in India

Influence detection in dynamic networks: a novel overlapping community detection approach applied to COVID-19 spread analysis in India

K-plex-based community detection with graph neural networks

Community detection is an effective way to determine the structure and characteristics of a complex network. With the expansion of the network scale, traditional community detection approaches such as modularity-based optimization models face new challenges related to representing and learning the topological structure and node attributes from a large scale complex network. Moreover, in many practical applications, there is little knowledge about label information or the number of communities, which greatly limits the performance of existing supervised or semi-supervised community detection approaches. To solve these problems, in this paper, we propose a graph neural network-based unsupervised community detection approach, which first applies the k-plex to generate the community seeds, then uses a node sampling algorithm to reduce the network complexity, and finally constructs a graph neural network model to learn the relationships of the network nodes and assign the nodes to different communities. Extensive empirical studies on various scale networks demonstrate both the effectiveness and efficiency of the proposed approach. Our codes are available at https://github.com/lol12854/KPGN.

Community detection in social networks using machine learning: a systematic mapping study

AbstractOne of the important issues in social networks is the social communities which are formed by interactions between its members. Three types of community including overlapping, non-overlapping, and hidden are detected by different approaches. Regarding the importance of community detection in social networks, this paper provides a systematic mapping of machine learning-based community detection approaches. The study aimed to show the type of communities in social networks along with the algorithms of machine learning that have been used for community detection. After carrying out the steps of mapping and removing useless references, 246 papers were selected to answer the questions of this research. The results of the research indicated that unsupervised machine learning-based algorithms with 41.46% (such as k means) are the most used categories to detect communities in social networks due to their low processing overheads. On the other hand, there has been a significant increase in the use of deep learning since 2020 which has sufficient performance for community detection in large-volume data. With regard to the ability of NMI to measure the correlation or similarity between communities, with 53.25%, it is the most frequently used metric to evaluate the performance of community identifications. Furthermore, considering availability, low in size, and lack of multiple edge and loops, dataset Zachary’s Karate Club with 26.42% is the most used dataset for community detection research in social networks.

A comprehensive view of community detection approaches in multilayer social networks

A comprehensive view of community detection approaches in multilayer social networks

Comparative study of kinship network community detection approaches

This study employs five community detection methods on a rooted tree network with 600 nodes and 599 edges based on the Galo tribe’s kin naming system in Arunachal Pradesh, India. The network was originally assumed to be made up of three communities, which the algorithms were able to further divide into smaller groupings. The Louvain approach produced the most balanced distribution of community sizes, with skewness and kurtosis values close to zero, implying that the detected communities were reasonably evenly distributed in size and without major outliers. However, the Louvain algorithm found 25 communities, which is more than the network’s previously reported three communities. Further investigation may be required to integrate some of these communities in order to obtain the original known communities. Overall, this study highlights the importance of selecting an appropriate community detection algorithm for a given network and research question.

Exploring over a decade of systems engineering research center: A community detection and text analytics approach

AbstractThe Systems Engineering Research Center (SERC) is a University Affiliated Research Center (UARC) of the US Department of Defense (DoD) formed in 2008 with more than 20 collaborator universities in the United States. Over the last decade, SERC has conducted research with Principal Investigators from universities within the SERC network, as reflected in technical reports (TR). These reports describe detailed information and analysis of the conducted research for every project under SERC support, such as written records of experiments or results of a scientific project. We analyzed the TRs from 2009 to early 2023 to identify research streams, topics, and evolution in systems engineering (SE) research using text mining and network analysis techniques, such as Louvain Community Detection and word similarity. As a result, we identified four major research streams over a decade of research projects, along with insights about topics and the evolution of SE within this time frame. Finally, we distinguished most profile authors and their most significant collaborations and networks.

Dual-learning Multi-hop Nonnegative Matrix Factorization for community detection

As an important branch of network science, community detection has garnered significant attention. Among various community detection methods, nonnegative matrix factorization (NMF)-based community detection approaches have become a popular research topic. However, most NMF-based methods overlook the network’s multi-hop information, let alone the community detection results specific to each hop of the network. In this paper, we propose Dual-learning Multi-hop NMF (DL-MHNMF), a method that considers not only the multi-hop connectivity between two nodes but also factors in the shared results across multiple hops and the impact of differences in the specific results at each hop on the shared outcomes. An efficient iterative optimization algorithm with guaranteed theoretical convergence is proposed for solving DL-MHNMF. Methodologically, by iteratively removing the specific results during the optimization process of DL-MHNMF, we achieve enhanced detection accuracy, which is also verified by subsequent experiments. Specifically, we compare fourteen algorithms on eleven publicly available datasets, and experimental results show that our algorithm outperforms most state-of-the-art methods. The source code is availiable at https://github.com/bx20000827/DL-MHNMF.git.

Brain Network Alterations in Chronic Spinal Cord Injury: Multilayer Community Detection Approach

Brain Network Alterations in Chronic Spinal Cord Injury: Multilayer Community Detection Approach

A nonnegative Gumbel-based encoder–decoder approach for community detection

A nonnegative Gumbel-based encoder–decoder approach for community detection

Community Detection in Multiplex Networks Using Orthogonal Non-Negative Matrix Tri-Factorization Based on Graph Regularization and Diversity

In recent years, community detection has received increasing interest. In network analysis, community detection refers to the identification of tightly connected subsets of nodes, which are called “communities” or “groups”, in the network. Non-negative matrix factorization models are often used to solve the problem. Orthogonal non-negative matrix tri-factorization (ONMTF) exhibits significant potential as an approach for community detection within multiplex networks. This paper explores the application of ONMTF in multiplex networks, aiming to detect both shared and exclusive communities simultaneously. The model decomposes each layer within the multiplex network into two low-rank matrices. One matrix corresponds to shared communities across all layers, and the other to unique communities within each layer. Additionally, graph regularization and the diversity of private communities are taken into account in the algorithm. The Hilbert Schmidt Independence Criterion (HSIC) is used to constrain the independence of private communities. The results prove that ONMTF effectively addresses community detection in multiplex networks. It also offers strong interpretability and feature extraction capabilities. Therefore, it is an advanced method for community detection in multiplex networks.

Unveiling public perception of AI ethics: an exploration on Wikipedia data

Artificial Intelligence (AI) technologies have exposed more and more ethical issues while providing services to people. It is challenging for people to realize the occurrence of AI ethical issues in most cases. The lower the public awareness, the more difficult it is to address AI ethical issues. Many previous studies have explored public reactions and opinions on AI ethical issues through questionnaires and social media platforms like Twitter. However, these approaches primarily focus on categorizing popular topics and sentiments, overlooking the public’s potential lack of knowledge underlying these issues. Few studies revealed the holistic knowledge structure of AI ethical topics and the relations among the subtopics. As the world’s largest online encyclopedia, Wikipedia encourages people to jointly contribute and share their knowledge by adding new topics and following a well-accepted hierarchical structure. Through public viewing and editing, Wikipedia serves as a proxy for knowledge transmission. This study aims to analyze how the public comprehend the body of knowledge of AI ethics. We adopted the community detection approach to identify the hierarchical community of the AI ethical topics, and further extracted the AI ethics-related entities, which are proper nouns, organizations, and persons. The findings reveal that the primary topics at the top-level community, most pertinent to AI ethics, predominantly revolve around knowledge-based and ethical issues. Examples include transitions from Information Theory to Internet Copyright Infringement. In summary, this study contributes to three points, (1) to present the holistic knowledge structure of AI ethics, (2) to evaluate and improve the existing body of knowledge of AI ethics, (3) to enhance public perception of AI ethics to mitigate the risks associated with AI technologies.

Community Detection Methods Based on Exploiting Attributes and Interactions on Social Networks: A Survey and Future Directions

In recent years, community detection in social network analysis has been a hot research topic that has attracted much more attention in the scientific community and a large number of articles have already been published in the literature. Community detection problems focus on determining the subgraphs of the network that have dense edges and whose nodes are expected to have similar features. Community detection has significant applications in different domains of social network analysis such as sociology, business, criminal detection and recommendation systems. The computational complexity is hampered by the huge size and the dynamic nature of social networks. This paper introduces a comprehensive survey of community detection methods in social networks based on mining attributes and interactions of users. We divide the community detection approaches into three basic categories, namely (1) node content-based approaches, (2) edge content-based approaches, and (3) node- and edge content-based approaches. We also discuss in detail the main idea of each method that is suitable for social network data. Furthermore, to promote the study of community detection, we introduce the benchmark datasets from available sources. Last, we present further research directions as well as some open challenges for the community detection problem in social networks.

A motif-based probabilistic approach for community detection in complex networks

Community detection in complex networks is an important task for discovering hidden information in network analysis. Neighborhood density between nodes is one of the fundamental indicators of community presence in the network. A community with a high edge density will have correlations between nodes that extend beyond their immediate neighbors, denoted by motifs. Motifs are repetitive patterns of edges observed with high frequency in the network. We proposed the PCDMS method (Probabilistic Community Detection with Motif Structure) that detects communities by estimating the triangular motif in the network. This study employs structural density between nodes, a key concept in graph analysis. The proposed model has the advantage of using a probabilistic generative model that calculates the latent parameters of the probabilistic model and determines the community based on the likelihood of triangular motifs. The relationship between observing two pairs of nodes in multiple communities leads to an increasing likelihood estimation of the existence of a motif structure between them. The output of the proposed model is the intensity of each node in the communities. The efficiency and validity of the proposed method are evaluated through experimental work on both synthetic and real-world networks; the findings will show that the community identified by the proposed method is more accurate and dense than other algorithms with modularity, NMI, and F1score evaluation metrics.

Investigating the network structure and causal relationships among bridge symptoms of comorbid depression and anxiety: A Bayesian network analysis.

The network analysis method emphasizes the interaction between individual symptoms to identify shared or bridging symptoms between depression and anxiety to understand comorbidity. However, the network analysis and community detection approach have limitations in identifying causal relationships among symptoms. This study aims to address this gap by applying Bayesian network (BN) analysis to investigate potential causal relationships. Data were collected from a sample of newly enrolled college students. The network structure of depression and anxiety was estimated using the Patient Health Questionnaire-9 (PHQ-9) and the Generalized Anxiety Disorder (GAD-7) Scale measures, respectively. Shared symptoms between depression and anxiety were identified through network analysis and clique percolation (CP) method. The causal relationships among symptoms were estimated using BN. The strongest bridge symptoms, as indicated by bridge strength, include sad mood (PHQ2), motor (PHQ8), suicide (PHQ9), restlessness (GAD5), and irritability (GAD6). These bridge symptoms formed a distinct community using the CP algorithm. Sad mood (PHQ2) played an activating role, influencing other symptoms. Meanwhile, restlessness (GAD5) played a mediating role with reciprocal influences on both anxiety and depression symptoms. Motor (PHQ8), suicide (PHQ9), and irritability (GAD6) assumed recipient positions. BN analysis presents a valuable approach for investigating the complex interplay between symptoms in the context of comorbid depression and anxiety. It identifies two activating symptoms (i.e., sadness and worry), which serve to underscore the fundamental differences between these two disorders. Additionally, psychomotor symptoms and suicidal ideations are recognized as recipient roles, being influenced by other symptoms within the network.

Discrete-Time Quantum Walks Community Detection in Multi-Domain Networks

Abstract The problem of detecting communities in real-world networks has been extensively studied in the past, but most of the existing approaches work on single-domain networks, i.e. they consider only one type of relationship between nodes. Single-domain networks may contain noisy edges and they may lack some important information. Thus, some authors have proposed to consider the multiple relationships that connect the nodes of a network, thus obtaining multi-domain networks. However, most community detection approaches are limited to multi-layer networks, i.e. networks generated from the superposition of several single-domain networks (called layers) that are regarded as independent of each other. In addition to being computationally expensive, multi-layer approaches might yield inaccurate results because they ignore potential dependencies between layers. This paper proposes a multi-domain discrete-time quantum walks (MDQW) model for multi-domain networks. First, the walking space of network nodes in multi-domain network is constructed. Second, the quantum permutation circuit of the coin state is designed based on the coded particle state. Then, using different coin states, the shift operator performs several quantum walks on the particles. Finally, the corresponding update rule is selected to move the node according to the measurement result of the quantum state. With continuous update iteration, the shift operator automatically optimizes the discovered community structure. We experimentally compared our MDQW method with four state-of-the-art competitors on five real datasets. We used the normalized mutual information (NMI) to compare clustering quality, and we report an increase in NMI of up to 3.51 of our MDQW method in comparison with the second-best performing competitor. The MDQW method is much faster than its competitors, allowing us to conclude that MDQW is a useful tool in the analysis of large real-life multi-domain networks. Finally, we illustrate the usefulness of our approach on two real-world case studies.

Retracted: An Effective Approach for Modular Community Detection in Bipartite Network Based on Integrating Rider with Harris Hawks Optimization Algorithms

Retracted: An Effective Approach for Modular Community Detection in Bipartite Network Based on Integrating Rider with Harris Hawks Optimization Algorithms

Improving modularity score of community detection using memetic algorithms

<abstract> <p>With the growth of online networks, understanding the intricate structure of communities has become vital. Traditional community detection algorithms, while effective to an extent, often fall short in complex systems. This study introduced a meta-heuristic approach for community detection that leveraged a memetic algorithm, combining genetic algorithms (GA) with the stochastic hill climbing (SHC) algorithm as a local optimization method to enhance modularity scores, which was a measure of the strength of community structure within a network. We conducted comprehensive experiments on five social network datasets (Zachary's Karate Club, Dolphin Social Network, Books About U.S. Politics, American College Football, and the Jazz Club Dataset). Also, we executed an ablation study based on modularity and convergence speed to determine the efficiency of local search. Our method outperformed other GA-based community detection methods, delivering higher maximum and average modularity scores, indicative of a superior detection of community structures. The effectiveness of local search was notable in its ability to accelerate convergence toward the global optimum. Our results not only demonstrated the algorithm's robustness across different network complexities but also underscored the significance of local search in achieving consistent and reliable modularity scores in community detection.</p> </abstract>