Interactive Cleaning for Progressive Visualization through Composite Questions

In this paper, we study the problem of interactive cleaning for progressive visualization (ICPV): Given a bad visualization V , it is to obtain a "cleaned" visualization V whose distance is far from V , under a given (small) budget w.r.t. human cost. In ICPV, a system interacts with a user iteratively. During each iteration, it asks the user a data cleaning question such as "how to clean detected errors x?", and takes value updates from the user to clean V . Conventional wisdom typically picks a single question (e.g., "Are SIGMOD conference and SIGMOD the same?") with the maximum expected benefit in each iteration. We propose to use a composite questioni.e., a group of single questions to be treated as one question -in each iteration (for example, Are SIGMOD conference in t1 and SIGMOD in t2 the same value, and are t1 and t2 duplicates?). A composite question is presented to the user as a small connected graph through a novel GUI that the user can directly operate on. We propose algorithms to select the best composite question in each iteration. Experiments on real-world datasets verify that composite questions are more effective than asking single questions in isolation w.r.t. the human cost.

However, a visualization is not necessarily dirty, even if the data is dirty. Consider another example. Example 2: [A Correct Pie Chart] Figure 1(b) shows the proportion of the #-publications by Year and the result is

Id Year Title (abbr.) Venue Affiliation Citations t1 2013 NADEEF ACM SIGMOD QCRI 174.0 t2 2013 NADEEF SIGMOD Conf.