| 基于关联度的粗糙集属性约简新方法 |
| |
| 引用本文： | 王萍. 基于关联度的粗糙集属性约简新方法[J]. 南京工业职业技术学院学报, 2008, 8(2): 29-30 |
| |
| 作者姓名： | 王萍 |
| |
| 作者单位： | 南京工业职业技术学院,信息工程系,江苏,南京,210046 |
| |
| 摘 要： | 属性约简是粗糙集应用于数据分析中的重要概念。文章提出了一种以属性的关联度作为启发式信息的属性约简方法，并用实例分析说明了该方法是有效的。
|
| 关 键 词： | 属性的关联度 属性约简 启发式信息 粗糙集 |
An Relationship of Degree Based Algorithm For Attribute Reduction |
| |
| WANG Ping. An Relationship of Degree Based Algorithm For Attribute Reduction[J]. Journal of Nanjing Institute of Industry Technology, 2008, 8(2): 29-30 |
| |
| Authors: | WANG Ping |
| |
| Affiliation: | WANG Ping ( Nanjing Institute of Industry Technology, Nanjing 210046, China ) |
| |
| Abstract: | Attribute reduction is an important concept in rough sets data analysis. In this paper, a new heuristic algorithm which is based on attribute relationship of degree is proposed. An example is given to show its applicant. |
| |
| Keywords: | relationship of degree attribute reduction heuristic knowledge rough sets |
| 本文献已被 维普 万方数据 等数据库收录！ |
