TY - JOUR
T1 - Efficient Recommendation of Aggregate Data Visualizations
AU - Ehsan, Humaira
AU - Sharaf, Mohamed A.
AU - Chrysanthis, Panos K.
N1 - Funding Information:
This work is partially supported by ARC grant LP130100164, NSF CDI award OIA-1028162, and UQ Centennial Scholarship. The authors would also like to thank the anonymous reviewers for their thorough feedback.
Publisher Copyright:
© 2017 IEEE.
PY - 2018/2/1
Y1 - 2018/2/1
N2 - Data visualization is a common and effective technique for data exploration. However, for complex data, it is infeasible for an analyst to manually generate and browse all possible visualizations for insights. This observation motivated the need for automated solutions that can effectively recommend such visualizations. The main idea underlying those solutions is to evaluate the utility of all possible visualizations and then recommend the top-k visualizations. This process incurs high data processing cost, that is further aggravated by the presence of numerical dimensional attributes. To address that challenge, we propose novel view recommendation schemes, which incorporate a hybrid multi-objective utility function that captures the impact of numerical dimension attributes. Our first scheme, Multi-Objective View Recommendation for Data Exploration (MuVE), adopts an incremental evaluation of our multi-objective utility function, which allows pruning of a large number of low-utility views and avoids unnecessary objective evaluations. Our second scheme, upper MuVE (uMuVE), further improves the pruning power by setting the upper bounds on the utility of views and allowing interleaved processing of views, at the expense of increased memory usage. Finally, our third scheme, Memory-aware uMuVE (MuMuVE), provides pruning power close to that of uMuVE, while keeping memory usage within a pre-specified limit.
AB - Data visualization is a common and effective technique for data exploration. However, for complex data, it is infeasible for an analyst to manually generate and browse all possible visualizations for insights. This observation motivated the need for automated solutions that can effectively recommend such visualizations. The main idea underlying those solutions is to evaluate the utility of all possible visualizations and then recommend the top-k visualizations. This process incurs high data processing cost, that is further aggravated by the presence of numerical dimensional attributes. To address that challenge, we propose novel view recommendation schemes, which incorporate a hybrid multi-objective utility function that captures the impact of numerical dimension attributes. Our first scheme, Multi-Objective View Recommendation for Data Exploration (MuVE), adopts an incremental evaluation of our multi-objective utility function, which allows pruning of a large number of low-utility views and avoids unnecessary objective evaluations. Our second scheme, upper MuVE (uMuVE), further improves the pruning power by setting the upper bounds on the utility of views and allowing interleaved processing of views, at the expense of increased memory usage. Finally, our third scheme, Memory-aware uMuVE (MuMuVE), provides pruning power close to that of uMuVE, while keeping memory usage within a pre-specified limit.
KW - Data exploration
KW - aggregate views
KW - view recommendation
KW - visual analytics
UR - http://www.scopus.com/inward/record.url?scp=85032436798&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85032436798&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2017.2765634
DO - 10.1109/TKDE.2017.2765634
M3 - Article
AN - SCOPUS:85032436798
SN - 1041-4347
VL - 30
SP - 263
EP - 277
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 2
M1 - 80818256
ER -