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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|