Propositional satisfiability algorithm to find minimal reducts for data mining
A fundamental problem in data mining is whether the whole information available is always necessary to represent the information system(TS). Reduct is a rough set approach in data mining that determines the set of important attributes to represent the IS. The search for minimal reduct is based on th...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
2002
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/116270/ https://www.tandfonline.com/doi/abs/10.1080/00207160210938 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|