Decision tree-based paraconsistent learning

/in , , /by
Decision tree-based paraconsistent learning

Enembreck, Fabrica and Sabourin, Robert

Proceedings – International Conference of the Chilean Computer Science Society, SCCC 1999

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.

You might also like
Regional heart motion abnormality detection via multiview fusion
Audio quotation marks for natural language understanding
An a priori indicator of the discrimination power of discrete hidden Markov models
Min-max entropy for weakly supervised pointwise localization
Designing multi-axis force-torque sensors by minimizing the amplitudes of their nonlinear displacements
Privacy-preserving adversarial network (PPAN) for continuous non-Gaussian attributes
People counting in crowded and outdoor scenes using a hybrid multi-camera approach
Two-stage classification system combining model-based and discriminative approaches