| 摘要: |
| 通过对分类数据的深入研究,提出了一种高效的多层关联规则挖掘方法:首先,根据分类数据所在的领域知识构建基于领域知识的项相关性模型DICM(domain knowledge-based item correlation model),并通过该模型对分类数据的项进行层次聚类;然后,基于项的聚类结果对事务数据库进行约简划分;最后,将约简划分后的事务数据库映射至一种压缩的AFOPT 树形结构,并通过遍历AFOPT 树替代原事务数据库来挖掘频繁项集.由于缩小了事务数据库规模,并采用了压缩的AFOPT结构,所提出的方法 |
| 关键词: 分类数据 多层关联规则 概化关联规则 层次聚类 约简划分 |
| DOI：10.3724/SP.J.1001.2011.03907 |
| 分类号: |
| 基金项目:国家自然科学基金重大研究计划重点项目(90818023); 国家重点基础研究发展计划(973)(2005CB321905) |
|
| Efficient Method for Mining Multiple-Level and Generalized Association Rules |
|
MAO Yu-Xing, CHEN Tong-Bing, SHI Bai-Le
|
|
School of Computer Science, Fudan University, Shanghai 200433, China
|
| Abstract: |
| This paper proposes a idea for mining multiple-level and generalized association rules. First, an item correlation model is set up, based on the domain knowledge and clusters the items according to their correlation. Secondly, the transaction database, based on the item clusters, are reduced which make the transaction database smaller. Finally, the partitioned transaction databases are projected onto a compact structure called AFOPT-tree and find the frequent itemsets from the AFOPT. Based on the proposed idea, this paper proposes a top-down algorithm TD-CBP-MLARM and a bottom-up algorithm BU-CBP-MLARM to mine the multiple-level association rules. Additionally, this paper extends the idea to a generalized mining association rule and gives a new efficient algorithm CBP-GARM. The experiments show that the proposed algorithms not only corrects and completes mining results, but also outperform the well-known and current algorithms in mining effectiveness. |
| Key words: taxonomy data multiple-level association rule generalized association rule hierarchical clustering reduction |
