A New Algorithm Based on Matrix for Mining Inter- Transaction Association Rules

摘要：

The traditional studies on mining association rules are on mining intra-transaction associations. In this study, we extend scope of mining association rules from traditional intratransaction associations to inter-transaction associations. Mining inter-transaction associations poses more challenges on efficient processing than mining intra-transaction associations because the number of potential association rules becomes extremely large. In this study, we introduce the notion of intertransaction association rule, define its measurements: support and confidence, then we design a new matrix data structure, called Co-Occurrence Matrix, in short COM, to store the data information instead of directly using the transactional database and develop an efficient algorithm MMIT(an acronym for Matrix Mining Inter-transaction) based on COM, for mining inter-transaction associations. We compare MMIT with FITI the best algorithms presented by other researchers in previous studies and demonstrate MMIT is more efficient than FITI.

关键词： Association rule Frequent itemset intra-transaction inter-transaction Co-Occurrence Matrix

作者: ZHENG ZHANG HUI-WEN WANG GUO-CHANG HUANG

作者单位: School of Economics and Management Beihang University Beijing, P.R.China School of Computer Science and Engineering Beihang University Beijing, P.R.China

会议类型: 国际会议

会议名称: 第三届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 上海

会议语种:英文

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