DocumentCode
1698841
Title
Applying Rough Sets to Information Tables Containing Missing Values
Author
Nakata, Michinori ; Sakai, Hiroshi
Author_Institution
Fac. of Manage. & Inf. Sci., Josai Int. Univ., Togane
fYear
2009
Firstpage
286
Lastpage
291
Abstract
Several methods of rough sets that are applied to data tables containing missing values are examined from the viewpoint of the method of possible worlds. It is clarified that the previous methods do not give the same results as the method of possible worlds. This is due to that the previous methods consider either of indicernibility or discernibility of missing values.In order to improve this point, a new method, called a method of possible equivalence classes, is described. By using possible equivalence classes, both indiscernibility and discernibility of missing values are taken into account. As a result, the method of possible equivalence classes gives the same results as the method of possible worlds.In addition, by using the maximal possible equivalence classes, not all possible equivalence classes, rough approximations are efficiently obtained.
Keywords
equivalence classes; rough set theory; data tables; information tables; missing values discernibility; possible equivalence classes; rough approximations; rough sets; Information management; Information science; Logic; Mathematics; Rough sets; Lower and upper approximations; Missing values; Possible equivalence classes; Rough sets;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 2009. ISMVL '09. 39th International Symposium on
Conference_Location
Naha, Okinawa
ISSN
0195-623X
Print_ISBN
978-1-4244-3841-9
Electronic_ISBN
0195-623X
Type
conf
DOI
10.1109/ISMVL.2009.1
Filename
5010414
Link To Document