Discussion on algorithm for mining interesting association rule
ZHANG Jian-wei
ZHANG Su-zhi
ZHANG Yao
ZHANG Mei-feng
Abstract：Apriori is recognized as an efficient tool for mining association rule from large database, but there are two problems existing in it. Firstly, it is probable that a rule will be uninteresting, even be false even if it possesses h igh confidence and support; secondly, it can’t produce a rule with negative ite ms. Thus improved scheme presented here on Apriori is introducing interest me asure’s third threshold value—correlation support and adding negative items to original itemsets. The improved algorithm can fairly solve these problems.
Machine-generated Keywords：
Publication Date：2001-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：3( 32-34 )