A graph clustering algorithm based on a clustering coefficient for weighted graphs

DOI10.1007/s13173-010-0027-xzbMath1214.68263OpenAlexW2084898653WikidataQ57739642 ScholiaQ57739642MaRDI QIDQ2430549

Mariá C. V. Nascimento, André C. P. L. F. de Carvalho

Publication date: 7 April 2011

Published in: Journal of the Brazilian Computer Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13173-010-0027-x

zbMATH Keywords

combinatorial optimizationclustering coefficientgraph clustering

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Uses Software

• Graclus

Cites Work

• Unnamed Item
• Graph clustering
• Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
• Investigation of a new GRASP-based clustering algorithm applied to biological data
• Mining market data: a network approach
• Complexity of graph partition problems
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• Computing Communities in Large Networks Using Random Walks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: A graph clustering algorithm based on a clustering coefficient for weighted graphs