A new family of proximity graphs: Class cover catch digraphs

Jason Devinney,Carey E Priebe

doi:10.1016/j.dam.2006.04.004

A new family of proximity graphs: Class cover catch digraphs

Jason Devinney, Carey E Priebe

Open Access

https://doi.org/10.1016/j.dam.2006.04.004

Copy DOI

Journal: Discrete Applied Mathematics	Publication Date: May 30, 2006
Citations: 39	License type: elsevier-specific: oa user license

Affiliation: University of Maryland, College Park, Johns Hopkins University, Applied Mathematics (United States)

#Class Cover Catch Digraphs #Class Cover Problem + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.

Full Text