| 基于决策树的不完备信息系统的规则提取方法 |
| |
| 引用本文： | 李海涛,章德斌. 基于决策树的不完备信息系统的规则提取方法[J]. 计算机工程与科学, 2007, 29(10): 68-69 |
| |
| 作者姓名： | 李海涛 章德斌 |
| |
| 作者单位： | 燕山大学信息科学与工程学院,河北,秦皇岛,066004;河北省教育考试院,河北,石家庄,050091 |
| |
| 摘 要： | 规则提取是RST中一个重要的研究方向,本文提出了不完备信息系统的相对正域的概念,通过简单的集合运算就可以求得相对正域;利用相对正域选择决策树的结点,构造一棵决策树,完成对不完备信息系统的规则提取。
|
| 关 键 词： | 不完备信息系统 约简 规则提取 决策树 |
| 文章编号： | 1007-130X（2007）10-0068-02 |
| 修稿时间： | 2007-03-292007-07-09 |
Mining Rules in Incomplete Information Systems Based on Decision Trees |
| |
| LI Hai-tao,ZHANG De-bin. Mining Rules in Incomplete Information Systems Based on Decision Trees[J]. Computer Engineering & Science, 2007, 29(10): 68-69 |
| |
| Authors: | LI Hai-tao ZHANG De-bin |
| |
| Affiliation: | 1. School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004; 2. Hebei Provincial Examination Academy,Shijiazhuang 050091 ,China |
| |
| Abstract: | An important part in rough set theory is rule mining. In this paper,a method of mining rules from incomplete information systems based on the relative positive region is put forward. It can select nodes by calculating the relative positive region,and mining rules by the operation of set. |
| |
| Keywords: | incomplete information system reduction rule mining decision tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载免费的PDF全文 |
