Abstract
We investigate association reducts, which extend previously studied information and decision reducts in capability of expressing dependencies between groups of attributes in data. We formulate optimization problems related to the most informative associations between groups of attributes. We provide heuristic mechanisms for addressing those problems. We also discuss at more general level how to express approximate dependencies between groups of attributes. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Ślȩzak, D. (2006). Association reducts: Complexity and heuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4259 LNAI, pp. 157–164). Springer Verlag. https://doi.org/10.1007/11908029_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
