Finding association rules with some very frequent attributes

DOI10.1007/3-540-45681-3_9MaRDI QIDQ4406013zbMATH OpenFDO

Authors Frans Coenen, Paul H. Leng

Publication date 25 June 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/2431/24310099.htm

zbMATH Keywords

Association RulesDense dataFrequent sets

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Algorithms for association rules
• Mining association rules for a large data sets
• scientific article; zbMATH DE number 1041844
• scientific article; zbMATH DE number 2084826
• Computing association rules using partial totals

Cited in

(2)

• Combined use of association rules mining and clustering methods to find relevant links between binary rare attributes in a large data set
• Discovering all associations in discrete data using frequent minimally infrequent attribute sets

This page was built for publication: Finding association rules with some very frequent attributes

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