Title :
Missing Values in Monotone Data Sets
Author_Institution :
Dept. of Artificial Intelligence, Vrije Universiteit Amsterdam
Abstract :
This paper explores the problem of missing values in the context of monotone classification. A simple preprocessing method is proposed as an extension of three general approaches for filling in the unknown values (k-nearest neighbour, most frequent value and data point multiplication) so that the monotonicity property of the resulting data set is preserved. The results of the first experiments with the algorithms are reported in order to give more insight in how the method works in practice
Keywords :
pattern classification; data point multiplication; k-nearest neighbour; monotone classification; monotone data sets; most frequent value; Artificial intelligence; Bonding; Classification tree analysis; Data analysis; Decision trees; Filling; Labeling; Neural networks; Rough sets;
Conference_Titel :
Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on
Conference_Location :
Jinan
Print_ISBN :
0-7695-2528-8
DOI :
10.1109/ISDA.2006.195