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

DOI10.1016/J.DAM.2013.09.017zbMATH Open1298.05294OpenAlexW1997527463MaRDI QIDQ403568FDOQ403568

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

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

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)

Cites Work

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

Cited In (17)

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