首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于布尔矩阵的属性约简方法
引用本文:黄龙军,章志明,周才英,黄明和. 一种基于布尔矩阵的属性约简方法[J]. 计算机工程与应用, 2006, 42(34): 160-161,181
作者姓名:黄龙军  章志明  周才英  黄明和
作者单位:江西师范大学,软件学院,南昌,330022;江西理工大学,理学院,江西,赣州,341000
基金项目:国家自然科学基金;江西师范大学校科研和教改项目;江西师范大学校科研和校改项目
摘    要:简单介绍了Rough理论及相关概念,分析了A.Skowrond的分明矩阵法以及改进方法。提出了一种基于布尔矩阵的属性约简方法,本方法用布尔矩阵来保存由信息系统直接生成的邻域分明全合取范式,减少了存储空间,提高了计算效率。

关 键 词:Rough集  分明矩阵  数据约简  布尔矩阵
文章编号:1002-8331(2006)34-0160-02
收稿时间:2006-05-01
修稿时间:2006-05-01

Method of Data Reduction Based on Boolean Matrix
HUANG Long-jun,ZHANG Zhi-ming,ZHOU Cai-ying,HUANG Ming-he. Method of Data Reduction Based on Boolean Matrix[J]. Computer Engineering and Applications, 2006, 42(34): 160-161,181
Authors:HUANG Long-jun  ZHANG Zhi-ming  ZHOU Cai-ying  HUANG Ming-he
Affiliation:1.College of Software,Jiangxi Normal University, Nanchang 330022, China; 2.Facuhy of Science,Jiangxi University of Science and Technology,Ganzhou,Jiangxi 341000,China
Abstract:This article simply introduced the Rough theory and relevant concepts,then analyzed the discernible matrix method by A.Skowrond and it's improving.We proposed a method of data reduction based on boolean matrix,this method use boolean matrix to save the neighbor valued discernible Conjunction normal form produced directly by the information system,this method can reduce the memory space,and improve computational efficiency.
Keywords:Rough Set    discernibility matrix    data reduction    boolean matrix
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号