Classification using class cover catch digraphs
From MaRDI portal
Publication:1762812
DOI10.1007/s00357-003-0003-7zbMath1055.62074OpenAlexW2075104607MaRDI QIDQ1762812
Jason G. DeVinney, David J. Marchette, Diego A. Socolinsky, Carey E. Priebe
Publication date: 11 February 2005
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00357-003-0003-7
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20)
Related Items (21)
On some subclasses of interval catch digraphs ⋮ Comparison of relative density of two random geometric digraph families in testing spatial clustering ⋮ A general SLLN for the one-dimensional class cover problem ⋮ Edge density of new graph types based on a random digraph family ⋮ Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays ⋮ Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association ⋮ Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family ⋮ The distribution of the relative arc density of a family of interval catch digraph based on uniform data ⋮ An investigation of new graph invariants related to the domination number of random proximity catch digraphs ⋮ Extension of one-dimensional proximity regions to higher dimensions ⋮ A new family of proximity graphs: class cover catch digraphs ⋮ The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data ⋮ A CLT for a one-dimensional class cover problem ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Prototype selection for interpretable classification ⋮ Classification using proximity catch digraphs ⋮ The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association ⋮ A new family of random graphs for testing spatial segregation ⋮ Explainable Deep Learning: A Field Guide for the Uninitiated ⋮ Law of large numbers for a two-dimensional class cover problem ⋮ A SLLN for a one-dimensional class cover problem
Uses Software
This page was built for publication: Classification using class cover catch digraphs
