MIS-Tree Algorithm for Mining Association Rules with Multiple Minimum Supports

Mining association rules with multiple minimum supports are an important generalization of the association-rule-mining problem. Instead of setting a single minimum support threshold for all items, they allow users to specify multiple minimum supports to reflect the natures of the items, and an Apriori-based algorithm, named MSapriori, is widely used to mine all frequent itemsets. In this paper the FP-tree-like structures, MIS-tree is widely used to store the crucial information about frequent patterns. The benefit of MIS-tree is it avoids rescanning and finds the different frequent itemsets.