An analysis of four missing data treatment methods for supervised learning
暂无分享,去创建一个
[1] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[2] Jerzy W. Grzymala-Busse,et al. A Comparison of Several Approaches to Missing Attribute Values in Data Mining , 2000, Rough Sets and Current Trends in Computing.
[3] Tariq Samad,et al. Imputation of Missing Data in Industrial Databases , 1999, Applied Intelligence.
[4] Christos Faloutsos,et al. Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes , 2000, EDBT.
[5] Nicole A. Lazar,et al. Statistical Analysis With Missing Data , 2003, Technometrics.
[6] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[7] Peter Clark,et al. The CN2 Induction Algorithm , 1989, Machine Learning.
[8] Ron Kohavi,et al. Data Mining Using MLC a Machine Learning Library in C++ , 1996, Int. J. Artif. Intell. Tools.
[9] Ralph Martinez,et al. Reduction Techniques for Exemplar-Based Learning Algorithms , 1998 .
[10] Christopher J. Merz,et al. UCI Repository of Machine Learning Databases , 1996 .
[11] Gustavo E. A. P. A. Batista,et al. Experimental comparison pf K-NEAREST NEIGHBOUR and MEAN OR MODE imputation methods with the internal strategies used by C4.5 and CN2 to treat missing data , 2003 .
[12] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[13] Alberto Maria Segre,et al. Programs for Machine Learning , 1994 .