DocumentCode
2386738
Title
A Comparison of Three Approximation Strategies for Incomplete Data Sets
Author
Grzymala-Busse, Jerzy W. ; Grzymala-Busse, W.J. ; Hippe, Zdzislaw S. ; Rzasa, Wojciech
Author_Institution
Univ. of Kansas, Lawrence
fYear
2007
fDate
2-4 Nov. 2007
Firstpage
301
Lastpage
301
Abstract
In this paper we consider incomplete data sets, i.e., data sets with missing attribute values. Two different types of missing attribute values are studied: lost and "do not care". Furthermore, three definitions of approximations are discussed: singleton, subset, and concept. Theoretically, singleton approximations should not be used in data mining since concepts approximated by singleton approximations are not definable. However, we conducted a number of experiments on 44 different incomplete data sets using all three approximation definitions and our results show that none of these approximations is superior to the other.
Keywords
approximation theory; data analysis; approximation strategies; incomplete data sets; missing attribute values; singleton approximations; Artificial intelligence; Computer science; Conference management; Data mining; Expert systems; Influenza; Information management; Information technology; Testing; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing, 2007. GRC 2007. IEEE International Conference on
Conference_Location
Fremont, CA
Print_ISBN
978-0-7695-3032-1
Type
conf
DOI
10.1109/GrC.2007.119
Filename
4403114
Link To Document