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

Two Algorithms about Mining Generalized Association Rules and Their Comparison

作　　者：齐琳 于玉[1] 

机构地区：[1]复旦大学计算机系,上海200433

出　　处：《计算机工程》2000年第4期68-69,88,共3页Computer Engineering

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

关 键 词：分类 广义关联规则 累积算法 数据采掘 数据库 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]