作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2000, Vol. 26 ›› Issue (04): 68-.

• 论文 • 上一篇    下一篇

关于采掘广义关联规则的两个算法及其比较

齐琳,于玉   

  1. 复旦大学计算机系 上海 200433,复旦大学计算机系 上海 200433
  • 发布日期:2000-04-25

Two Algorithms about Mining Generalized Association Rules and Their Comparison

Qiao Lin, Yu Yu   

  1. (Computer Science Department of Fudan University, Shanghai 200433)
  • Published:2000-04-25

摘要: 描述了分类和广义关联规则的概念及采掘广义关联规则的问题。首先叙述了问题解决的基本算法。随后提出了累积算法,它的优化处理和算法过程。最后通过一组实验显示两个算法的比较结果。图表显示累积算法明显优于基本算法。

关键词: 分类, 广义关联规则, 基本算法, 累积算法

Abstract: This thesis introduces the concept of taxonomy and generalized association rules and the problem of mining generalized association rules. First, I describe the basic algorithm. Then I put forward the cumulate algorithm, its optimization and procedure of algorithm. At last. I compare these two algorithms with a set of experiments. The charts of result exhibit that the performance of cumulate algorithm is much better than basic algorithm.

中图分类号: