A classification for community discovery methods in complex networks
From MaRDI portal
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
- A Kronecker product approximate preconditioner for SANs
- Algorithm 457: finding all cliques of an undirected graph
- Algorithms – ESA 2005
- An Efficient Heuristic Procedure for Partitioning Graphs
- Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
- Canonical analysis of several sets of variables
- Clique relaxations in social network analysis: the maximum k-plex problem
- Clustering of sparse data via network communities -- a prototype study of a large online market
- Clustering with Bregman divergences.
- Collective dynamics of `small-world' networks
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Communities in Networks
- Community structure in social and biological networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Computing Communities in Large Networks Using Random Walks
- Discovery Science
- Enumeration of isolated cliques and pseudo-cliques
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Fast unfolding of communities in large networks
- Finding Groups in Data
- Finding overlapping communities in networks by label propagation
- Graph clustering
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 425869 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1222283 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- Indirect Blockmodeling of 3-Way Networks
- Isolation concepts for efficiently enumerating dense subgraphs
- Large margin methods for structured and interdependent output variables
- Latent Space Approaches to Social Network Analysis
- Mixed membership stochastic blockmodels
- Mixture models and exploratory analysis in networks
- Modeling by shortest data description
- Modularity-maximizing graph communities via mathematical programming
- Optimization by simulated annealing
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Stochastic Blockmodels for Directed Graphs
- Tensor Decompositions and Applications
- The elements of statistical learning. Data mining, inference, and prediction
- The Structure and Function of Complex Networks
Cited in
(26)- Complete graph model for community detection
- Structure-oriented prediction in complex networks
- Validation of community robustness
- A modularity degree based heuristic community detection algorithm
- Local community detection in complex networks based on maximum cliques extension
- Network community detection on metric space
- Community detection in node-attributed social networks: a survey
- On the effects of capability and popularity on network dynamics with applications to YouTube and Twitch networks
- Dual-channel hybrid community detection in attributed networks
- Detecting and refining overlapping regions in complex networks with three-way decisions
- A link-based similarity for improving community detection based on label propagation algorithm
- Formalising and detecting community structures in real world complex networks
- Classification of vertices on social networks by multiple approaches
- Arbitrary overlap constraints in graph packing problems
- THE POWER FUNCTION HIDDEN IN THE VULNERABILITY OF FRACTAL COMPLEX NETWORKS
- On the analysis of fitness change: fitness-popularity dynamic network model with varying fitness
- Clustering and community detection in directed networks: a survey
- Scalable module detection for attributed networks with applications to breast cancer
- Information diffusion-aware likelihood maximization optimization for community detection
- Extremal properties of evolving networks: local dependence and heavy tails
- Identifying well-connected communities in real-world and synthetic networks
- On sequential structures in incompressible multidimensional networks
- Reccs: realistic cluster connectivity simulator for synthetic network generation
- A framework for stability-based module detection in correlation graphs
- Topological aspects of the multi-language phases of the naming game on community-based networks
- Latent space network model for the popularity effect, with applications to Bitcoin networks
Describes a project that uses
Uses Software
This page was built for publication: A classification for community discovery methods in complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969805)
