| 一种新的属性约简算法 |
| |
| 引用本文： | 杨宝华. 一种新的属性约简算法[J]. 微机发展, 2006, 16(5): 80-81 |
| |
| 作者姓名： | 杨宝华 |
| |
| 作者单位： | 安徽农业大学信息与计算机学院 安徽合肥230036 |
| |
| 基金项目： | 安徽省教育厅资助项目(2003kj117)，高校青年基金资助项目(2003) |
| |
| 摘 要： | 粗集是一种处理模糊和不确定性数据的工具,属性约简和核是粗集理论的核心内容,经过约简后的数据更有价值,更能准确地获取知识。很多属性约简算法以核为起点,计算繁杂。文中提出并分析了后删除属性约简算法,该算法不需要计算核,节约时间,减少占用空间,简化求解过程。文中以实例验证了算法的正确性。
|
| 关 键 词： | 粗集 算法 属性约简 |
| 文章编号： | 1673-629X(2006)05-0080-02 |
| 修稿时间： | 2005-08-21 |
A New Attribute Reducing Algorithm |
| |
| YANG Bao-hua. A New Attribute Reducing Algorithm[J]. Microcomputer Development, 2006, 16(5): 80-81 |
| |
| Authors: | YANG Bao-hua |
| |
| Abstract: | Rough set is a tool in analyzing and processing a fuzzy and uncertain data.Attribute reduction and core are the kernel contents of Rough set.Data after reduction is more valuable and can obtain knowledge more accurately.Many algorithms about attribute reduction take the core as the beginning,the computation is complicated.The reduction algorithm of deleting the rear attribute is proposed and analyzed which does not need core calculating and can save time and space and simplify the solving process as well.And the algorithm is verified exactly with the instance in this paper. |
| |
| Keywords: | rough set algorithm attribute reduction |
| 本文献已被 CNKI 等数据库收录！ |
