Community detection in networks via a spectral heuristic based on the clustering coefficient

DOI10.1016/J.DAM.2013.09.017MaRDI QIDQ403568zbMATH OpenOpenAlexFDO

Authors Mariá C. V. Nascimento

Publication date 29 August 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.09.017

zbMATH Keywords

graph clusteringclustering coefficientcommunity detection in networksspectral heuristicunweighted graphs

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Spectral clustering for community detection
• A spectral clustering-based framework for detecting community structures in complex networks
• scientific article; zbMATH DE number 7266663
• Detecting network communities: a new systematic and efficient algorithm
• A modularity degree based heuristic community detection algorithm

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• 10.1162/153244303321897735
• Algorithms for graph partitioning on the planted partition model
• Collective dynamics of `small-world' networks
• Communities in Networks
• Community structure in social and biological networks
• Complex networks: structure and dynamics
• Computing Communities in Large Networks Using Random Walks
• Fast unfolding of communities in large networks
• Modularity-maximizing graph communities via mathematical programming
• Spectral methods for graph clustering - a survey
• Spectral partitioning with multiple eigenvectors
• The Structure and Function of Complex Networks

Cited in

(17)

• A spectral method to detect community structure based on distance modularity matrix
• Spectral clustering for community detection
• A novel method of generating tunable network topologies for social simulation
• Community detection based on neighborhood information
• A new measure of the resilience for networks of funds with applications to socially responsible investments
• Independence versus indetermination: basis of two canonical clustering criteria
• A signal-diffusion-based spectral clustering method for community detection
• SPECTRAL METHODS CLUSTER WORDS OF THE SAME CLASS IN A SYNTACTIC DEPENDENCY NETWORK
• Community Detection Using Spectral Clustering on Sparse Geosocial Data
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting
• Estimating the clustering coefficient using sample complexity analysis
• scientific article; zbMATH DE number 5016624 (Why is no real title available?)
• A spectral clustering-based framework for detecting community structures in complex networks
• scientific article; zbMATH DE number 7266663 (Why is no real title available?)
• A framework of mapping undirected to directed graphs for community detection
• scientific article; zbMATH DE number 7307464 (Why is no real title available?)
• A divisive spectral method for network community detection

This page was built for publication: Community detection in networks via a spectral heuristic based on the clustering coefficient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403568)