The Effect of Relationship Encoding, Task Type, and Complexity on Information Representation: An Empirical Evaluation of 2D and 3D Line Graphs1
Bibliographic record
Abstract
Most of the recent research in data visualization has focused on technical and aesthetic issues involved in the manipulation of graphs, specifically on features that facilitate data exploration to make graphs interactive and dynamic. The present research identifies a gap in the existing knowledge of graph construction, namely potential problems in both 3D and 2D graphs that will impede comprehension of information when three or more variables are used in a graphical representation. Based on theories regarding perceptual issues of graph construction (Bertin 1981; Pinker 1991), we evaluate specific cases where 3D graphs may outperform 2D graphs, and vice-versa. Two experiments have been conducted to test these hypotheses, and 3D graphs have been found to consistently outperform 2D graphs in all of our experimental scenarios. A third experiment has been conducted to identify situations where 2D graphs might perform at least as well as 3D graphs, but its results suggest that 3D graphs outperform 2D graphs even for simple tasks, thus leading to the conclusion that 3D graphs perform better than 2D graphs under all task conditions with more than two variables.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.012 | 0.216 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.007 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".