摘要
串行关系是能区分上下近似的最低要求.本文在串行关系下研究粗糙集理论,讨论串行粗糙集的特征性质及计算方法,并把相关结论推广到串行粗糙模糊集上,得出串行粗糙模糊集上下近似算子的有趣性质和简洁算法.
The serial binary relation is the weakest one that allows lower and upper approximation operators. This paper examines approaches of rough sets with finite universe based on the use of serial relation. New properties and algorithms of this lower and upper approximation are established. We then extended these results to fuzzy sets.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
2004年第4期506-509,共4页
Pattern Recognition and Artificial Intelligence
基金
教育部留学归国人员专项研究(No.010201)
教育部科学技术重点(No.01043)
关键词
模糊集
串行粗糙集
串行粗糙模糊集
粗糙度
Fuzzy Sets
Serial Rough Sets
Serial Rough Fuzzy Sets
Roughness Measures
