Efficient Weighted Association Rule Mining using Lattice

摘要：

　　In the problem of discovering weighted association rules(WAR),the number of rules is often very large and they contain some redundant rules,the process of mining can be very time consuming.In this paper,we present an application of lattice in mining WAR which will reduce greatly the time and quantity of mining rules.Our method includes three phases:(1)Generating the frequent closed itemsets(FCI)using indiscernibility matrix.(2)Building frequent weighted closed itemsets lattice(FWCIL)based on FCI.(3)Mining WAR from lattice.It is shown by experimental results that our approach not only results in shorter average execution times,but also remove some redundant rules than the generalization of previous known methods on quantitative association rules.

关键词： Weighted Association Rule Frequent Weighted Closed Itemsets Lattice Indiscernibility Matrix

作者: Zhai Yue Wang Lijuan Wang Ning

作者单位: Information Science Department,Dalian Institute of Science and Technology,Liaoning,China

会议类型: 国际会议

会议名称: 第26届中国控制与决策会议(2014 CCDC)

会议地点: 长沙

会议语种:英文

页码: 4913-4917

在线出版日期: 2014-05-31（万方平台首次上网日期，不代表论文的发表时间）