| 基于决策支持度的不完备信息系统约简算法 |
| |
| 引用本文： | 陶志,商维,李卫民.基于决策支持度的不完备信息系统约简算法[J].中山大学学报(自然科学版),2007,46(2):23-26. |
| |
| 作者姓名： | 陶志 商维 李卫民 |
| |
| 作者单位： | 中国民航大学理学院 天津300300 |
| |
| 基金项目： | 国家自然科学基金;中国民航大学博士启动基金 |
| |
| 摘 要： | 提出了一种基于决策属性支持度的属性相对约简算法。通过引入决策属性支持度对不完备决策表中属性的重要性进行了定义,并以此作为启发信息进行属性的选择,该算法的时间复杂度是多项式的。寻找决策表中最小相对约简问题是典型的NP-hard问题,采用该算法可降低问题复杂度。通过实例说明,该算法能得到不完备决策表的最小相对约简。
|
| 关 键 词： | 粗糙集 决策属性支持度 不完备决策表 属性约简 |
| 文章编号： | 0529-6579（2007）02-0023-04 |
| 修稿时间： | 2006-05-06 |
Knowledge Reduction Based on Decision Attribute Support Degree under Incomplete Information System |
| |
| TAO Zhi,SHANG Wei,LI Wei-min.Knowledge Reduction Based on Decision Attribute Support Degree under Incomplete Information System[J].Acta Scientiarum Naturalium Universitatis Sunyatseni,2007,46(2):23-26. |
| |
| Authors: | TAO Zhi SHANG Wei LI Wei-min |
| |
| Institution: | Civil Aviation University of China Science College, Tianjin 300300, China |
| |
| Abstract: | A kind of attribute relative reduction for decision attribute support degree was proposed.States the significance of attributes in the incomplete decision table by introducing decision attribute support degree,which is then used as heuristic information for selecting attributes,this algorithm has a polynomial time complexity.Seeking the minimal relative reduction in a decision table is typically a NP-hard problem,and its complexity can be reduced by using the algorithm provided in this paper.An example shows this algorithm can achieve the minimal relative reduction of incomplete decision table. |
| |
| Keywords: | rough set decision attribute support degree incomplete decision table attribute reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
