Node-Link or Adjacency Matrices: Old Question, New Insights
dc.contributor.author | Okoe, Mershack | |
dc.contributor.author | Jianu, Radu | |
dc.contributor.author | Kobourov, Stephen | |
dc.date.accessioned | 2019-10-04T23:38:34Z | |
dc.date.available | 2019-10-04T23:38:34Z | |
dc.date.issued | 2019-10 | |
dc.identifier.citation | Okoe, M., Jianu, R., & Kobourov, S. G. (2018). Node-link or Adjacency Matrices: Old Question, New Insights. IEEE transactions on visualization and computer graphics. | en_US |
dc.identifier.issn | 1077-2626 | |
dc.identifier.pmid | 30130228 | |
dc.identifier.doi | 10.1109/TVCG.2018.2865940 | |
dc.identifier.uri | http://hdl.handle.net/10150/634672 | |
dc.description.abstract | Visualizing network data is applicable in domains such as biology, engineering, and social sciences. We report the results of a study comparing the effectiveness of the two primary techniques for showing network data: node-link diagrams and adjacency matrices. Specifically, an evaluation with a large number of online participants revealed statistically significant differences between the two visualizations. Our work adds to existing research in several ways. First, we explore a broad spectrum of network tasks, many of which had not been previously evaluated. Second, our study uses two large datasets, typical of many real-life networks not explored by previous studies. Third, we leverage crowdsourcing to evaluate many tasks with many participants. This paper is an expanded journal version of a Graph Drawing (GD'17) conference paper. We evaluated a second dataset, added a qualitative feedback section, and expanded the procedure, results, discussion, and limitations sections. | en_US |
dc.description.sponsorship | NSFNational Science Foundation (NSF) [CCF-1740858, CCF-1712119] | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE COMPUTER SOC | en_US |
dc.rights | © 2018 IEEE. | en_US |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | evaluation | en_US |
dc.subject | user study | en_US |
dc.subject | graphs | en_US |
dc.subject | networks | en_US |
dc.subject | node-link | en_US |
dc.subject | adjacency matrices | en_US |
dc.title | Node-Link or Adjacency Matrices: Old Question, New Insights | en_US |
dc.type | Article | en_US |
dc.identifier.eissn | 1941-0506 | |
dc.contributor.department | Univ Arizona | en_US |
dc.identifier.journal | IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS | en_US |
dc.description.collectioninformation | This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu. | en_US |
dc.eprint.version | Final accepted manuscript | en_US |
dc.source.journaltitle | IEEE transactions on visualization and computer graphics | |
refterms.dateFOA | 2019-10-04T23:38:35Z |