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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English English |
| 出版: |
2002
|
| 主題: | |
| 在線閱讀: | http://psasir.upm.edu.my/id/eprint/8678/1/FSKTM_2002_1%20IR.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|