Probabilistic approach to rough sets

被引:171
作者
Ziarko, Wojciech [1 ]
机构
[1] Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
关键词
Rough sets; Probabilistic rough sets; Data dependencies; Data mining; Machine learning; Data reduction;
D O I
10.1016/j.ijar.2007.06.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The article introduces the basic ideas and investigates the probabilistic version of rough set theory. It relies on both classification knowledge and probabilistic knowledge in analysis of rules and attributes. Rough approximation evaluative measures and one-way and two-way inter-set dependency measures are proposed and adopted to probabilistic rule evaluation. A new probabilistic dependency measure for attributes is also introduced and proven to have the monotonicity property. This property makes it possible for the measure to be used to optimize and evaluate attribute-based representations through computation of probabilistic measures of attribute reduct, core and significance factors. (C) 2007 Elsevier Inc. All rights reserved.
引用
收藏
页码:272 / 284
页数:13
相关论文
共 32 条
[1]  
[Anonymous], 1998, LNCS LNAI
[2]  
BEYNON M, 2004, LECT NOTES ARTIF INT, V1711, P412
[3]  
Beynon MJ, 2003, LECT NOTES ARTIF INT, V2639, P287
[4]  
FERNANDEZBAIZAN M, 2000, LECT NOTES ARTIF INT, V2005, P286
[5]  
GALVEZ J, 2000, LECT NOTES ARTIF INT, V2005, P296
[6]  
Greco S, 2005, LECT NOTES ARTIF INT, V3641, P314, DOI 10.1007/11548669_33
[7]  
GRECO S, 2008, PARAMETERIZED ROUGH, V49, P285
[8]  
Greco S., 2000, P 2 INT C ROUGH SETS, V2005, P170, DOI DOI 10.1007/3-540-45554-X_20
[9]  
GRZYMALABUSSE J, 1991, HDB APPL ADV ROUGH S, P3
[10]  
MIESZKOWICZ A, 2004, LECT NOTES ARTIF INT, V1711, P402