Published Articles >> Table of Contents >> Abstract

19th International Conference of the Chilean Computer Science Society   p. 43
Decision Tree-Based Paraconsistent Learning
Fabricio Enembreck, Pontifical Catholic University of Parana
Braulio Coelho Avila, Pontifical Catholic University of Parana
Robert Sabourin, Ecole de Technologie Superieure de Montreal

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SCCC.1999.810152
Send link to a friend

Abstract
It is possible to apply Machine Learning, Uncertainty Management and Paraconsistent Logic concepts to the design of a Paraconsistent Learning system, able to extract useful knowledge even in the presence of inconsistent information in a database.This paper presents a Decision Tree-Based Machine Learning technique capable of handling inconsistent examples. The intention is to define a model able to handle databases with a large quantity of inconsistent examples.The model obtained is evaluated and compared with the C4.5 algorithm in terms of classification accuracy and size of the trees generated. As will be observed, in most situations where high rates of inconsistent examples were found, this presented better results when compared to the C4.5 algorithm.
Back to Top Additional Information
Index Terms- Machine Learning, Decision Tree, Paraconsistent Logic, Uncertainty, Inconsistency Citation:  Fabricio Enembreck, Braulio Coelho Avila, Robert Sabourin, "Decision Tree-Based Paraconsistent Learning," sccc, p. 43,  19th International Conference of the Chilean Computer Science Society,  1999