Using Multiple Minimum Support to Auto-adjust the Threshold of Support in Apriori Algorithm
暂无分享,去创建一个
[1] Vincent S. Tseng,et al. Mining Top-K Association Rules , 2012, Canadian Conference on AI.
[2] Taoufiq Gadi,et al. A New Method to Select the Interesting Association Rules with Multiple Criteria , 2017 .
[3] Jianyong Wang,et al. Mining sequential patterns by pattern-growth: the PrefixSpan approach , 2004, IEEE Transactions on Knowledge and Data Engineering.
[4] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[5] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.
[6] Tzung-Pei Hong,et al. Mining association rules with multiple minimum supports using maximum constraints , 2005, Int. J. Approx. Reason..
[7] Jian Pei,et al. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
[8] R. J. Kuo,et al. Application of particle swarm optimization to association rule mining , 2011, Appl. Soft Comput..
[9] Vincent S. Tseng,et al. Mining Top-K Non-redundant Association Rules , 2012, ISMIS.
[10] Engelbert Mephu Nguifo,et al. Mining Undominated Association Rules Through Interestingness Measures , 2014, Int. J. Artif. Intell. Tools.
[11] Wynne Hsu,et al. Mining association rules with multiple minimum supports , 1999, KDD '99.
[12] Yen-Liang Chen,et al. Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism , 2004, Decision Support Systems.
[13] Lars Schmidt-Thieme,et al. Algorithmic Features of Eclat , 2004, FIMI.