Class cover catch digraphs
David J. Marchette · Wiley Interdisciplinary Reviews Computational Statistics · 2010
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