A generalized definition of rough approximations based on similarity

被引：734

作者：

Slowinski, R

Vanderpooten, D

机构：

[1] Politech Poznanska Inst, PL-60965 Poznan, Poland

[2] Univ Paris 09, LAMSADE, F-75775 Paris 16, France

来源：

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 2000年 / 12卷 / 02期

关键词：

rough sets; lower and upper approximations; ambiguity; similarity relation;

D O I：

10.1109/69.842271

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper proposes new definitions of lower and upper approximations, which are basic concepts of the rough set theory. These definitions follow naturally from the concept of ambiguity introduced in this paper. The new definitions are compared to the classical definitions and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation.

引用

页码：331 / 336

页数：6

共 23 条

[1]

[Anonymous], TOPOLOGY 3 MANIFOLDS

[2]

[Anonymous], SOFT COMPUTING ROUGH

[3]

Dubois D., 1992, Putting Rough Sets and Fuzzy Sets Together, P203, DOI [10.1007/978-94-015-7975-9_14, DOI 10.1007/978-94-015-7975-9_14]

[4] QUOTIENTS WITH RESPECT TO SIMILARITY RELATIONS [J].

HOHLE, U .

FUZZY SETS AND SYSTEMS, 1988, 27 (01) :31-44

[5]

LIN TY, 1989, P 4 INT S METH INT S

[6]

LIN TY, 1995, SOFT COMPUTING ROUGH

[7]

LUCE RD, 1956, ECONOMETRICA, V24

[8]

Marcus S, 1994, B POLISH ACAD SCI TE, V42, P471

[9]

Nieminen J., 1988, Fundamenta Informaticae, V11, P289

[10]

PAWLAK Z, 1995, COMMUN ACM, V38, P89, DOI 10.1145/219717.219791

← 1 2 3 →