0


相关项集挖掘在ROC空间:一个约束规划方法

Correlated Itemset Mining in ROC Space: A Constraint Programming Approach
课程网址: http://videolectures.net/kdd09_nijssen_cimir/  
主讲教师: Siegfried Nijssen
开课单位: 鲁汶大学
开课时间: 2009-09-14
课程语种: 英语
中文简介:
相关或判别模式挖掘涉及寻找最高得分模式. t. 相关度量 (如信息增益)。通过重新解释 roc 空间中的相关度量, 并将相关项集挖掘作为约束规划问题, 获得了具有实际效益的新的理论见解。更具体地说, 我们贡献了 1) 相关项集矿工的改进绑定; 2) 利用绑定的新的迭代修剪算法, 以及 3) 该算法的适应性, 以挖掘 roc 空间凸壳上的所有项集。该算法不依赖于最小频率阈值, 并被证明在运行时和内存要求中都优于几个可替代的方法数量级。
课程简介: Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting correlation measures in ROC space and formulating correlated itemset mining as a constraint programming problem, we obtain new theoretical insights with practical benefits. More specifically, we contribute 1) an improved bound for correlated itemset miners, 2) a novel iterative pruning algorithm to exploit the bound, and 3) an adaptation of this algorithm to mine all itemsets on the convex hull in ROC space. The algorithm does not depend on a minimal frequency threshold and is shown to outperform several alternative approaches by orders of magnitude, both in runtime and in memory requirements.
关 键 词: 频繁项集挖掘; 算法; 数据挖掘
课程来源: 视频讲座网
最后编审: 2020-06-04:张荧(课程编辑志愿者)
阅读次数: 32