Affiliations: Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA. [email protected]; [email protected] | Department of Expert Systems and Artificial Intelligence, University of Information Technology and Management, 35-225 Rzeszow, Poland. [email protected]
Note: [] Address for correspondence: Department of Electrical Engineering and Computer Science, University of Kansas, 3014 Eaton Hall, 1520 W. 15th St., # 2001, Lawrence, KS 66045-7621, USA Also works: Institute of Computer Science, Polish Academy of Sciences, 01-237 Warsaw, Poland
Abstract: The main objective of our research was to test whether the probabilistic approximations should be used in rule induction from incomplete data. For our research we designed experiments using six standard data sets. Four of the data sets were incomplete to begin with and two of the data sets had missing attribute values that were randomly inserted. In the six data sets, we used two interpretations of missing attribute values: lost values and “do not care” conditions. In addition we used three definitions of approximations: singleton, subset and concept. Among 36 combinations of a data set, type of missing attribute values and type of approximation, for five combinations the error rate (the result of ten-fold cross validation) was smaller than for ordinary (lower and upper) approximations; for other four combinations, the error rate was larger than for ordinary approximations. For the remaining 27 combinations, the difference between these error rates was not statistically significant.
