Support Approximations Using Bonferroni-Type Inequalities.
PKDD '02: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery(2002)
摘要
The purpose of this paper is to examine the usability of Bonferroni-type combinatorial inequalities to estimation of support of itemsets as well as general Boolean expressions. Families of inequalities for various types of Boolean expressions are presented and evaluated experimentally.
更多查看译文
关键词
Boolean expression,general Boolean expression,Bonferroni-type combinatorial inequality,various type,Bonferroni-Type Inequalities
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络