Rough sets and association rules -- which is efficient?

DOI10.1007/978-3-642-57489-4_81MaRDI QIDQ3298742zbMATH OpenOpenAlexFDO

Authors Daniel Delic, Hans-J. Lenz, Mattis Neiling

Publication date 15 July 2020

Published in Compstat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-57489-4_81

zbMATH Keywords

apriori algorithmassociation rulesbitmapshybrid association rules induction schemerough sets

Mathematics Subject Classification ID

Applications of rough analysis (60L90) Computational methods for problems pertaining to statistics (62-08)

Recommendations

• scientific article; zbMATH DE number 1435947
• Association Rules Using Rough Set and Association Rule Methods
• An algorithm of mining association rules with decision attributes based on rough sets and its' optimization methods
• Approach for mining association rules based on rough set
• scientific article; zbMATH DE number 1303638

Cites work

• Rough sets

Cited in

(8)

• scientific article; zbMATH DE number 1696703 (Why is no real title available?)
• Mining Rough Association from Text Documents
• ACBC-adequate association and decision rules versus key generators and rough sets approximations
• Association Rules Using Rough Set and Association Rule Methods
• scientific article; zbMATH DE number 1931873 (Why is no real title available?)
• scientific article; zbMATH DE number 2096809 (Why is no real title available?)
• An algorithm of mining association rules with decision attributes based on rough sets and its' optimization methods
• Introducing a Rule Importance Measure

This page was built for publication: Rough sets and association rules -- which is efficient?

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