Propositional satisfiability method in rough classification modeling for data mining
The fundamental problem in data mining is whether the whole information available is always necessary to represent the information system (IS). The goal of data mining is to find rules that model the world sufficiently well. These rules consist of conditions over attributes value pairs called des...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English English |
| Published: |
2002
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/8678/1/FSKTM_2002_1%20IR.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|