Clustering analysis in large graphs with rich attributes

DOI10.1007/978-3-642-23166-7_2MaRDI QIDQ3113384zbMATH OpenOpenAlexFDO

Authors Yang Zhou, Ling Liu

Publication date 9 February 2012

Published in Intelligent Systems Reference Library (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23166-7_2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Clustering large attributed information networks: an efficient incremental computing approach
• Efficient clustering of large uncertain graphs using neighborhood information
• Weighted clustering of attributed multi-graphs
• Modern algorithms of cluster analysis
• MapReduce-based graph structural clustering algorithm

Cited in

(4)

• Efficient clustering of large uncertain graphs using neighborhood information
• Clustering large attributed information networks: an efficient incremental computing approach
• scientific article; zbMATH DE number 1305418 (Why is no real title available?)
• MapReduce-based graph structural clustering algorithm

This page was built for publication: Clustering analysis in large graphs with rich attributes

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