Parallel mining of association rules

被引：563

作者：

Agrawal, R

Shafer, JC

机构：

[1] IBM Almaden Research Center, San Jose, CA 95120

[2] Department of Computer Science, University of Wisconsin, Madison, WI

来源：

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 1996年 / 8卷 / 06期

关键词：

data mining; association rules; parallel algorithms;

D O I：

10.1109/69.553164

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We consider the problem of mining association rules on a shared-nothing multiprocessor. We present three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem-specific information. The best algorithm exhibits near perfect scaleup behavior, yet requires only minimal overhead compared to the current best serial algorithm.

引用

页码：962 / 969

页数：8

共 12 条

[1] Agarwal R., 1994, P 20 INT C VER LARG, V487, P499
[2] Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[3] AGRAWAL R, 1996, 10004 RJ IBM ALM RES
[4] [Anonymous], 1994, MPI MESS PASS INT ST
[5] Han J., 1995, P 21 INT C VER LARG
[6] HOUSTSMA M, 1995, P INT C DAT ENG TAIP
[7] *INT BUS MACH, 1995, SCAL POW PAR SYST
[8] Mannila H., 1994, Knowledge Discovery in Databases (KDD'94), P181
[9] PARK JS, 1995, P ACM SIGMOD C MAN D
[10] PARK JS, 1995, P 4 INT C INF KNOWL

← 1 2 →