Training and Evaluating Classifiers from Evidential Data: Application to E 2 M Decision Tree Pruning
نویسندگان
چکیده
In many application data are imperfect, imprecise or more generally uncertain. Many classification methods have been presented that can handle data in some parts of the learning or the inference process, yet seldom in the whole process. Also, most of the proposed approach still evaluate their results on precisely known data. However, there are no reason to assume the existence of such data in applications, hence the need for assessment method working for uncertain data. We propose such an approach here, and apply it to the pruning of E2M decision trees. This results in an approach that can handle data uncertainty wherever it is, be it in input or output variables, in training or in test samples.
منابع مشابه
Minimal Cost Complexity Pruning of Meta-Classifiers
Integrating multiple learned classification models (classifiers) computed over large and (physically) distributed data sets has been demonstrated as an effective approach to scaling inductive learning techniques, while also boosting the accuracy of individual classifiers. These gains, however, come at the expense of an increased demand for run-time system resources. The final ensemble meta-clas...
متن کاملروشی جدید جهت استخراج موجودیتهای اسمی در عربی کلاسیک
In Natural Language Processing (NLP) studies, developing resources and tools makes a contribution to extension and effectiveness of researches in each language. In recent years, Arabic Named Entity Recognition (ANER) has been considered by NLP researchers due to a significant impact on improving other NLP tasks such as Machine translation, Information retrieval, question answering, query result...
متن کاملBuilding Simple Models: A Case Study with Decision Trees
1 I n t r o d u c t i o n Many induction algorithms construct models with unnecessary structure. These models contain components tha t do not improve accuracy, and tha t only reflect random variation in a single da ta sample. Such models are less efficient to store and use than their correctly-sized counterparts . Using these models requires the collection of unnecessary data. Portions of these...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کامل2n-Tree Classifiers for Realtime Image Segmentation
For realtime pattern classification applications (e.g. realtime image segmentation), the number of usable pattern classification algorithms is limited by the feasibility of high-speed hardware implementation. This paper describes a pattern classifier and associated hardware architecture and training algorithms. The classifier has both a feasible hardware implementation and other desirable prope...
متن کامل