A classification approach incorporating misclassification costs

https://doi.org/10.1016/S1088-467X(98)00010-9Get rights and content

Abstract

We explore an algorithm for learning a classification procedure to minimize the cost of misclassified examples. The described approach is based on the generation of oblique decision trees. The various misclassification costs are defined by a cost matrix. A special splitting criterion is defined to determine the next node for splitting. Clustering techniques are used to process the splitting. The specific splitting criterion is based on cost histograms that count the misclassification costs per class. To avoid overfitting cross-validation techniques are directly integrated into the framing cycle to terminate the splitting process. Several successful tests with different data sets cause this method to seem very promising.

References (16)

  • L. Breiman et al.
  • B.A. Draper et al.

    Goal Directed Classification using Linear Machine Decision Trees

    IEEE Transactions on Pattern Analysis and Machine Intelligence

    (Sept. 1994)
  • A. Gersho et al.
  • U. Grouven et al.

    Implementation of Linear and Quadratic Disciminant Analysis Incorporating Costs of Misclassification

    Computer Methods and Programs in Biomedicine

    (1995)
  • D. Heath et al.

    Induction of Oblique Decision Trees, TR

    (1995)
  • D. Lubinsky

    Classification Trees with Bivariate Splits

    Journal of Applied Intelligence

    (1994)
There are more references available in the full text version of this article.

Cited by (0)

View full text