Network Layout Algorithm with Covariate Smoothing
Octavious Smiley, Till Hoffmann, Jukka-Pekka Onnela

TL;DR
This paper introduces a novel network visualization algorithm that incorporates covariate-based smoothing to improve layout robustness, especially when network data contains errors or missing information.
Contribution
It extends the Fruchterman-Reingold algorithm by integrating estimated edge probabilities from node attributes, enabling better visualization despite data limitations.
Findings
Enhanced network layouts with covariate smoothing.
Improved robustness against false edges and missing data.
Effective use of nodal attributes in visualization.
Abstract
Network science explores intricate connections among objects, employed in diverse domains like social interactions, fraud detection, and disease spread. Visualization of networks facilitates conceptualizing research questions and forming scientific hypotheses. Networks, as mathematical high-dimensional objects, require dimensionality reduction for (planar) visualization. Visualizing empirical networks present additional challenges. They often contain false positive (spurious) and false negative (missing) edges. Traditional visualization methods don't account for errors in observation, potentially biasing interpretations. Moreover, contemporary network data includes rich nodal attributes. However, traditional methods neglect these attributes when computing node locations. Our visualization approach aims to leverage nodal attribute richness to compensate for network data limitations. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Data Visualization and Analytics · Mental Health Research Topics
