A classification for community discovery methods in complex networks
From MaRDI portal
Publication:4969805
DOI10.1002/sam.10133OpenAlexW3123041312MaRDI QIDQ4969805
Michele Coscia, Fosca Giannotti, Dino Pedreschi
Publication date: 14 October 2020
Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3552
groupsgraph partitioningsocial networkcomplex networkgraph clusteringcommunity discoverygraph mininginformation propagation
Related Items (18)
Dual-channel hybrid community detection in attributed networks ⋮ Complete graph model for community detection ⋮ Structure-oriented prediction in complex networks ⋮ Validation of community robustness ⋮ A link-based similarity for improving community detection based on label propagation algorithm ⋮ Information diffusion-aware likelihood maximization optimization for community detection ⋮ A modularity degree based heuristic community detection algorithm ⋮ Local community detection in complex networks based on maximum cliques extension ⋮ On the analysis of fitness change: fitness-popularity dynamic network model with varying fitness ⋮ Network community detection on metric space ⋮ Arbitrary Overlap Constraints in Graph Packing Problems ⋮ Clustering and community detection in directed networks: a survey ⋮ Community detection in node-attributed social networks: a survey ⋮ Topological aspects of the multi-language phases of the naming game on community-based networks ⋮ Detecting and refining overlapping regions in complex networks with three-way decisions ⋮ On the effects of capability and popularity on network dynamics with applications to YouTube and Twitch networks ⋮ Scalable module detection for attributed networks with applications to breast cancer ⋮ THE POWER FUNCTION HIDDEN IN THE VULNERABILITY OF FRACTAL COMPLEX NETWORKS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Tensor Decompositions and Applications
- Graph clustering
- Isolation concepts for efficiently enumerating dense subgraphs
- Modularity-maximizing graph communities via mathematical programming
- Modeling by shortest data description
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Enumeration of isolated cliques and pseudo-cliques
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Mixed membership stochastic blockmodels
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- A Kronecker product approximate preconditioner for SANs
- Mixture models and exploratory analysis in networks
- Communities in Networks
- Finding Groups in Data
- An Efficient Heuristic Procedure for Partitioning Graphs
- The Structure and Function of Complex Networks
- Latent Space Approaches to Social Network Analysis
- Community structure in social and biological networks
- Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
- 10.1162/jmlr.2003.3.4-5.993
- Stochastic Blockmodels for Directed Graphs
- Finding overlapping communities in networks by label propagation
- Clustering of sparse data via network communities—a prototype study of a large online market
- Fast unfolding of communities in large networks
- Computing Communities in Large Networks Using Random Walks
- Indirect Blockmodeling of 3-Way Networks
- Collective dynamics of ‘small-world’ networks
- Discovery Science
- Algorithms – ESA 2005
- Canonical analysis of several sets of variables
- Algorithm 457: finding all cliques of an undirected graph
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: A classification for community discovery methods in complex networks
