Dealing with Missing Values in a Probabilistic Decision Tree during Classification - Mining Complex Data - page 71

16. Lobo, O., Numao, M.: Ordered estimation of missing values. In: PAKDD 1999:
Proceedings of the Third Pacific Asia Conference on Methodologies for Knowledge
Discovery and Data Mining, pp. 499-503. Springer, London (1999)
17. Lobo, O., Numao, M.: Ordered estimation of missing values for propositional learn-
ing. The Japanese Society for Artificial Intelligence 1, 162-168 (2000)
18. Lobo, O., Numao, M.: Suitable domains for using ordered attribute trees to impute
missing values. IEICE TRANS INF. and SYST, E84-D, no. 2 (February 2001)
19. Martin, J.K., Hirschberg, D.S.: The time complexity of decision tree induction.
Technical Report. ICS-TR-95-27 (1995)
20. Newman, D., Hettich, S., Blake, C., Merz, C.: UCI Repository of machine learning
databases (1998), http://www.ics.uci.edu/ ∼ mlearn/MLRepository.html
21. Quinlan, J.R.: Induction of decision trees. Machine Learning 1, 81-106 (1986)
22. Quinlan, J.R.: Unknown attribute values in induction. In: Proc. Sixth International
Machine Learning Workshop. Morgan Kaufmann, San Francisco (1989)
23. Quinlan, J.R.: Probabilistic decision trees. Machine Learning: an Artificial Intelli-
gence Approach 3, 140-152 (1990)
24. Robnik-Sikonja, M., Kononenko, I.: Attribute dependencies, understandability and
split selection in tree based models. In: Machine Learning: Proceedings of the
Sixteenth International Conference. ICML 1999, pp. 344-353 (1999)
25. Robnik-Sikonja, M., Kononenko, I.: Theoretical and empirical analysis of relieff
and rrelieff. Mach. Learn. 53(1-2), 23-69 (2003)