Study on association rules with negative items based on bit string
Yufang Zhang · Kongzhi yu juece · 2010
A bit string for each node of the frequent pattern tree is imported to store the prefix.A method for constructing frequent pattern tree which contains positive and negative items is proposed,and frequent item sets with negative items are mined through extending frequent patterns on the tree.Comparing to direct using FP-growth algorithms,this algorithm needs not expand negative item to original database,and construct or destruct additional data structures,which only makes some changes on the original frequent pattern tree,so it has certain advantages in time and space costs.Experiments show that the algorithm has better efficiency than the existing similar mining algorithms and direct FP-growth algorithms.