Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Introduction to Linear Optimization
Introduction to Linear Optimization
Introductory Combinatorics
Prototype Selection for Composite Nearest Neighbor Classifiers
Prototype Selection for Composite Nearest Neighbor Classifiers
Computational Statistics & Data Analysis - Data visualization
Approximation Algorithms for the Class Cover Problem
Annals of Mathematics and Artificial Intelligence
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
Random Graphs for Statistical Pattern Recognition
Random Graphs for Statistical Pattern Recognition
A Hierarchical Methodology for Class Detection Problems with Skewed Priors
Journal of Classification
Hit Miss Networks with Applications to Instance Selection
The Journal of Machine Learning Research
Extension of one-dimensional proximity regions to higher dimensions
Computational Geometry: Theory and Applications
Operations Research Letters
Hi-index | 0.04 |
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.