A SLLN for a one-dimensional class cover problem
DOI10.1016/S0167-7152(02)00243-2zbMATH Open1018.60031OpenAlexW1991846872MaRDI QIDQ1871304FDOQ1871304
Authors: John C. Wierman, Jason DeVinney 
Publication date: 7 May 2003
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-7152(02)00243-2
Recommendations
classificationpattern recognitionstrong law of large numbersclass cover problemPoisson representationcomplete convergencecatch digraph
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Strong limit theorems (60F15)
Cites Work
- On the distribution of the domination number for random class cover catch digraphs
- Classification using class cover catch digraphs
- A new family of proximity graphs: class cover catch digraphs
- Title not available (Why is that?)
- Topics in Intersection Graph Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning pattern classification-a survey
- 10.1162/153244302760200650
Cited In (9)
- Spatial clustering tests based on the domination number of a new random digraph family
- 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
- Prototype selection for interpretable classification
- On the distribution of the domination number for random class cover catch digraphs
- A general SLLN for the one-dimensional class cover problem
- 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
This page was built for publication: A SLLN for a one-dimensional class cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1871304)
