Search

In this paper, we present the following contributions: (i) an adaptation of a precise classifier to work on imprecise classification for cost-sensitive problems; (ii) a new measure to check the performance of an imprecise classifier. The imprecise classifier is based on a method to build simple decision trees that we have modified for imprecise classification. It uses the Imprecise Dirichlet Model (IDM) to represent information, with the upper entropy as a tool for splitting. Our new measure to compare imprecise classifiers takes errors into account. Thus far, this has not been considered by other measures for classifiers of this type. This measure penalizes wrong predictions using a cost matrix of the errors, given by an expert; and it quantifies the success of an imprecise classifier based on the cardinal number of the set of non-dominated states returned. To compare the performance of our imprecise classification method and the new measure, we have used a second imprecise classifier known as Naive Credal Classifier (NCC) which is a variation of the classic Naive Bayes using the IDM; and a known measure for imprecise classification. [ABSTRACT FROM AUTHOR]

Variable selection methods play an important role in the field of attribute mining. In the last few years, several feature selection methods have appeared showing that the use of a set of decision trees learnt from a database can be a useful tool for selecting relevant and informative variables regarding a main class variable. With the Naive Bayes classifier as reference, in this article, our aims are twofold: (1) to study what split criterion has better performance when a complete decision tree is used to select variables; and (2) to present a filter-wrapper selection method using decision trees built with the best possible split criterion obtained in (1). [ABSTRACT FROM AUTHOR]