Jason DeVinney

Learn More
In this article we initiate the study of class cover catch digraphs, a special case of intersection digraphs motivated by applications in machine learning and statistical pattern recognition. Our main result is the exact distribution of the domination number for a data-driven model of random interval catch digraphs. c © 2001 Elsevier Science B.V. All rights(More)
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(More)
  • 1