Enhancing community detection using a network weighting strategy
From MaRDI portal
Abstract: A community within a network is a group of vertices densely connected to each other but less connected to the vertices outside. The problem of detecting communities in large networks plays a key role in a wide range of research areas, e.g. Computer Science, Biology and Sociology. Most of the existing algorithms to find communities count on the topological features of the network and often do not scale well on large, real-life instances. In this article we propose a strategy to enhance existing community detection algorithms by adding a pre-processing step in which edges are weighted according to their centrality w.r.t. the network topology. In our approach, the centrality of an edge reflects its contribute to making arbitrary graph tranversals, i.e., spreading messages over the network, as short as possible. Our strategy is able to effectively complements information about network topology and it can be used as an additional tool to enhance community detection. The computation of edge centralities is carried out by performing multiple random walks of bounded length on the network. Our method makes the computation of edge centralities feasible also on large-scale networks. It has been tested in conjunction with three state-of-the-art community detection algorithms, namely the Louvain method, COPRA and OSLOM. Experimental results show that our method raises the accuracy of existing algorithms both on synthetic and real-life datasets.
Recommendations
- Enhancing community detection by using local structural information
- scientific article; zbMATH DE number 6907813
- Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks
- Quantitative measure for community detection in weighted networks
- Centrality based community discovery
Cited in
(23)- An improved multi-objective evolutionary algorithm for simultaneously detecting separated and overlapping communities
- Maximizing modularity intensity for community partition and evolution
- Detecting and refining overlapping regions in complex networks with three-way decisions
- A new method for quantifying network cyclic structure to improve community detection
- Anti-modularity and anti-community detecting in complex networks
- Community detection with the weighted parsimony criterion
- Mixing local and global information for community detection in large networks
- Efficient modularity density heuristics for large graphs
- Enhancing community detection by using local structural information
- Finding weighted \(k\)-truss communities in large networks
- Traveling salesman problems with PageRank distance on complex networks reveal community structure
- scientific article; zbMATH DE number 6907813 (Why is no real title available?)
- scientific article; zbMATH DE number 6982944 (Why is no real title available?)
- Unified robust network embedding framework for community detection via extreme adversarial attacks
- Branching processes reveal influential nodes in social networks
- Imbalance problem in community detection
- Centrality based community discovery
- Community enhancement network embedding based on edge reweighting preprocessing
- Differentiated graph regularized non-negative matrix factorization for semi-supervised community detection
- A framework of mapping undirected to directed graphs for community detection
- Game of thieves and WERW-Kpath: two novel measures of node and edge centrality for mafia networks
- Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure
- Visualizing network communities with a semi-definite programming method
This page was built for publication: Enhancing community detection using a network weighting strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2510497)
