Home
This Title All WIREs
WIREs RSS Feed
How to cite this WIREs title:
WIREs Comp Stat

Class cover catch digraphs

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

Abstract The class cover problem is one of finding a small number of sets covering (containing) points from one class without covering any points from a second class. The class cover catch digraph provides a solution to the class cover problem, which can be extended to a nonparametric classifier, similar in flavor to a reduced nearest neighbor classifier. This article describes the class cover catch digraph and its application to classification. Copyright © 2010 John Wiley & Sons, Inc. This article is categorized under: Data: Types and Structure > Graph and Network Data

A class cover problem with n = 10 (black points) and m = 3 (red points). The catch digraph that solves the constrained class cover problem is shown, with its defining set of balls. A minimal set of balls covering all the black points and none of the red points is shown in blue.

[ Normal View | Magnified View ]

Solution ball centers chosen by the CCCD for each class, plotted in two parallel coordinates plots. On the top the axes are unscaled, on the bottom each axis is scaled independently. The axes are in the order of Table 2, with the ball radius appended as the last axis. Black corresponds to ‘normal’ and red to ‘abnormal’.

[ Normal View | Magnified View ]

An example training set for a three‐class classification problem, and the resulting decision regions defined by the class cover catch digraph classifier of Eq. (11).

[ Normal View | Magnified View ]

Browse by Topic

Data: Types and Structure > Graph and Network Data

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts