The measures and mining method of credible association rule
Bo Justin Xiao, Qianfang Xu, Zhiqing Lin, Jun Guo · 2009
Credible association rule(CAR) is a new type of association pattern in which items are highly affiliated with each other. The presence of an item in one transaction strongly implies the presence of every other item in the same CAR. And a maximal CAR is a CAR whose each superset isn't a CAR, so the maximal CAR specifies a more compact representation of a group of CARs. In this paper, we introduce some measures for CAR which all represent the affinity of the items in a CAR. A mining method based on maximal clique is also presented to mine all of the maximal CARs. The experimental results demonstrate that the mining method is more effective than the other stand mining methods for association rules.