计算机工程与应用2011，Vol.47Issue(7)：131-134,4.DOI:10.3778/j.issn.1002-8331.2011.07.038
基于属性位复用的约束性关联规则挖掘算法
Constraint association rule mining algorithm based on attribute location multiplexing
王佳乐 1顾幼瑾1
作者信息
- 1. 昆明理工大学管理与经济学院,昆明,650093
- 折叠
摘要
Abstract
When extracting association rule to meet specific demand given by user, as the existing constraint association rules mining algorithms have superfluous candidate and repeated computing. Constraint association rule mining algorithm based on attribute location multiplexing is proposed, which is suitable for mining any long association rule to meet specific demand given by user. The algorithm turns transaction into integer by weights combination of attribute location,and uses attribute location multiplexing to create candidate interval,and uses value of its endpoints to double vary to generate indexical candidate frequent item sets,and uses Boolean operation to compute support. This experiment indicates that the efficiency is faster than the existing algorithms. The algorithm fast improves the efficiency when it is applied to customer relationship management system to analyze custom association.关键词
属性位复用/双向搜索/候选区间/约束条件/关联规则Key words
attribute location multiplexing/double search/candidate interval/constraint condition/association rules分类
信息技术与安全科学引用本文复制引用
王佳乐,顾幼瑾..基于属性位复用的约束性关联规则挖掘算法[J].计算机工程与应用,2011,47(7):131-134,4.
