| 不完全决策表的一种信息熵属性约简算法 |
| |
| 引用本文： | 唐彬,李龙澍.不完全决策表的一种信息熵属性约简算法[J].微机发展,2004,14(10):127-130. |
| |
| 作者姓名： | 唐彬 李龙澍 |
| |
| 作者单位： | [1]安徽大学智能计算与信号处理教育部重点实验室，安徽合肥230039 [2]安徽大学计算机科学与工程系，安徽合肥230039 |
| |
| 基金项目： | 国家自然科学基金资助项目(60273043)，安徽省高校拔类人才基金 |
| |
| 摘 要： | 属性约简是粗糙集理论的核心问题之一，也是粗糙集有效算法研究的焦点。为获得最简明的规则集，通常希望能找出最小的属性约简集，但得到最优解NP-hard的问题，通常采取启发式的算法得到近似最优解。文中研究了不完全决策表的属性约简，提出了对不完全决策表的一种基于信息熵的属性约简算法，并通过例子说明算法的具体过程和验证了算法的可行性。对寻找对象的相似类的步骤则在排序和二分查找的基础上提出了一种高效的算法，这样就相应地提高了属性约简算法的效率。
|
| 关 键 词： | 粗糙集 不完全决策表 属性约简 |
| 文章编号： | 1005-3751(2004)10-0127-04 |
| 修稿时间： | 2004年2月20日 |
An Attribute Reduction Algorithm Based on Entropy for Incomplete Decision Table |
| |
| TANG Bin,LI Long-shuignal Processing at Anhui Univ.,Hefei ,China.An Attribute Reduction Algorithm Based on Entropy for Incomplete Decision Table[J].Microcomputer Development,2004,14(10):127-130. |
| |
| Authors: | TANG Bin LI Long-shuignal Processing at Anhui Univ Hefei China |
| |
| Affiliation: | TANG Bin~1,LI Long-shu~2ignal Processing at Anhui Univ.,Hefei 230039,China,2.Department of Computer Science and Engineering,Anhui University,Hefei 230039,China) |
| |
| Abstract: | The attribute reduction is a core problem of the rough set theory,also is the focal point of algorithm research for rough set.In order to get the most simple rule set,people wish to get the smallest attribute reduction set.the attribute reduction algorithm based on information entropy for an incomplete decision table is introduced in the paper. An example is given in the paper to illustrate the steps of the algorithm and to test the feasibility of the algorithm. An efficient algorithm to seek the set of objects similar to the considered object based on sort and binary search is also advanced in the paper and the efficiency of the attribute reduction algorithm is improved accordingly. |
| |
| Keywords: | rough set theory incomplete decision table attribute reduction |
| 本文献已被 CNKI 维普 等数据库收录！ |
