Probabilistic approximation under incomplete information systems

被引：0

作者：

Feng, Yucai ^{[1
]}

Li, Wenhai ^{[1
]}

Lv, Zehua ^{[1
]}

Ma, Xiaoming ^{[1
]}

机构：

[1] Huazhong Univ Sci & Technol, Dept Comp Sci, Wuhan 430074, Hubei, Peoples R China

来源：

INTELLIGENT INFORMATION PROCESSING III | 2006年 / 228卷

关键词：

threshold; approximation; neighborhood system; probabilistic; rough set;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

By applying the probability estimation of the unavailable attributes derived from the available attributes to the neighborhood system, the suited degree of each neighbor to a given object is depicted. Therefore, the neighborhood space with guaranteed suited precision is obtained. We show how to shrink the rule search space via VPRS model for this space, and also, we will prove the incredibility degree of decision class is guaranteed by the two-layer thresholds.

引用

页码：73 / +

页数：2

共 12 条

[1]

[Anonymous], 1991, ROUGH SETS THEORETIC

[2]

GONG ZT, 2004, P 3 INT C MACH LEARN, P26

[3] Rough set approach to incomplete information systems [J].

Kryszkiewicz, M .

INFORMATION SCIENCES, 1998, 112 (1-4) :39-49

[4]

LENARCIK A, 1887, ROUGH SETS DATA MINI, P373

[5] Approaches to knowledge reduction based on variable precision rough set model [J].

Mi, JS ;

Wu, WZ ;

Zhang, WX .

INFORMATION SCIENCES, 2004, 159 (3-4) :255-272

[6]

Skowron A, 2005, LECT NOTES COMPUT SC, V3400, P175

[7]

SLOWINSKI R, 2000, IEEE T DATA KNOWLEDG

[8]

Stefanowski J, 1999, LECT NOTES ARTIF INT, V1711, P73

[9]

STENFANOWSKI J, 2001, COMPUTATIONAL INTELL, V17, P454

[10]

WANG GY, 2002, J COMPUTER RES DEV, V39, P1238

← 1 2 →