实值数据集的项集
Itemsets for Real-valued Datasets
摘要:
模式挖掘是探索性数据分析中研究最多的子领域之一。虽然有大量的文献关于如何从二进制数据中有效地发现和排序项集,但令人惊讶的是,在从实值数据中挖掘模式方面的研究却很少。在本文中,我们提出了一个家庭的实值项目集的质量分数。我们通过考虑将数据集转换为二进制数据并计算该数据的支持度来解决这个问题。这种幼稚的方法要求我们选择阈值。为了解决这个问题,我们不选择一组阈值,而是将阈值视为随机变量并计算平均支持度。我们表明,我们可以有效地计算这种支持,我们还介绍了两个规范化,即比较支持对独立假设,更一般地说,对分区假设。我们的实验评估表明,我们可以有效地发现统计上显着的模式。
英文摘要:
Pattern mining is one of the most well-studied subfields in exploratory data analysis. While there is a significant amount of literature on how to discover and rank itemsets efficiently from binary data, there is surprisingly little research done in mining patterns from real-valued data. In this paper we propose a family of quality scores for real-valued itemsets. We approach the problem by considering casting the dataset into a binary data and computing the support from this data. This naive approach requires us to select thresholds. To remedy this, instead of selecting one set of thresholds, we treat thresholds as random variables and compute the average support. We show that we can compute this support efficiently, and we also introduce two normalisations, namely comparing the support against the independence assumption and, more generally, against the partition assumption. Our experimental evaluation demonstrates that we can discover statistically significant patterns efficiently.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。