数据集中关系的引导式可视化探索
Guided Visual Exploration of Relations in Data Sets
摘要:
有效的探索性数据分析系统必须考虑用户知道什么和想知道什么。本文提出了一个原则性的框架,交互式的可视化探索的关系数据,通过视图最翔实的用户的当前知识和目标。用户可以在数据中输入预先存在的关系知识,还可以制定具体的勘探兴趣,然后在勘探中考虑这些兴趣。这个想法是引导探索过程对用户的兴趣,而不是显示无趣或已知的关系。用户的知识是由分布在数据集参数化的行和列的数据,称为瓦片约束的子集。我们提供了一个计算效率的实现这一概念的基础上约束随机化。此外,我们描述了一种新的降维方法,找到最翔实的用户,在没有背景知识和通用目标的限制减少到PCA的意见。我们表明,该方法是适合交互式使用,是强大的噪声,优于标准的投影寻踪可视化方法,并给出了可理解的和有用的结果,在现实世界的数据分析。我们提供了该框架的开源实现。
英文摘要:
Efficient explorative data analysis systems must take into account both what a user knows and wants to know. This paper proposes a principled framework for interactive visual exploration of relations in data, through views most informative given the user's current knowledge and objectives. The user can input pre-existing knowledge of relations in the data and also formulate specific exploration interests, which are then taken into account in the exploration. The idea is to steer the exploration process towards the interests of the user, instead of showing uninteresting or already known relations. The user's knowledge is modelled by a distribution over data sets parametrised by subsets of rows and columns of data, called tile constraints. We provide a computationally efficient implementation of this concept based on constrained randomisation. Furthermore, we describe a novel dimensionality reduction method for finding the views most informative to the user, which at the limit of no background knowledge and with generic objectives reduces to PCA. We show that the method is suitable for interactive use and is robust to noise, outperforms standard projection pursuit visualisation methods, and gives understandable and useful results in analysis of real-world data. We provide an open-source implementation of the framework.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。