Detecting network communities: a new systematic and efficient algorithm
From MaRDI portal
Abstract: An efficient and relatively fast algorithm for the detection of communities in complex networks is introduced. The method exploits spectral properties of the graph Laplacian-matrix combined with hierarchical-clustering techniques, and includes a procedure to maximize the ``modularity of the output. Its performance is compared with that of other existing methods, as applied to different well-known instances of complex networks with a community-structure: both computer-generated and from the real-world. Our results are in all the tested cases, at least, as good as the best ones obtained with any other methods, and faster in most of the cases than methods providing similar-quality results. This converts the algorithm in a valuable computational tool for detecting and analyzing communities and modular structures in complex networks.
Recommendations
- Finding community structure in networks using a shortest-path-based k-means algorithm
- Fast unfolding of communities in large networks
- Algorithms and Models for the Web-Graph
- A constrained power method for community detection in complex networks
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering
Cited in
(93)- Mixing local and global information for community detection in large networks
- An efficient community detection algorithm using greedy surprise maximization
- A clustering algorithm of a complex network based on a transition matrix P
- Community detection algorithm based on effective resistance of network
- Community detection in networks via a spectral heuristic based on the clustering coefficient
- Traversing a graph for identifying communities
- A spectral clustering-based framework for detecting community structures in complex networks
- EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks
- An automatic clustering algorithm for complex networks based on local agglomeration
- Community Finding of Scale-Free Network: Algorithm and Evaluation Criterion
- Mapping higher-order network flows in memory and multilayer networks with Infomap
- Spectral based hypothesis testing for community detection in complex networks
- Synchronization processes in complex networks
- Detecting communities under constraints in directed acyclic networks
- A DC Programming Approach for Finding Communities in Networks
- Network community detection on metric space
- On detecting maximal quasi antagonistic communities in signed graphs
- Fusing data depth with complex networks: community detection with prior information
- Application of complex networks theory in urban traffic network researches
- Community detection by using the extended modularity
- A fast approach to the detection of all-purpose hubs in complex networks with chemical applications
- An algorithm J-SC of detecting communities in complex networks
- Evolutionary algorithm and modularity for detecting communities in networks
- An improved algorithm for generalized community structure inference in complex networks
- Fast community detection in complex networks with a \(K\)-depths classifier
- Cluster synchronisation of directed complex dynamical networks with nonidentical nodes via pinning control
- A density set algorithm for searching communities in complex networks
- A genetic algorithm for detecting communities in large-scale complex networks
- A linear community detection algorithm based on dynamical system in networks
- Community structure of complex networks. Based on the author's thesis
- Visualizing network communities with a semi-definite programming method
- A combinatorial model and algorithm for globally searching community structure in complex networks
- Finding network communities using random walkers with improved accuracy
- Enhancing community detection by using local structural information
- On the complexity of Newman's community finding approach for biological and social networks
- Synwalk: community detection via random walk modelling
- A spectral method to detect community structure based on distance modularity matrix
- Asymptotic distribution of modularity in networks
- Bloggers behavior and emergent communities in blog space
- A community detection algorithm based on cover
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Information dynamics algorithm for detecting communities in networks
- Self-organizing map of complex networks for community detection
- A fast and efficient algorithm to identify clusters in networks
- Community discovery algorithms: an overview
- Partition network into communities based on group action on sets
- A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks
- Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks
- A simple and efficient algorithm for modeling modular complex networks
- Importance of numerical implementation and clustering analysis in force-directed algorithms for accurate community detection
- A divide-and-link algorithm for hierarchical clustering in networks
- IDENTIFICATION OF COMMUNITY STRUCTURE IN COMPLEX NETWORKS USING AFFINITY PROPAGATION CLUSTERING METHOD
- A divisive spectral method for network community detection
- Important-node-based community detection algorithm
- Defining and identifying cograph communities in complex networks
- Effective semisupervised community detection using negative information
- Post-processing hierarchical community structures: quality improvements and multi-scale view
- Robustness of community structure to node removal
- Community detection based on significance optimization in complex networks
- Force-based incremental algorithm for mining community structure in dynamic network
- Community structure in social and biological networks
- Detecting community structure in directed networks via multiple eigenvectors
- Detect local communities in networks with an outside rate coefficient
- Overlapping community detection using a generative model for networks
- Find Your Place: Simple Distributed Algorithms for Community Detection
- scientific article; zbMATH DE number 7234180 (Why is no real title available?)
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Fast multi-scale detection of overlapping communities using local criteria
- Detecting the Structure of Social Networks Using (α,β)-Communities
- A hybrid artificial immune network for detecting communities in complex networks
- Fast and accurate determination of modularity and its effect size
- Complex network community detection based on core graph incremental clustering
- Group detection in complex networks: an algorithm and comparison of the state of the art
- A genetic algorithm with local search for community detection in large-scale complex networks
- Community detection with cellular automata
- Graph clustering
- Overlapping modularity at the critical point of \(k\)-clique percolation
- Community detection based on network communicability
- COMMUNITY FINDING IN COMPLEX NETWORKS
- Complex network clustering algorithms
- Fast unfolding of communities in large networks
- Finding community structure in networks using a shortest-path-based k-means algorithm
- Chimera state and route to explosive synchronization
- Hierarchical Community Detection by Recursive Partitioning
- A Random Network Ensemble Model Based Generalized Network Community Mining Algorithm
- Complex networks for community detection of basketball players
- Community detection by resistance distance: automation and benchmark testing
- A vector partitioning approach to detecting community structure in complex networks
- Parallel label propagation algorithm based on weight and random walk
- A framework for detecting communities of unbalanced sizes in networks
- Scaling laws for diffusion on (trans)fractal scale-free networks
- A modularity degree based heuristic community detection algorithm
- A constrained power method for community detection in complex networks
This page was built for publication: Detecting network communities: a new systematic and efficient algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3160109)
