Mining Association Rules from Tabular Data Guided by Maximal Frequent Itemsets

DOI10.1007/11362197_7MaRDI QIDQ5701396zbMATH OpenOpenAlexFDO

Authors

Publication date 3 November 2005

Published in Foundations and Advances in Data Mining (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11362197_7

zbMATH Keywords

hash tree counting method

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 2112477
• TBAR: An efficient method for association rule mining in relational databases
• An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
• Efficient mining of association rules based on formal concept analysis
• Efficient association rule mining among both frequent and infrequent items

Cited in

(2)

• Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
• scientific article; zbMATH DE number 2088077 (Why is no real title available?)

This page was built for publication: Mining Association Rules from Tabular Data Guided by Maximal Frequent Itemsets

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