arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.03102cs.LGcs.DSstat.ML
收藏

利用背景知识对项目集进行排序

Using Background Knowledge to Rank Itemsets

Universiteit Antwerpen(安特卫普大学);IWT-Vlaanderen(弗拉芒创新与科技促进研究所)

Nikolaj Tatti, Michael Mampaey

摘要:

评价发现结果的质量是数据采掘中一个重要的开放性问题。这样的评估是特别重要的挖掘项目集时,因为通常许多发现的模式可以很容易地解释的背景知识。筛选不感兴趣的模式的最简单方法是将观察到的频率与独立模型进行比较。由于独立性模型的参数是列边距,我们可以将这种筛选视为将列边距用作背景知识的一种方式。在本文中,我们研究技术更灵活的方法注入背景知识。也就是说,我们表明,我们可以有效地使用额外的知识,如行边距,拉撒路计数,和边界的。我们证明,这些统计描述的形式,在实践中发生的数据,并已在数据采掘研究。为了有效地注入信息,我们使用最大熵方法。在其一般设置,解决最大熵模型是不可行的,但我们证明,对于我们的设置,它可以在多项式时间内解决。实验表明,更复杂的模型更好地拟合数据,使用更多的信息提高了项集的频率预测。

英文摘要:

Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the discovered patterns can be easily explained by background knowledge. The simplest approach to screen uninteresting patterns is to compare the observed frequency against the independence model. Since the parameters for the independence model are the column margins, we can view such screening as a way of using the column margins as background knowledge. In this paper we study techniques for more flexible approaches for infusing background knowledge. Namely, we show that we can efficiently use additional knowledge such as row margins, lazarus counts, and bounds of ones. We demonstrate that these statistics describe forms of data that occur in practice and have been studied in data mining. To infuse the information efficiently we use a maximum entropy approach. In its general setting, solving a maximum entropy model is infeasible, but we demonstrate that for our setting it can be solved in polynomial time. Experiments show that more sophisticated models fit the data better and that using more information improves the frequency prediction of itemsets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑