<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Make Informed Decisions: Understanding Query Results from Incomplete Databases</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Poonam Kumari Supervised by Dr. Oliver Kennedy State University of New York at Buffalo New York</institution>
          ,
          <country country="US">United States of America</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Analyzing data has been central in making decisions whether it be a decision to buy stock or detect the chances of diabetes based on family history. Datasets used for analysis might include incomplete, inconsistent, missing data or might involve integrating two or more sources. Data quality management has been studied extensively with focus on tabular data. Lot of work has been done in terms of data curation and imputation, although visualization aspect of data quality management remains fairly unexplored. The aim of this PhD research is to focus on visualizing the imperfections in these datasets in order to help users analyze and interpret data and guide them to make informed decisions. We explore how di↵erent visualization techniques a↵ect perceived data quality, accuracy and decision confidence.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        With growing data sizes and di↵erent ways of obtaining
data, datasets being analyzed are prone to incomplete,
inconsistent, missing data etc. These errors must be detected
and corrected in order to maintain the quality and usability
of data. This takes up to 30-80 percent of an analyst’s time
and resources [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Di↵erent systems have been designed to
help analyst curate the data using a wide variety of methods
to deal with dirty data.
      </p>
      <p>
        For example, simple imputation techniques like hot-deck
imputation substitute values from current sample whereas
cold-deck imputation make use of related datasets [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] or
domain heuristics [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Methods like linear interpolation,
regression, and adaptive interpolation [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] infer missing values
by using a weighted combination of available data. More
complex imputation techniques estimate missing values
using machine learning and related techniques [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] or [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]
integrate information about the processes used to generate the
dataset.
      </p>
      <p>
        Historically, uncertain data could not be queried using
classical databases. Although incomplete [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and
probabilisProceedings of the VLDB 2019 PhD Workshop, August 26th, 2019. Los
Angeles, California. Copyright (C) 2019 for this paper by its authors.
Copying permitted for private and academic purposes
tic databases [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] let the user query data with uncertainty,
the query results might be dicult to understand.
      </p>
      <p>
        Probabilistic databases: Probabilistic Databases (PD)
make use of a user specified probability distribution function
for the uncertain data. For instance, in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] a parameter p
on each tuple specifies the probability distribution for tuple
existence. In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] a user specified joint probability is used
by PD to determine resulting output tuples and their
associated probabilities. No explanation about query results
is provided in PD’s (”Why a tuple is present in the query
result or why is a high probability associated with the
tuple?”). Although PD’s help manage uncertain data
successfully, the probability distributions in query results might be
dicult to understand.
      </p>
      <p>Incomplete Databases: To deal with uncertain data,
incomplete databases work on a set of all deterministic
instances known as possible worlds. A typical query result
on these databases might consist of certain answers,
possible answers or both (depending on the type of incomplete
database system). Database instances in fig 1 represent
two possible worlds i.e ceiling mart database is one
possible world and Aimpoint is another possible world. The
ratings for Dell i7 and Lenovo i7 are consistent across both
the possible worlds. If a user issues a query to get the
ratings for the two products, the result set would consist of
certain answers (answers in all possible worlds). Whereas
the query result for getting rating of Asus i5 and Lenovo i7
would contain possible answers (due to missing value for
HP AMD in one possible world and inconsistent rating for
Asus i5).</p>
      <p>
        Di↵erent approaches have been used to represent
possible and certain answers. Conservative approaches [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
consider only the certain answer. For instance a query on
possible worlds in fig 1 will result in two tuples Dell i7 and
Lenovo i7 since the ratings are consistent in both worlds.
Best guess query processing use the best possible world by
making an educated guess and work exclusively with guessed
world. Suppose best guess approach chooses first instance
from fig 1. A query to get the ratings of products will
present all certain answers ignoring the missing value and
inconsistency in rating for Asus in the second instance. (1)
      </p>
      <sec id="sec-1-1">
        <title>Conservative approach ignores the uncertainty al</title>
        <p>together missing out on valuable information. (2)</p>
      </sec>
      <sec id="sec-1-2">
        <title>Best guess approach takes uncertainty into account but the valuable information about interpreting the uncertainty is lost [6].</title>
        <p>To summarize various imputation methods are used to
deal with uncertain data which make a guess based on
ex</p>
      </sec>
      <sec id="sec-1-3">
        <title>Name</title>
        <p>Dell i7
HP AMD
Asus i5
Lenovo i7</p>
      </sec>
      <sec id="sec-1-4">
        <title>Rating</title>
        <p>4
2
3.5
3</p>
        <p>Aimpoint</p>
      </sec>
      <sec id="sec-1-5">
        <title>Name</title>
        <p>Dell i7
HP AMD
Asus i5
Lenovo i7</p>
      </sec>
      <sec id="sec-1-6">
        <title>Rating</title>
        <p>
          4
isting values, domain heuristics or machine learning
techniques. These guesses can be in the form of certain and
possible answers. Incomplete and probabilistic databases
help query these datasets and provide query results as
tabular data. These query results might or might not contain
uncertain data (possible answers) which hinders users
ability to make an informed decision. Uncertainty annotated
databases (UA-DB’s [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]) help overcome the limitations of
earlier systems caused by ignoring uncertainty or missing
out on information about interpreting uncertainty. UA-DB’s
also help represent uncertain data e↵ectively and distinguish
between certain answers and merely possible answers.
2.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>MOTIVATING EXAMPLE</title>
      <p>ABC corp. is a sales company which helps user select
products like laptops based on based on a large database of
crowd-sourced and/or web-scraped reviews of those
products. Alice is the customer service representative. Bob is
an analyst who maintains the database. Bob is working on
integrating instances shown in fig 1 containing laptop
ratings from di↵erent vendors. Bob needs to clean the data
first (missing value and inconsistent ratings) and load it,
which will enable Alice to query the database and make a
suggestion to the customer.</p>
      <p>During data imputation the system decides to ignore the
missing value in case of HP AMD and take an average of
ratings in case of Asus i5. Integrated dataset (table 1) is
passed on to Alice for analysis.</p>
      <sec id="sec-2-1">
        <title>Name</title>
        <p>Dell i7
HP AMD
Asus i5
Lenovo i7</p>
      </sec>
      <sec id="sec-2-2">
        <title>Rating</title>
        <p>4
2
4
3</p>
        <p>In the above example table 1 represents an incomplete
database. Ratings for Dell i7 and Lenovo i7 are certain
answers(answers in all possible worlds) where as ratings for HP
AMD and Asus i5 are possible answers (uncertain) due to
the system making a guess about the missing and
inconsistent value.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>RESEARCH QUESTIONS</title>
      <p>Why is a distinction between certain and uncertain
answers required? And how this distinction would help user
asses relevant information and make an informed decision
based on it?</p>
      <p>In the earlier example, Bob had completed the data
cleaning task and the database queried by Alice to obtain a
tabular query result(table 1) containing both certain and
uncertain answers.</p>
      <p>• If the conservative approach is used then Alice is left
with just two products and the user might choose Dell
i7. In this method the user misses out on comparing
Dell i7 and Asus i5 which has a higher rating, although
uncertain.
• If the best guess approach is considered, Alice has all
the 4 ratings to choose from. Since the distinction
between certain and possible answers is not clear and
valuable information about the possible answer is lost,
the user might end up with Asus i5.</p>
      <p>
        A lot of time and e↵ort is put into cleaning the data,
making guesses and calculating the best possible world. Data
cleaning forms a large chunk in the data management life
cycle. After all this e↵ort what if the query results are not
understood by the user. For instance, classical probabilistic
databases represent query results in the form of certain
answers or probability distribution which might overwhelm a
naive user. Just having a probability distribution or
possible answers for query results is insucient: the uncertainty
must be communicated to the users who will ultimately
decide the relevant information (in the results) pertaining to
their task and make an informed decision [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        Incomplete databases cannot decide whether the data
presented as part of query results are relevant for user’s decision
task. Alice is helping user make a decision in choosing a
laptop based on ratings presented in table 1. Uncertain answers
in the query result pose an important question. Are
uncertain answers reliable as they are ultimately a guess made by
the system?. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] conducted a case study with real world
data to demonstrate the usefulness of discovering knowledge
about the patterns of missing values through classification.
The data mining task was to find how important a role the
race factor played in the home loan assessment process. The
classifier for the data without the race factor had 64.1%
accuracy for the training data set and 64.2% accuracy for the
test data set, producing an overall 64.2% accuracy. In the
medical domain [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] uses naive credal classifier which
extends the discrete naive Bayes classifier to imprecise
probabilities. The diagnostic tool delivers upto 95% correct
predictions and also proves to be e↵ective in discriminating
between Alzheimers disease and dementia with Lewy bodies.
Although di↵erent imputation methods are used and the
system makes an educated guess, the guesses about possible
answers are reliable. And excluding possible answers from
the query result might result in losing valuable information.
      </p>
      <p>
        Since the uncertain answers are reliable, what should the
user do when they see an uncertain value? Users can take
the conservative approach and ignore the uncertain values.
Limitations of this strategy are well known [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Second
approach is to consider uncertain answers for decision task.
In table 1 the uncertain rating for HP AMD might not be
relevant to the user since there are higher rated products.
But the uncertain rating in case of Asus might be relevant to
the user, since the user has to choose between a certain 4 for
Dell i7 and an uncertain 4.5 for Asus i5. The system cannot
decide whether the values are relevant to the user task, the
user has to understand and make this decision. We believe
that providing additional information about the uncertain
data will guide user to make an informed decision.
      </p>
      <p>The focus of this research is to provide guidelines and
best practices to visualize uncertainty in incomplete
databases. For example we would like to help users to
visually distinguish between certain and uncertain
answers in query result for incomplete databases.
As another example, simply knowing that an answer is
uncertain may not be enough and we would like to provide
additional contextual hints explaining uncertainty.</p>
    </sec>
    <sec id="sec-4">
      <title>4. PRELIMINARY STUDY</title>
      <p>
        Why is there a need to visualize uncertainty? We
have already established that presenting possible answers
do aid users in making a decision. [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] conducted a pair of
crowdsourced studies to measure influence of methods used
to impute and visualize missing data on an analysts
perception of data quality. The methods used also a↵ected
conclusions. The study concluded that highlighting imputed values
led to higher perceived confidence, credibility and data
quality. Whereas not visualizing the missing values, downplaying
visual encodings, filling out missing values with zero
(zerofilling) lead to lower subjective perceived measurements.
      </p>
      <p>
        Apart from improving decision-making and increase in
perceived confidence, research carried out in several domains
such as health, weather prediction, transportation, and more,
indicates displaying uncertainty helps in improving trust
placed on the system. A simple feedback mechanism in
context-aware systems was evaluated in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The results
suggest that human performance in memory-bounded tasks
increases by explicitly displaying uncertainty information.
      </p>
      <sec id="sec-4-1">
        <title>To visually distinguish between certain and uncertain answers in query result for incomplete databases.</title>
        <p>
          Most of the imputation methods, require the system to make
a guess and form certain and uncertain answers. The type
of system decides whether uncertainty in the data should
be presented to the user or not. We believe that
uncertain data should be presented and uncertainty in the data
should be e↵ectively communicated in order to help users
interpret the results and decide whether and how to act on
the results given. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] presents our initial e↵orts in
communicating uncertainty about query results in On Demand
Curation Tools. A preliminary user study was conducted
to evaluate the cognitive burden and expressiveness of four
representations of “attribute-level” uncertainty. Uncertain
data was annotated using simple one bit representation
(asterisk, colored text and color background) and confidence
interval (Figure 2).
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Product</title>
        <p>HP
Asus
Dell</p>
      </sec>
      <sec id="sec-4-3">
        <title>CeilingMart</title>
        <p>4.5
2.5
5.0*</p>
      </sec>
      <sec id="sec-4-4">
        <title>Aimpoint</title>
        <p>3.0
2.5
3.5</p>
      </sec>
      <sec id="sec-4-5">
        <title>Ibibo</title>
        <p>3.5±1
3.0
5.0</p>
        <p>Participants were presented with a task to rank three
different products based on the ratings provided. Product
selection, re-ordering the product list, and submitting the
participant’s final order were logged along with timestamps as
part of interactions with the web form. Think-aloud
protocol was also used in the experiment in order to transcribe
participants thought process while making a decision. The
study aimed at answering two primary questions: (1) Is the
representation e↵ective at communicating uncertainty, and
(2) What is the cognitive burden of interpreting the
representation? Results showed an insignificant di↵erences in time
taken to interpret uncertainty by the user. And a change
in the ways people interpreted and reacted to data based
on change in uncertainty was observed. Colored text and
color coding significantly altered participant behavior which
is consistent with coloring signaling significant errors.
Participants requested additional information when asterisk was
used to represent uncertain data.
4.1</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Follow up Study</title>
      <p>Through the previous study we have established the need
of representing and ways to represent uncertainty in
incomplete databases. The next question is to help user
understand the reason for data being uncertain. To provide
additional contextual hints explaining uncertainty.
A follow up study was conducted to explore this task using
a lighter-weight, two-level interface for presenting uncertain
query results to users. First, a preliminary annotation (same
as preliminary study) notifies users about the presence of
uncertainty. If they deem it relevant, users can then
interactively explore the uncertainty to obtain additional detail.</p>
      <sec id="sec-5-1">
        <title>Why would user need additional information? One</title>
        <p>
          of the limitation of both PD’s and incomplete databases is
lack of information about the probability/uncertain answer.
Output tuples in existing systems like TRIO [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] do contain
lineage/provenance along with output probabilities. Lineage
refers to a boolean formula which qualitatively explains the
reasons for occurrence of the output tuple. However it is
not informative in case of multiple output tuples. The case
of projection of a million tuples on to a single tuple results
in a vary large lineage formula of size one million. This
can be dicult for the user to obtain any information from.
We believe that information regarding uncertain data can
be displayed in the form of small contextual hints. The
information should be presented to the user on demand. For
instance, in table 1 user might not need this contextual
information related to HP AMD laptop, but this additional
information might prove helpful in case of choice between
Dell and Asus.
5.
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>RESEARCH PLAN</title>
      <p>
        The current systems cannot decide whether an uncertain
value is relevant to the user taks (e.g: Ranking task based on
data in table 1). [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] talks about the problem of
determining the sensitive input tuples for the given query in PD’s.
Sensitive tuples refer to the one’s that can substantially
alter output, when their probabilities are modified. Similar
strategy can be used in case of incomplete databases. Our
next steps would be: (1) To help the system identify
relevancy of uncertain answers to the user query.
E.g. for the ranking task HP rating can be considered
irrelevant and Asus rating as relevant. This can be done by
identifying input tuples which might a↵ect the output. An
algorithm can be developed for identifying such tuples for
various known queries like sum, count, min and max. (2)
      </p>
      <sec id="sec-6-1">
        <title>Incorporate the results from the user study and relevancy algorithm into an existing system Mimir [19].</title>
        <p>The findings of preliminary study have been incorporated
into Mimir which uses red text to display uncertain answers.
(3) Visualize the e↵ects of user choice on query
result Mimir provides feedback on each guessed datapoint and
user can choose to approve or fix the datapoint manually.
Changes in query result can be visualized based on
information from the algorithm in step 1 as the user makes a
decision on the feedback provided. This would help the user
to visually inspect the e↵ects of their decision before the
changes are applied. (4) Visualize uncertain answers
in query results using data plots Visualization of
results will aid data analysis by making it easier for the user
to identify trends and outliers in the data. These data plots
can be presented to domain experts for further inspection
of data requiring domain knowledge. (5) Visualize
missing values in raw data using data plots. Users can
visualize the data and then inspect each data point in raw
data by clicking on the data plot and accepting the feedback
provided by the system or fixing the uncertainty manually.
Similar uncertain data, for e.g. missing values in a column
can be fixed in groups based on the feedback provided.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>6. CONCLUSION</title>
      <p>Increasing data sizes pose the problem of uncertainty in
data. Several data curation techniques have been
developed along with databases (PD’s and incomplete databases)
to help query this data. Although data cleaning is
studied extensively, we need to focus on visualizing the query
results for a better understanding. We described a user
study as part of our initial e↵ort and next steps to help us
design guidelines for visualizing uncertainty in incomplete
databases.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Abiteboul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kanellakis</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Grahne</surname>
          </string-name>
          .
          <article-title>On the representation and querying of sets of possible worlds</article-title>
          .
          <source>Theoretical computer science</source>
          ,
          <volume>78</volume>
          (
          <issue>1</issue>
          ):
          <fpage>159</fpage>
          -
          <lpage>187</lpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Aggarwal</surname>
          </string-name>
          .
          <article-title>Trio a system for data uncertainty and lineage</article-title>
          .
          <source>In Managing and Mining Uncertain Data</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          . Springer,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ahuja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Roth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Gangadharaiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Schwarz</surname>
          </string-name>
          , and
          <string-name>
            <surname>R. Bastidas.</surname>
          </string-name>
          <article-title>Using machine learning to accelerate data wrangling</article-title>
          .
          <source>In 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)</source>
          , pages
          <fpage>343</fpage>
          -
          <lpage>349</lpage>
          . IEEE,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Antifakos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Schwaninger</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Schiele</surname>
          </string-name>
          .
          <article-title>Evaluating the e↵ects of displaying uncertainty in context-aware applications</article-title>
          .
          <source>In International Conference on Ubiquitous Computing</source>
          , pages
          <fpage>54</fpage>
          -
          <lpage>69</lpage>
          . Springer,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Dalvi</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Suciu</surname>
          </string-name>
          .
          <article-title>Ecient query evaluation on probabilistic databases</article-title>
          .
          <source>The VLDB JournalThe International Journal on Very Large Data Bases</source>
          ,
          <volume>16</volume>
          (
          <issue>4</issue>
          ):
          <fpage>523</fpage>
          -
          <lpage>544</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Huber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Glavic</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Kennedy</surname>
          </string-name>
          .
          <article-title>Uncertainty annotated databases-a lightweight approach for approximating certain answers (extended version)</article-title>
          .
          <source>arXiv preprint arXiv:1904.00234</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.</given-names>
            <surname>Gao</surname>
          </string-name>
          .
          <article-title>Adaptive interpolation algorithms for temporal-oriented datasets</article-title>
          .
          <source>In Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06)</source>
          , pages
          <fpage>145</fpage>
          -
          <lpage>151</lpage>
          . IEEE,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>W.</given-names>
            <surname>Githungo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Otengi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wakhungu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Masibayi</surname>
          </string-name>
          .
          <article-title>Infilling monthly rain gauge data gaps with satellite estimates for asal of kenya</article-title>
          .
          <source>Hydrology</source>
          ,
          <volume>3</volume>
          (
          <issue>4</issue>
          ):
          <fpage>40</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Grant</surname>
          </string-name>
          .
          <article-title>Incomplete information in a relational database</article-title>
          .
          <source>FUND. INFO.</source>
          ,
          <volume>3</volume>
          (
          <issue>3</issue>
          ):
          <fpage>363</fpage>
          -
          <lpage>378</lpage>
          ,
          <year>1980</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>K.</given-names>
            <surname>Gu</surname>
          </string-name>
          ¨lensoy, C. Gawrilow, and T. von Landesberger.
          <article-title>Visual exploration of dirty activity sensor and emotional state data from psychological experiments</article-title>
          .
          <source>In Proceedings of the 14th International Conference on Knowledge Technologies and Data-driven Business, page 19. Citeseer</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>B.</given-names>
            <surname>Kanagal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Deshpande</surname>
          </string-name>
          .
          <article-title>Sensitivity analysis and explanations for robust query evaluation in probabilistic databases</article-title>
          .
          <source>In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data</source>
          , pages
          <fpage>841</fpage>
          -
          <lpage>852</lpage>
          . ACM,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Achmiz</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Kennedy</surname>
          </string-name>
          .
          <article-title>Communicating data quality in on-demand curation</article-title>
          .
          <source>arXiv preprint arXiv:1606.02250</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>R¨assler. Data fusion: identification problems, validity, and multiple imputation</article-title>
          .
          <source>Austrian Journal of Statistics</source>
          ,
          <volume>33</volume>
          (
          <issue>1</issue>
          &amp;2):
          <fpage>153</fpage>
          -
          <lpage>171</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>B.</given-names>
            <surname>Saha</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          .
          <article-title>Data quality: The other face of big data</article-title>
          .
          <source>In 2014 IEEE 30th International Conference on Data Engineering</source>
          , pages
          <fpage>1294</fpage>
          -
          <lpage>1297</lpage>
          . IEEE,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>P.</given-names>
            <surname>Sen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Deshpande</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Getoor</surname>
          </string-name>
          .
          <article-title>Prdb: managing and exploiting rich correlations in probabilistic databases</article-title>
          .
          <source>The VLDB JournalThe International Journal on Very Large Data Bases</source>
          ,
          <volume>18</volume>
          (
          <issue>5</issue>
          ):
          <fpage>1065</fpage>
          -
          <lpage>1090</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Song</surname>
          </string-name>
          and
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Szafir</surname>
          </string-name>
          .
          <article-title>Where's my data? evaluating visualizations with missing data</article-title>
          .
          <source>IEEE transactions on visualization and computer graphics</source>
          ,
          <volume>25</volume>
          (
          <issue>1</issue>
          ):
          <fpage>914</fpage>
          -
          <lpage>924</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>D.</given-names>
            <surname>Suciu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Olteanu</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          R´e, and
          <string-name>
            <given-names>C.</given-names>
            <surname>Koch</surname>
          </string-name>
          .
          <article-title>Probabilistic databases, synthesis lectures on data management</article-title>
          . Morgan &amp; Claypool,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Mining incomplete survey data through classification</article-title>
          .
          <source>Knowledge and information systems</source>
          ,
          <volume>24</volume>
          (
          <issue>2</issue>
          ):
          <fpage>221</fpage>
          -
          <lpage>233</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Meneghetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fehling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. H.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and
          <string-name>
            <surname>O. Kennedy. Lenses:</surname>
          </string-name>
          <article-title>An on-demand approach to etl</article-title>
          .
          <source>Proceedings of the VLDB Endowment</source>
          ,
          <volume>8</volume>
          (
          <issue>12</issue>
          ):
          <fpage>1578</fpage>
          -
          <lpage>1589</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>M.</given-names>
            <surname>Za</surname>
          </string-name>
          <article-title>↵alon, K. Wesnes</article-title>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Petrini</surname>
          </string-name>
          .
          <article-title>Reliable diagnoses of dementia by the naive credal classifier inferred from incomplete cognitive data</article-title>
          .
          <source>Artificial intelligence in medicine</source>
          ,
          <volume>29</volume>
          (
          <issue>1-2</issue>
          ):
          <fpage>61</fpage>
          -
          <lpage>79</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>