期刊名称：Bonfring International Journal of Data Mining
印刷版ISSN：2250-107X
电子版ISSN：2277-5048
出版年度：2011
卷号：1
期号：Inaugural Special Issue
页码：01-05
DOI：10.9756/BIJDM.I1001
语种：English
出版社：Bonfring
摘要：Mining association rules with multiple minimum supports is 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.
关键词：Data mining; Association rules; Minimum Support; FP-Tree
