Rough set approach to incomplete data

被引:0
作者
Grzymala-Busse, JW [1 ]
机构
[1] Univ Kansas, Dept Elect Engn & Comp Sci, Lawrence, KS 66045 USA
[2] Polish Acad Sci, Inst Comp Sci, PL-01237 Warsaw, Poland
来源
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2004 | 2004年 / 3070卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper incomplete data are assumed to be decision tables with missing attribute values. We discuss two main cases of missing attribute values: lost values (a value was recorded but it is unavailable) and "do not care" conditions (the original values were irrelevant). Through the entire paper the same calculus, based on computations of blocks of attribute-value pairs, is used. Complete data are characterized by the indiscernibility relations, a basic idea of rough set theory. Incomplete data axe characterized by characteristic relations. Using characteristic relations, lower and upper approximations are generalized for incomplete data. Finally, from three definitions of such approximations certain and possible rule sets may be induced.
引用
收藏
页码:50 / 55
页数:6
相关论文
共 11 条
[1]  
[Anonymous], P 5 INT WORKSH ROUGH
[2]  
[Anonymous], 2003, P NOTES WORKSHOP FDN
[3]  
Grzymala-Busse J.W., 1992, Intelligent Decision Support, P3, DOI DOI 10.1007/978-94-015-7975-9_
[4]  
Grzymala-Busse JW, 2002, P 9 INT C INF PROC M, P243
[5]  
GRZYMALABUSSE JW, 1991, LECT NOTES ARTIF INT, V542, P368
[6]   Rules in incomplete information systems [J].
Kryszkiewicz, M .
INFORMATION SCIENCES, 1999, 113 (3-4) :271-292
[7]  
Kryszkiewicz M., 1995, P 2 ANN JOINT C INF, P194
[8]  
Pawlak Z., 1991, Rough sets: Theoretical aspects of reasoning about data, DOI DOI 10.1007/978-94-011-3534-4
[9]   Incomplete information tables and rough classification [J].
Stefanowski, J ;
Tsoukiàs, A .
COMPUTATIONAL INTELLIGENCE, 2001, 17 (03) :545-566
[10]  
STEFANOWSKI J, 1999, P 7 INT WORKSH NEW D, P73