Association Reducts: Complexity and Heuristics

DOI10.1007/11908029_18zbMATH Open1162.68573OpenAlexW2125600874MaRDI QIDQ3535447FDOQ3535447

Authors: Dominik Ślęzak 

Publication date: 13 November 2008

Published in: Rough Sets and Current Trends in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11908029_18

Recommendations

• Association Reducts: A Framework for Mining Multi-attribute Dependencies
• Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
• scientific article; zbMATH DE number 1440081
• Association Reducts: Boolean Representation
• scientific article; zbMATH DE number 23766

zbMATH Keywords

reductsapproximationsassociationsattributes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cited In (4)

• On generalized decision functions: reducts, networks and ensembles
• A Rough-Set Based Solution of the Total Domination Problem
• Association Reducts: A Framework for Mining Multi-attribute Dependencies
• Association Reducts: Boolean Representation

This page was built for publication: Association Reducts: Complexity and Heuristics

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