A general SLLN for the one-dimensional class cover problem
DOI10.1016/J.SPL.2007.11.005zbMATH Open1137.62042OpenAlexW2001234674MaRDI QIDQ930087FDOQ930087
Authors: John C. Wierman, Pengfei Xiang 
Publication date: 19 June 2008
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2007.11.005
Recommendations
- A SLLN for a one-dimensional class cover problem
- Law of large numbers for a two-dimensional class cover problem
- scientific article; zbMATH DE number 2077689
- A CLT for a one-dimensional class cover problem
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15)
Cites Work
- Random Graphs for Statistical Pattern Recognition
- On the distribution of the domination number for random class cover catch digraphs
- Classification using class cover catch digraphs
- Characterizing the scale dimension of a high-dimensional classification problem
- A SLLN for a one-dimensional class cover problem
- A new family of proximity graphs: class cover 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
- 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
- Title not available (Why is that?)
- Learning pattern classification-a survey
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
- A hierarchical methodology for class detection problems with skewed priors
Cited In (6)
- Spatial clustering tests based on the domination number of a new random digraph family
- A SLLN for a one-dimensional class cover problem
- Title not available (Why is that?)
- Law of large numbers for a two-dimensional class cover problem
- An investigation of new graph invariants related to the domination number of random proximity catch digraphs
- A CLT for a one-dimensional class cover problem
This page was built for publication: A general SLLN for the one-dimensional class cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930087)
