The following pages link to (Q3982058):
Displaying 11 items.
- On superreducts (Q1198438) (← links)
- Cecylia Rauszer (Q1338477) (← links)
- The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts (Q2096566) (← links)
- Bireducts with tolerance relations (Q2195410) (← links)
- On the complexity of redescription mining (Q2680177) (← links)
- Difference functions of dependence spaces (Q2714408) (← links)
- On the decision table with maximal number of reducts (Q2843959) (← links)
- A Further Investigation to Relative Reducts of Decision Information Systems (Q3300352) (← links)
- Rough Sets and Current Trends in Computing (Q5394720) (← links)
- Rough Sets and Current Trends in Computing (Q5394723) (← links)
- Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables (Q5868044) (← links)