通过智能向下钻取进行交互式数据探索
Interactive Data Exploration with Smart Drill-Down
摘要:
我们提出了{ \em智能钻取},一个操作符交互式地探索关系表,发现和总结“有趣”的元组组。每组元组由{ \em规则}描述。例如,规则$(a, b, \star, 1000)$告诉我们,有一千个元组的值$a$在第一列,$b$在第二列(以及第三列中的任何值)。智能下钻为分析师提供了一个规则列表,这些规则一起描述了表的有趣方面。分析师可以定制兴趣的定义,并可以交互式地对现有规则应用智能下钻,以探索表的这一部分。我们证明,底层的优化问题是{ \sc NP-硬},并描述了一种算法,用于找到近似最优的规则列表显示时,用户使用智能钻取,和一个动态的采样方案,有效地与大型表进行交互。最后,我们在我们的实验原型上对真实数据集进行实验,以证明智能钻取的有用性并研究我们算法的性能。
英文摘要:
We present {\em smart drill-down}, an operator for interactively exploring a relational table to discover and summarize "interesting" groups of tuples. Each group of tuples is described by a {\em rule}. For instance, the rule $(a, b, \star, 1000)$ tells us that there are a thousand tuples with value $a$ in the first column and $b$ in the second column (and any value in the third column). Smart drill-down presents an analyst with a list of rules that together describe interesting aspects of the table. The analyst can tailor the definition of interesting, and can interactively apply smart drill-down on an existing rule to explore that part of the table. We demonstrate that the underlying optimization problems are {\sc NP-Hard}, and describe an algorithm for finding the approximately optimal list of rules to display when the user uses a smart drill-down, and a dynamic sampling scheme for efficiently interacting with large tables. Finally, we perform experiments on real datasets on our experimental prototype to demonstrate the usefulness of smart drill-down and study the performance of our algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。