Computing association rules using partial totals

DOI10.1007/3-540-44794-6_5MaRDI QIDQ4802573zbMATH OpenFDO

Authors Frans Coenen, Graham Goulbourne, Paul H. Leng

Publication date 21 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2168/21680054.htm

zbMATH Keywords

association rules

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• Real world association rule mining
• Efficient mining of association rules by reducing the number of passes over the database
• scientific article; zbMATH DE number 1902100
• A heuristic for mining association rules in polynomial time.
• scientific article; zbMATH DE number 1041844

Cited in

(8)

• Mining optimized association rules for numeric attributes
• A new and versatile method for association generation
• A lattice-based approach for I/O efficient association rule mining.
• Finding association rules using fast bit computation: Machine-oriented modeling
• Finding association rules with some very frequent attributes
• scientific article; zbMATH DE number 2015566 (Why is no real title available?)
• Average-Case Performance of the Apriori Algorithm
• Efficient mining of association rules by reducing the number of passes over the database

This page was built for publication: Computing association rules using partial totals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802573)