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

CS(K)上的S-粗集特征
引用本文:张春英,薛佩军,刘保相. CS(K)上的S-粗集特征[J]. 山东大学学报(理学版), 2006, 41(2): 18-23
作者姓名:张春英  薛佩军  刘保相
作者单位:河北理工大学,理学院,河北,唐山,063009;山东大学,数学与系统科学学院,山东,济南,250100
摘    要:对CS(K)(概念格)上的概念结点进行等价类划分,分析了概念格的粗集特征和S-粗集特征,给出了概念格上粗集和S-粗集的定义及其相应定理,找出概念格与粗集、S-粗集之间的关系,并通过实例说明了CS(K)上的S-粗集特征.

关 键 词:S-粗集  概念格  f-扩张  (-f)-萎缩
文章编号:1671-9352(2006)02-0018-06
收稿时间:2005-08-27
修稿时间:2005-08-27

The characteristic of S-rough sets on CS(K)
ZHANG Chun-ying,XUE Pei-jun,LIU Bao-xiang. The characteristic of S-rough sets on CS(K)[J]. Journal of Shandong University, 2006, 41(2): 18-23
Authors:ZHANG Chun-ying  XUE Pei-jun  LIU Bao-xiang
Affiliation:1. College of Sci., Hebei Polytechnic Univ., Tangshan 063009, Hebei, China; 2. School of Math. and System Sci., Shandong Univ., Jinan 250100, Shandong, China
Abstract:According to the equivalence class,the concept nodes of CS(K)(Concept Lattice) are partitioned.The characteristics of rough sets and S-rough sets are analyzed.The definitions of rough sets and S-rough sets on CS(K) are given and the related theorem is presented.The relation between the concept lattice and S-rough sets is found.At last,the characteristics of S-rough sets are illnstrated with an example.
Keywords:S-rough sets   concept lattice   f-dilation   f^--reduction
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《山东大学学报(理学版)》浏览原始摘要信息
点击此处可从《山东大学学报(理学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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