Study on the Application of Multi-level Association Rules Based on Granular Computing
暂无分享,去创建一个
For the issue that classical association rules can not mine multi-level association rules, we proposed a multi-level association rule mining method based on binary information granules in granular computing and multiple minimum supports, and gave the definition of the support and confidence based on binary information granules. In this new association rules method, we can reduce the generation search space of frequent itemsets, extract multi-level association information(including cross-level information), and find more effective rules.
[1] Qing Liu,et al. Reasoning about Information Granules Based on Rough Logic , 2002, Rough Sets and Current Trends in Computing.
[2] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[3] Wen-Yang Lin,et al. Efficient mining of generalized association rules with non-uniform minimum support , 2007, Data Knowl. Eng..
[4] Xu Jian. On Data Ming Algorithms Based on Binary Numeral Granular Computing , 2008 .