MVC - a preprocessing method to deal with missing values

Knowledge-Based Systems

Volumn 12, Issue 5-6, 1999, Pages 285-291

  Ragel, A ^a   Cremilleux B ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DATA MINING; DATA STRUCTURES; DATABASE SYSTEMS; DECISION THEORY; HUMAN COMPUTER INTERACTION; LEARNING SYSTEMS;

DECISION TREE PROGRAM; KNOWLEDGE DISCOVERY; MINING ASSOCIATION RULES; MISSING VALUES COMPLETION; ROBUST ASSOCIATION RULES ALGORITHM;

KNOWLEDGE ENGINEERING;

EID: 0343526733     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0950-7051(99)00022-2     Document Type: Article

References (16)

1. Little R.J.A., Rubin D.B. Statistical analysis with missing data. Wiley Series in Probability and Mathematical Statistics. 1987;Wiley, New York.
2. Quinlan J.R. Unknown attribute values in induction. Proceedings of the Sixth International Workshop on Machine Learning. 1989;Morgan Kaufmann, Los Altos, CA. pp. 164-168.
3. Breiman L., Friedman J.H., Olshen R.A., Stone C.J. Classification and regression trees. Statistics/Probability Series. 1984;Wadsworth, Belmont, CA.
4. G. Celeux, Le traitement des données manquantes dans le logiciel SICLA, Technical report number 102, INRIA, France, 1988.
5. Fayyad U.M., Piatetsky-Shapiro G., Smyth P. From data mining to knowledge discovery: an overview. Advances in Knowledge Discovery and Data Mining. 1996;MIT Press, Cambridge, MA. pp. 1-36.
6. Agrawal R., Mannila H., Srikant R., Toivonen H., Verkamo A.I. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining. 1996;MIT Press, Cambridge, MA. pp. 307-328.
7. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the ACM SIGMOD Conference on Management of Data, Washington, DC, USA, 1993, pp. 207-216.
8. Ragel A., Crémilleux B. Treatment of missing values for association rules. Proceedings of The Second Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98), Melbourne, Australia, Lecture Notes in Artificial Intelligence 1394. 1998;Springer, Berlin. pp. 258-270.
9. Quinlan J.R. C4.5: Programs for Machine Learning. 1993;Morgan Kaufmann, San Mateo, CA.
10. Hyafile L., Rivest R. Constructing optimal binary decision trees is np-complete. Information Processing Letters. 5:1976;15-17.
11. A. Ragel, Traitement des valeurs manquantes dans les arbres de décision, Technical reports, Les cahiers du GREYC 2, University of Caen, France, 1997.
12. Quinlan J.R. Induction of Decision Trees, Machine Learning 1. 1986;Kluwer Academic, Boston, MA. pp. 81-106.
13. Lakshminarayan K., Harp S.A., Goldman R., Samad T. Imputation of missing data using machine learning techniques. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), Portland, USA. 1996;MIT Press, Cambridge, MA. pp. 140-146.
14. P. Cheeseman, J. Kelly, M. Self, J. Stutz, W. Taylor, D. Freeman, Bayesian classification, in: Proceedings of American Association of Artificial Intelligence (AAAI), San Mateo, CA, USA, 1988, pp. 607-611.
15. H. Toivonen, Sampling large databases for association rules, in: Proceedings of the 22nd International Conference on Very Large Databases (VLDB'96), Morgan Kaufmann, India, 1996 pp. 134-145. [available on the web from http://www.informatik.uni-trier.de/ley/db/conf/vldb/Toivonen96.html].
16. W.Z. Liu, A.P. White, S.G. Thompson, M.A. Bramer, Techniques for dealing with missing values in classification, in: Second International Symposium on Intelligent Data Analysis, London, UK, 1997.