Consolidated tree classifier learning in a car Insurance fraud detection domain with class imbalance

27Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an analysis of the behaviour of Consolidated Trees, CT (classification trees induced from multiple subsamples but without loss of explaining capacity). We analyse how CT trees behave when used to solve a fraud detection problem in a car insurance company. This domain has two important characteristics: the explanation given to the classification made is critical to help investigating the received reports or claims, and besides, this is a typical example of class imbalance problem due to its skewed class distribution. In the results presented in the paper CT and C4.5 trees have been compared, from the accuracy and structural stability (explaining capacity) point of view and, for both algorithms, the best class distribution has been searched.. Due to the different associated costs of different error types (costs of investigating suspicious reports, etc.) a wider analysis of the error has also been done: precision/recall, ROC curve, etc. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Pérez, J. M., Muguerza, J., Arbelaitz, O., Gurrutxaga, I., & Martín, J. I. (2005). Consolidated tree classifier learning in a car Insurance fraud detection domain with class imbalance. In Lecture Notes in Computer Science (Vol. 3686, pp. 381–389). Springer Verlag. https://doi.org/10.1007/11551188_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free