A quality metric for visualization of clusters in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2084295 (Why is no real title available?)
- scientific article; zbMATH DE number 2084318 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- 10.1162/153244303321897735
- A Method for Comparing Two Hierarchical Clusterings
- A sparse stress model
- An Experimental Study on Distance-Based Graph Drawing
- Are crossings important for drawing large graphs?
- Drawing graphs by eigenvectors: theory and practice
- Graph Drawing
- Graph Drawing
- Graph Drawing
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Multidimensional scaling. I: Theory and method
- Scikit-learn: machine learning in Python
- Shape-Based Quality Metrics for Large Graph Visualization
- Untangling the hairballs of multi-centered, small-world online social media networks
- Visualizing data using t-SNE
Cited in
(4)
This page was built for publication: A quality metric for visualization of clusters in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206839)