利用抽样技术分布式开采可变精度的关联规则  

DISTRIBUTED MINING ADJUSTABLE ACCURACY ASSOCIATION RULES USING SAMPLING

作　　者：王春花[1] 黄厚宽[1] 

机构地区：[1]北方交通大学计算机科学技术系人工智能研究所,北京100044

出　　处：《计算机研究与发展》2000年第9期1101-1106,共6页Journal of Computer Research and Development

基　　金：铁道部科技研究发展计划基金资助!(项目编号 2 0 0 0 X0 3 0 -A)

摘　　要：关联规则是数据开采的重要研究内容 .利用抽样及元学习技术提出一种快速的分布式开采可变精度的关联规则算法 .为了能获得更准确的结果 ,还给出采用适当缩小最小支持度和扩大全局检测的候选项集等技术的若干改进算法 .最后给出这种方法与类似方法的比较情况 .算法具有效率高和通信量小的特点 ,尤适合于效率比准确性要求更高的场合 .Association rule mining is an important task of data mining. A fast distributed algorithm for mining adjustable accuracy association rules is presented using sampling and meta learning. In order to acquire more complete results, several variants of the algorithm are also discussed by selecting smaller minimum support and extending global candidate itemsets. The method is compared with similar algorithms. The algorithm is more efficient and has less communicated loads, applicable to those applications where the efficiency could be more important than accuracy results.

关 键 词：数据开采 可变精度 关联规则 抽样技术 数据库 

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