A general SLLN for the one-dimensional class cover problem
From MaRDI portal
Publication:930087
DOI10.1016/j.spl.2007.11.005zbMath1137.62042OpenAlexW2001234674MaRDI QIDQ930087
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family ⋮ 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 ⋮ Law of large numbers for a two-dimensional class cover problem
Cites Work
- Unnamed Item
- On the distribution of the domination number for random class cover catch digraphs
- A hierarchical methodology for class detection problems with skewed priors
- 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
- 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
- Learning pattern classification-a survey
- Random Graphs for Statistical Pattern Recognition
- A new family of random graphs for testing spatial segregation
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
This page was built for publication: A general SLLN for the one-dimensional class cover problem