A new family of proximity graphs: class cover catch digraphs

DOI10.1016/J.DAM.2006.04.004MaRDI QIDQ2506361zbMATH OpenOpenAlexFDO

Authors Jason DeVinney, Carey E. Priebe

Publication date 28 September 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.04.004

zbMATH Keywords

class cover problemmachine learningpattern classification

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial probability (60C05) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
• Classification using proximity catch digraphs
• On the distribution of the domination number for random class cover catch digraphs
• scientific article; zbMATH DE number 2077689
• Classification of imbalanced data with a geometric digraph family

Cites work

• A digraph represented by a family of boxes or spheres
• A hierarchical methodology for class detection problems with skewed priors
• Approximation algorithms for NP-hard problems.
• Approximation algorithms for the class cover problem
• Characterizing the scale dimension of a high-dimensional classification problem
• Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
• Classification and dissimilarity analysis
• Classification using class cover catch digraphs
• scientific article; zbMATH DE number 3867330 (Why is no real title available?)
• scientific article; zbMATH DE number 1224949 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• Multidimensional scaling.
• On Random Intersection Graphs: The Subgraph Problem
• On the distribution of the domination number for random class cover catch digraphs
• Random Graphs for Statistical Pattern Recognition
• The relative neighbourhood graph of a finite planar set
• Topics in Intersection Graph Theory

Cited in

(15)

• A CLT for a one-dimensional class cover problem
• Classification of imbalanced data with a geometric digraph family
• Classification using class cover catch digraphs
• A SLLN for a one-dimensional class cover problem
• An investigation of new graph invariants related to the domination number of random proximity catch digraphs
• Computing optimal islands
• Random Graphs for Statistical Pattern Recognition
• Law of large numbers for a two-dimensional class cover problem
• Domination number of an interval catch digraph family and its use for testing uniformity
• Edge density of new graph types based on a random digraph family
• The distribution of the relative arc density of a family of interval catch digraph based on uniform data
• Classification using proximity catch digraphs
• Spatial clustering tests based on the domination number of a new random digraph family
• A general SLLN for the one-dimensional class cover problem
• Extension of one-dimensional proximity regions to higher dimensions

This page was built for publication: A new family of proximity graphs: class cover catch digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506361)