.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Many popular data cleaning approaches are rule-based: Constraints are formulated in a logical framework, and data is considered dirty if constraints are violated. These constraints are often discovered from data, but to ascertain their validity, user verification is necessary. Since the full set of discovered constraints is typically too large for manual inspection, recent research integrates user feedback into the discovery process. We propose a different approach that employs user interaction
only at the start
of the algorithm: a user manually cleans a small set of dirty tuples, and we infer the constraint underlying those repairs, called an
explanation
. We make use of conditional functional dependencies (CFDs) as the constraint formalism. We introduce XP
lode
, an on-demand algorithm which discovers the best explanation for a given repair. Guided by this explanation, data can then be cleaned using state-of-the-art CFD-based cleaning algorithms. Experiments on synthetic and real-world datasets show that the best explanation can typically be inferred using a limited number of modifications. Moreover, XP
lode
is substantially faster than discovering all CFDs that hold on a dataset, and is robust to noise in the modifications.
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息