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

基于二进制的粗糙集基本运算研究
引用本文:李天志,梁家荣,范平,徐凤生.基于二进制的粗糙集基本运算研究[J].广西科学,2006,13(2):109-112.
作者姓名:李天志  梁家荣  范平  徐凤生
作者单位:1. 德州学院计算机系,山东德州,253023;广西大学计算机与电子信息学院,广西南宁,530004
2. 广西大学计算机与电子信息学院,广西南宁,530004
3. 德州学院计算机系,山东德州,253023
基金项目:国家自然科学基金(批准号:60564001),广西“十百千人才工程”专项基金(2003207)联合资助
摘    要:通过讨论二进制与粗糙集之间的内在联系,提出基于二进制的粗糙集运算理论,并借助二进制的位运算操作,给出粗糙集的上近似集和下近似集、等价类的交、集合的基数的运算算法.该算法比传统的粗糙集运算算法的运算速度更快,效率更高.该算法为扩展粗糙集的应用提供了理论基础.

关 键 词:粗糙集  算法  上近似集  下近似集  基数
文章编号:1005-9164(2006)02-0109-04
收稿时间:2005-12-30
修稿时间:2005年12月30

Research of Rough Set Basic-Operations Based on Binary
LI Tian-zhi,LIANG Jia-rong,FAN Ping and XU Feng-sheng.Research of Rough Set Basic-Operations Based on Binary[J].Guangxi Sciences,2006,13(2):109-112.
Authors:LI Tian-zhi  LIANG Jia-rong  FAN Ping and XU Feng-sheng
Institution:1. Department of Computer Science and Technology, Dezhou University, Dezhou, Shandong, 253023, China ; 2. College of Computer and Electronic Information, Guangxi University, Nanning, Guangxi, 530004 ,China
Abstract:A novel idea of binary-based rough set operation is presented through analyzing the internal relation between binary and rough set.And several rough set operation algorithms are also offered in this paper,such as upper approximation set,lower approximation set,intersection,cardinal number and so on.These algorithms are more efficient and effective compared to the traditional methods for operating rough set.It provides the theoretical foundation to expand application of rough set.
Keywords:rough set  algorithm  upper approximation set  lower approximation set  cardinal number
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《广西科学》浏览原始摘要信息
点击此处可从《广西科学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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