arrow
Return

Algorithms for computing association rules using a partial-support tree

delete2000-04-01
delete39
PRE
AI
F
Frans Coenen
DOI:10.1016/S0950-7051(00)00055-1delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
association rules
partial support
set enumeration

Journal

K
Knowledge-Based Systems
IF:
7.6
Papers:
1.3W
Citations:
5.9W

Organization

No organization information available
Cited Papers

Cited Papers

Observations on the Offshore Reef and Platform Fish Fauna of Louisiana
err1976-03-12
err0
PREAI
errFarley Sonnier; Joyce Teerling; H. Dickson Hoese
errShare
errSave
Influence of the Total Porosity on the Properties of Sintered Materials—A Review
err2021-04-28
err0
errOAAI
errFátima Ternero; Luís Guerra Rosa; Petr Urban; Juan Manuel Montes; Francisco G. Cuevas
errShare
errSave