Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-sh8wx Total loading time: 0 Render date: 2024-07-19T11:21:00.198Z Has data issue: false hasContentIssue false

4 - Performance Measures II

Published online by Cambridge University Press:  05 August 2011

Nathalie Japkowicz
Affiliation:
American University, Washington DC
Mohak Shah
Affiliation:
McGill University, Montréal
Get access

Summary

Our discussion in the last chapter focused on performance measures that relied solely on the information obtained from the confusion matrix. Consequently it did not take into consideration measures that either incorporate information in addition to that conveyed by the confusion matrix or account for classifiers that are not discrete. In this chapter, we extend our discussion to incorporate some of these measures. In particular, we focus on measures associated with scoring classifiers. A scoring classifier typically outputs a real-valued score on each instance. This real-valued score need not necessarily be the likelihood of the test instance over a class, although such probabilistic classifiers can be considered to be a special case of scoring classifiers. The scores output by the classifiers over the test instances can then be thresholded to obtain class memberships for instances (e.g., all examples with scores above the threshold are labeled as positive, whereas those with scores below it are labeled as negative). Graphical analysis methods and the associated performance measures have proven to be very effective tools in studying both the behavior and the performance of such scoring classifiers. Among these, the receiver operating characteristic (ROC) analysis has shown significant promise and hence has gained considerable popularity as a graphical measure of choice. We discuss ROC analysis in significant detail. We also discuss some alternative graphical measures that can be applied depending on the domain of application and assessment criterion of interest.

Type
Chapter
Information
Evaluating Learning Algorithms
A Classification Perspective
, pp. 111 - 160
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×