Improved algorithm of mining association rules with negative items
Zhongyang Xiong · Computer Engineering and Applications Journal · 2008
While mining generalizing association rules with negative items,the search space becomes more significant because of the introduction of negative items,and the number of negative association rules also becomes greater.But many of them are uninteresting,even wrong.Therefore a concept named maximum support is introduced,which is used to bind the frequent items mined,and exclude meaningless association rules.It can improve the efficiency at the same time.Respective minimum support thresholds are used for positive and negative items,making mining more flexible.Experiments indicate that the improvement is valid.