Assessing the quality of multilevel graph clustering
From MaRDI portal
Publication:468684
DOI10.1007/s10618-013-0335-9zbMath1298.68226OpenAlexW1967302673WikidataQ114827256 ScholiaQ114827256MaRDI QIDQ468684
Guy Melançon, François Queyroi, Maylis Delest, Jean-Marc Fedou
Publication date: 7 November 2014
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-013-0335-9
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to social sciences (62P25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (2)
Min-max communities in graphs: complexity and computational properties ⋮ Suppression distance computation for hierarchical clusterings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Graph clustering
- Post-processing hierarchical community structures: quality improvements and multi-scale view
- Attribute grammars are useful for combinatorics
- Attribute grammars and automatic complexity analysis
- Network analysis of commuting flows: A comparative static approach to German data
- 10.1162/153244302760185234
- Community structure in social and biological networks
This page was built for publication: Assessing the quality of multilevel graph clustering