Algorithms for computing association rules using a partial-support tree

被引：33

作者：

Goulbourne, G ^{[1
]}

Coenen, F ^{[1
]}

Leng, P ^{[1
]}

机构：

[1] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England

来源：

KNOWLEDGE-BASED SYSTEMS | 2000年 / 13卷 / 2-3期

关键词：

association rules; partial support; set enumeration;

D O I：

10.1016/S0950-7051(00)00055-1

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents new algorithms for the extraction of association rules from binary databases. Most existing methods operate by generating "candidate" sets, representing combinations of attributes which may be associated, and then testing the database to establish the degree of association. This may involve multiple database passes, and is also likely to encounter problems when dealing with "dense" data due to the increase in the number of sets under consideration. Our method uses a single pass of the database to perform a partial computation of support for all sets encountered in the database, storing this in the form of a set enumeration tree. We describe algorithms for generating this tree and for using it to generate association rules. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：141 / 149

页数：9