Pages that link to "Item:Q5868044"
From MaRDI portal
The following pages link to Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables (Q5868044):
Displaying 4 items.
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
- The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts (Q2096566) (← links)
- On the complexity of redescription mining (Q2680177) (← links)
- Rough Sets and Current Trends in Computing (Q5394720) (← links)