A new family of proximity graphs: Class cover catch digraphs |
| |
Authors: | Jason DeVinney |
| |
Institution: | a Center for Computing Sciences, Bowie, MD, USA b Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD, USA |
| |
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. |
| |
Keywords: | Class cover problem Pattern classification Machine learning Digraph |
本文献已被 ScienceDirect 等数据库收录! |
|