A Novel Algorithm for Community Detection in Networks using Rough Sets and Consensus Clustering
- URL: http://arxiv.org/abs/2406.12412v1
- Date: Tue, 18 Jun 2024 09:01:21 GMT
- Title: A Novel Algorithm for Community Detection in Networks using Rough Sets and Consensus Clustering
- Authors: Darian H. Grass-Boada, Leandro González-Montesino, Rubén Armañanzas,
- Abstract summary: Complex networks, such as those in social, biological, and technological systems, often present challenges to the task of community detection.
Our research introduces a novel rough clustering based consensus community framework (RC-CCD) for effective structure identification of network communities.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Complex networks, such as those in social, biological, and technological systems, often present challenges to the task of community detection. Our research introduces a novel rough clustering based consensus community framework (RC-CCD) for effective structure identification of network communities. The RC-CCD method employs rough set theory to handle uncertainties within data and utilizes a consensus clustering approach to aggregate multiple clustering results, enhancing the reliability and accuracy of community detection. This integration allows the RC-CCD to effectively manage overlapping communities, which are often present in complex networks. This approach excels at detecting overlapping communities, offering a detailed and accurate representation of network structures. Comprehensive testing on benchmark networks generated by the Lancichinetti-Fortunato-Radicchi method showcased the strength and adaptability of the new proposal to varying node degrees and community sizes. Cross-comparisons of RC-CCD versus other well known detection algorithms outcomes highlighted its stability and adaptability.
Related papers
- Learning Persistent Community Structures in Dynamic Networks via
Topological Data Analysis [2.615648035076649]
We propose a novel deep graph clustering framework with temporal consistency regularization on inter-community structures.
MFC is a matrix factorization-based deep graph clustering algorithm that preserves node embedding.
TopoReg is introduced to ensure the preservation of topological similarity between inter-community structures over time intervals.
arXiv Detail & Related papers (2024-01-06T11:29:19Z) - A Unified Framework for Exploratory Learning-Aided Community Detection
Under Topological Uncertainty [16.280950663982107]
META-CODE is a unified framework for detecting overlapping communities in social networks.
It consists of three steps: 1) node-level community-affiliation embeddings based on graph neural networks (GNNs) trained by our new reconstruction loss, 2) network exploration via community-affiliation-based node queries, and 3) network inference using an edge connectivity-based Siamese neural network model from the explored network.
arXiv Detail & Related papers (2023-04-10T10:22:21Z) - Implicit models, latent compression, intrinsic biases, and cheap lunches
in community detection [0.0]
Community detection aims to partition a network into clusters of nodes to summarize its large-scale structure.
Some community detection methods are inferential, explicitly deriving the clustering objective through a probabilistic generative model.
Other methods are descriptive, dividing a network according to an objective motivated by a particular application.
We present a solution that associates any community detection objective, inferential or descriptive, with its corresponding implicit network generative model.
arXiv Detail & Related papers (2022-10-17T15:38:41Z) - META-CODE: Community Detection via Exploratory Learning in Topologically
Unknown Networks [5.299515147443958]
META-CODE is an end-to-end solution for detecting overlapping communities in networks with unknown topology.
It consists of three steps: 1) initial network inference, 2) node-level community-affiliation embedding based on graph neural networks (GNNs) trained by our new reconstruction loss, and 3) network exploration via community-affiliation-based node queries.
arXiv Detail & Related papers (2022-08-23T15:02:48Z) - Unsupervised Clustered Federated Learning in Complex Multi-source
Acoustic Environments [75.8001929811943]
We introduce a realistic and challenging, multi-source and multi-room acoustic environment.
We present an improved clustering control strategy that takes into account the variability of the acoustic scene.
The proposed approach is optimized using clustering-based measures and validated via a network-wide classification task.
arXiv Detail & Related papers (2021-06-07T14:51:39Z) - A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
A community reveals the features and connections of its members that are different from those in other communities in a network.
This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods.
The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
arXiv Detail & Related papers (2021-05-26T14:37:07Z) - A multilevel clustering technique for community detection [0.0]
This study presents a novel detection method based on a scalable framework to identify related communities in a network.
We propose a multilevel clustering technique (MCT) that leverages structural and textual information to identify local communities termed microcosms.
The approach offers a better understanding and clarity toward describing how low-level communities evolve and behave on Twitter.
arXiv Detail & Related papers (2021-01-16T23:26:44Z) - A Survey of Community Detection Approaches: From Statistical Modeling to
Deep Learning [95.27249880156256]
We develop and present a unified architecture of network community-finding methods.
We introduce a new taxonomy that divides the existing methods into two categories, namely probabilistic graphical model and deep learning.
We conclude with discussions of the challenges of the field and suggestions of possible directions for future research.
arXiv Detail & Related papers (2021-01-03T02:32:45Z) - On the use of local structural properties for improving the efficiency
of hierarchical community detection methods [77.34726150561087]
We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection.
We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
arXiv Detail & Related papers (2020-09-15T00:16:12Z) - Cross-Attention in Coupled Unmixing Nets for Unsupervised Hyperspectral
Super-Resolution [79.97180849505294]
We propose a novel coupled unmixing network with a cross-attention mechanism, CUCaNet, to enhance the spatial resolution of HSI.
Experiments are conducted on three widely-used HS-MS datasets in comparison with state-of-the-art HSI-SR models.
arXiv Detail & Related papers (2020-07-10T08:08:20Z) - Detecting Communities in Heterogeneous Multi-Relational Networks:A
Message Passing based Approach [89.19237792558687]
Community is a common characteristic of networks including social networks, biological networks, computer and information networks.
We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
arXiv Detail & Related papers (2020-04-06T17:36:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.