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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
