An Evaluation-Focused Framework for Visualization Recommendation Algorithms

Cited 13 time in webofscience Cited 0 time in scopus
  • Hit : 294
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorZeng, Zehuako
dc.contributor.authorMoh, Phoebeko
dc.contributor.authorDu, Fanko
dc.contributor.authorHoffswell, Janeko
dc.contributor.authorLee, Tak Yeonko
dc.contributor.authorMalik, Sanako
dc.contributor.authorKoh, Eunyeeko
dc.contributor.authorBattle, Leilaniko
dc.date.accessioned2022-01-10T06:40:43Z-
dc.date.available2022-01-10T06:40:43Z-
dc.date.created2022-01-10-
dc.date.created2022-01-10-
dc.date.created2022-01-10-
dc.date.issued2022-01-
dc.identifier.citationIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, v.28, no.1, pp.346 - 356-
dc.identifier.issn1077-2626-
dc.identifier.urihttp://hdl.handle.net/10203/291701-
dc.description.abstractAlthough we have seen a proliferation of algorithms for recommending visualizations, these algorithms are rarely compared with one another, making it difficult to ascertain which algorithm is best for a given visual analysis scenario. Though several formal frameworks have been proposed in response, we believe this issue persists because visualization recommendation algorithms are inadequately specified from an evaluation perspective. In this paper, we propose an evaluation-focused framework to contextualize and compare a broad range of visualization recommendation algorithms. We present the structure of our framework, where algorithms are specified using three components: (1) a graph representing the full space of possible visualization designs, (2) the method used to traverse the graph for potential candidates for recommendation, and (3) an oracle used to rank candidate designs. To demonstrate how our framework guides the formal comparison of algorithmic performance, we not only theoretically compare five existing representative recommendation algorithms, but also empirically compare four new algorithms generated based on our findings from the theoretical comparison. Our results show that these algorithms behave similarly in terms of user performance, highlighting the need for more rigorous formal comparisons of recommendation algorithms to further clarify their benefits in various analysis scenarios.-
dc.languageEnglish-
dc.publisherIEEE COMPUTER SOC-
dc.titleAn Evaluation-Focused Framework for Visualization Recommendation Algorithms-
dc.typeArticle-
dc.identifier.wosid000733959000046-
dc.identifier.scopusid2-s2.0-85115679841-
dc.type.rimsART-
dc.citation.volume28-
dc.citation.issue1-
dc.citation.beginningpage346-
dc.citation.endingpage356-
dc.citation.publicationnameIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS-
dc.identifier.doi10.1109/TVCG.2021.3114814-
dc.contributor.localauthorLee, Tak Yeon-
dc.contributor.nonIdAuthorZeng, Zehua-
dc.contributor.nonIdAuthorMoh, Phoebe-
dc.contributor.nonIdAuthorDu, Fan-
dc.contributor.nonIdAuthorHoffswell, Jane-
dc.contributor.nonIdAuthorMalik, Sana-
dc.contributor.nonIdAuthorKoh, Eunyee-
dc.contributor.nonIdAuthorBattle, Leilani-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorData visualization-
dc.subject.keywordAuthorVisualization-
dc.subject.keywordAuthorMachine learning algorithms-
dc.subject.keywordAuthorApproximation algorithms-
dc.subject.keywordAuthorTask analysis-
dc.subject.keywordAuthorEncoding-
dc.subject.keywordAuthorClustering algorithms-
dc.subject.keywordAuthorVisualization Tools-
dc.subject.keywordAuthorVisualization Recommendation Algorithms-
Appears in Collection
ID-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 13 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0