一种交互式可约束的最小关联规则集挖掘算法

An interactive algorithm for mining the smallest association rule set under constraints

给出三类约束 ,并讨论了约束的反单调性 ,实现了一种交互式的可约束的最小关联规则集挖掘算法 。

Mining of association rules is considered to be one of the most important data mining task. A convenient and efficient algorithm is what users like. Three kinds of constraints and anti monotonicity were discussed. An interactive algorithm for mining the smallest rule set under constraints was presented. Our analysis shows that it works more efficiently.