Generating estimates of classification confidence for a case-based spam filter

Sarah Jane Delany, Pádraig Cunningham, Dónal Doyle, Anton Zamolotskikh

Research output: Contribution to journalConference articlepeer-review

58 Citations (Scopus)

Abstract

Producing estimates of classification confidence is surprisingly difficult. One might expect that classifiers that can produce numeric classification scores (e.g. k-Nearest Neighbour, Naïve Bayes or Support Vector Machines) could readily produce confidence estimates based on thresholds. In fact, this proves not to be the case, probably because these are not probabilistic classifiers in the strict sense. The numeric scores coming from k-Nearest Neighbour, Naïve Bayes and Support Vector Machine classifiers are not well correlated with classification confidence. In this paper we describe a case-based spam filtering application that would benefit significantly from an ability to attach confidence predictions to positive classifications (i.e. messages classified as spam). We show that 'obvious' confidence metrics for a case-based classifier are not effective. We propose an ensemble-like solution that aggregates a collection of confidence metrics and show that this offers an effective solution in this spam filtering domain.

Original languageEnglish
Pages (from-to)177-190
Number of pages14
JournalLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume3620
DOIs
Publication statusPublished - 2005
Event6th International Conference on Case-Based Reasoning, ICCBR 2005 - Chicago, IL, United States
Duration: 23 Aug 200526 Aug 2005

Fingerprint

Dive into the research topics of 'Generating estimates of classification confidence for a case-based spam filter'. Together they form a unique fingerprint.

Cite this