Evaluating Encodings for Bivariate Edges in Adjacency Matrices
Jorge Acosta-Hern\'andez, Alexander Lex, Tingying He

TL;DR
This paper empirically evaluates various encoding techniques for representing distributions of quantitative edge values in adjacency matrices, revealing the relative effectiveness of different visual channels under space constraints.
Contribution
It introduces a systematic comparison of four encoding methods for bivariate edge data in adjacency matrices, providing insights into their performance and readability.
Findings
Area-based overlaid marks and bar charts perform best overall.
Angle-based marks have moderate, less stable performance.
Bivariate color underperforms compared to other encodings.
Abstract
We present the first empirical evaluation of techniques for encoding distributions of quantitative edge values within adjacency matrices. In many real-world networks, edges represent not a single value but a set of measurements. While adjacency matrices preserve structural clarity, their compact cells limit the simultaneous display of multiple values. To address this, we explore edge encodings that represent distributions by two values: a measure of central tendency (mean, median, mode) and a measure of dispersion (standard deviation, variance, IQR). We select four possible encodings for evaluation that prior work has suggested are suitable for the limited space available in matrices: a bivariate color palette, embedded bar charts, and two overlaid-mark designs mapping the primary attribute to color and the secondary attribute to area or angle. In a preregistered crowdsourced study with…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
