Weighted Concise Association Rules Generation Under Weighted Support Framework
Association rules tell us interesting relationships between different items in transaction database. But traditional association rule has two disadvantages. Firstly it assumes every two items have same significance in database, which is unreasonable in many real applications and usually leads to incorrect results. On the other hand, traditional association rule representation contains too much redundancy which makes it difficult to be mined and used. This paper addresses the problem of mining weighted concise association rules based on closed itemsets under weighted support-significant framework, in which each item with different significance is assigned different weight. Through exploiting specific technique, the proposed algorithm can mine all weighted concise association rules while duplicate weighted itemset search space is pruned. As illustrated in experiments, the proposed method leads to good results and achieves good performance.
weighted concise association rule closed itemset support-significant algorithm
Bingzheng Wang Xueli Wu Haodong Zhu
School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou, China 450002
国际会议
哈尔滨
英文
2403-2408
2011-12-24（万方平台首次上网日期，不代表论文的发表时间）