| 基于优势区分矩阵的求核方法 |
| |
| 引用本文： | 石为人,李伟湋,贾修一.基于优势区分矩阵的求核方法[J].计算机工程,2008,34(16):28-30. |
| |
| 作者姓名： | 石为人 李伟湋 贾修一 |
| |
| 作者单位： | 1. 重庆大学自动化学院,重庆,400030
2. 南京大学计算机科学与技术系软件新技术国家重点实验室,南京,210093 |
| |
| 基金项目： | 重庆市科委自然科学基金资助项目
,
重庆市科委科技攻关基金资助项目 |
| |
| 摘 要： | 在提出基于优势关系粗糙集方法下的类区分矩阵概念后，为解决不一致数据问题，新的优势区分矩阵定义及其求核方法被提出，但是该方法计算代价高。为了能够快速求出存在不一致数据的信息系统的核，该文给出改进的优势区分矩阵定义和求核算法，其空间和时间复杂度都优于现有的算法。实验证明，该算法适用于处理大数据集。
|
| 关 键 词： | 粗糙集 属性约简 优势区分矩阵 核 |
| 修稿时间： | |
Computation of Core Based on Dominance Discernibility Matrix |
| |
| SHI Wei-ren,LI Wei-wei,JIA Xiu-yi.Computation of Core Based on Dominance Discernibility Matrix[J].Computer Engineering,2008,34(16):28-30. |
| |
| Authors: | SHI Wei-ren LI Wei-wei JIA Xiu-yi |
| |
| Affiliation: | (1. College of Automation, Chongqing University, Chongqing 400030; 2. National Key Laboratory for Novel Software Technology, Dept. of Computer Science and Technology, Nanjing University, Nanjing 210093) |
| |
| Abstract: | The attributes core of a decision table is the start point to many existing algorithms of attributes reduction. In order to solve the inconsistent data problem, A new discernibility matrix definition based on Dominance based Rough Set Approach(DRSA) and the computation of core is proposed, but it is too complex. An improved discernibility matrix definition with a method for computing the core is introduced, which can get the right core with low space and time complexity. Experimental results prove the effectiveness of the algorithm, and it suits the large data. |
| |
| Keywords: | rough set attributes reduction dominance discernibility matrix core |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
