2006, Volume 8, Issue 3
Strategic Study of CAE >> 2006, Volume 8, Issue 3
Approximation Space of Generalization and Rough Classification Algebra
Institute of Automation , Wuhan University of Technology , Wuhan 430070 , China
Next Previous
Abstract
Some new basic concepts are proposed in this paper, including the approximation space of generalization, rough approximation axiom, disturbance set axiom, classification principle of rough set, principle of nondeterministic even set, principle of concentration, game classification, quantum logic classification, bit quantum symmetric classification, incomparable set, bit space set, protocol relation, rough set function of protocol relation, rough classification algebra, rough simple algebra, etc. , and a guess is also proposed. The mathematics viewpoints of knowledge are shown. Based on the protocol relation, the rough quotient algebra and the rough subalgebra are constructed. The avoidance-merge algorithm (A - M algorithm) is presented and an example is given.
Keywords
approximation space of generalization ; rough set ; rough classification algebra ; protocol relation ; rough simple algebra ; rough quotient algebra ; rough subalgebra
Figures
图1
图2
图3
图4
References
[ 1 ] Pawlak Z.Rough sets[J].Inter J Computer and InformSci, 1982, 11 (5) :341~356 link1
[ 2 ] Pawlak Z.Rough clussificution[J].Int J Man-machineStudies, 1984, 20:469~483
[ 3 ] Pawlak Z.Learning from example[J].Bull Pol Acad Sci (Tech Sci) , 1986, 34 (9, 10) :573~586
[ 4 ] Pomykala J A.Approximation operations in approximationspace[J].Bulletin of the Polish Academy of Science, 1987, 35 (9, 10) :653~662
[ 5 ] Showinski R, Stefanowski J.Rough classification inincomplete information systems[J].Math ComputingModelling, 1989, 12 (10, 11) :1347~1357
[ 6 ] Ziarko W.Variable precision rough set model[J].JComputer and System Sciences, 1993, 46 (1) :39~59
[ 7 ] Pawlak Z, Busse J G, Slowinski R, Ziarko W.Rough sets[J].Communication of the ACM, 1995, 38 (11) :89~95
[ 8 ] Kuroki N.Rough ideals in semigroups[J].J of InformSci, 1997, 100:139~163
[ 9 ] Bonikowski Z, Bryniarsiki E, Mybraniec S U.Extensionsand intentions in the rough set theory[J].J of Inform Sci, 1998, 107:149~167
[10] Lingras P J, Yao Y Y.Data mining using estensions of therough set models[J].J of the Amer Soc for Inform Sci, 1998, 49 (5) :415~422
[11] Yao Y Y.Relational interpretation of neighborhoodoperators and rough set approximation operators[J].J ofInfom Sci, 1998, 111:239~359
[12] Yao Y Y, Lingras P J.Interpretations of belief function inthe theory of rough sets[J].J of Infrom Sci, 1998, (104) :81~106
[13] 王珏, 王任, 苗夺谦, 等.基于Rough Set理论的“数据浓缩”[J].计算机学报, 1998, 21 (5) :393~400 link1
[14] 刘清.算子Rough逻辑及其归结原理[J].计算机学报, 1998, 21 (5) :476~480 link1
[15] 刘文奇.Pawlak代数及其性质[J].模糊系统与数学, 1999, 13 (2) :139~163 link1
[16] 苗夺谦, 王钰.粗糙集理论中概念与运算的信息表示[J].软件学报, 1999, 10 (2) :113~116 link1
[17] 祝峰, 何华灿.粗集的公理化[J].计算机学报, 2000, 23 (3) ;330~333 link1
[18] Showinski R, Vanderpooten D.A generalized definition ofrough approximations based on similarity[J].IEEE Transon Data and Knowledge Engineering, 2000, 12 (2) :331~336
[19] Quafatou M.A-RST:a generalization of rough set theory[J].J of Inform Sci, 2000, 124:301~316
[20] 苗夺谦.Rough Set理论中连续属性的离散化方法[J].自动化学报, 2001, 27 (3) :296~302 link1
[21] 苏健, 高济.基于元信息的粗糙集规则增式生成方法[J].模式识别与人工智能, 2001, 14 (4) :428~433 link1
[22] 张文修, 吴伟志, 梁吉业, 等.粗糙集理论与方法[M].北京:科学出版社, 2001 link1
[23] 陈德刚, 张文修.粗糙集和拓朴空间[J].西安交通大学学报, 2001, 35 (12) :1313~1315 link1
[24] 王国胤.Rough集理论与知识获取[M].西安:西安交通大学出版社, 2001 link1
[25] 刘文奇, 吴从.相似关系粗集理论与相似关系信息系统[J].模糊系统与数学, 2002, 16 (3) :50~58 link1
[26] 祝峰, 王飞跃.关于覆盖广义粗集的一些基本结果[J].模式识别与人工智能, 2002, 15 (1) :6~13 link1
[27] 米据生, 吴伟志, 张文修.粗糙集的构造与公理化方法[J].模式识别与人工智能, 2002, 15 (3) :280~284 link1
[28] 刘永红, 粗糙集的格刻画[J].模式识别与人工智能, 2003, 16 (2) :174~177 link1
[29] 张锦文.公理集合论导引[M].北京:科学出版社, 1999 link1
京公网安备 11010502051620号
