Statistical Pruning of Discovered Association Rules

Dario Bruzzese and Cristina Davino
Additional contact information
Dario Bruzzese: Università degli Studi di Napoli“Federico II”
Cristina Davino: Università degli Studi di Napoli“Federico II”

Computational Statistics, 2001, vol. 16, issue 3, No 6, 387-398

Abstract: Summary Nowadays mining association rules in a database is a quite simple task; many algorithms have been developed to discover regularities in data. The analysis and the interpretation of the discovered rules are more difficult or almost impossible, given the huge number of generated rules. In this paper we propose a three step strategy to select only interesting association rules after the mining process. The proposed approach is based on the introduction of statistical tests in order to prune logical implications that are not significant.

Keywords: association rules; support; confidence; significance tests (search for similar items in EconPapers)
Date: 2001
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s001800100074 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:compst:v:16:y:2001:i:3:d:10.1007_s001800100074

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2

DOI: 10.1007/s001800100074

Access Statistics for this article

Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik

More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().