Law of large numbers for a two-dimensional class cover problem
From MaRDI portal
Publication:5030235
DOI10.1051/ps/2021013zbMath1489.60045OpenAlexW3184232860MaRDI QIDQ5030235
John C. Wierman, Elvan Ceyhan, Pengfei Xiang
Publication date: 16 February 2022
Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ps/2021013
pattern classificationlaw of large numbersdomination numberclass cover catch digraphsubadditive process
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Strong limit theorems (60F15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family
- Classification of Imbalanced Data with a Geometric Digraph Family
- Comparison of relative density of two random geometric digraph families in testing spatial clustering
- The algorithmic complexity of mixed domination in graphs
- A hierarchical methodology for class detection problems with skewed priors
- A general SLLN for the one-dimensional class cover problem
- Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
- Extension of one-dimensional proximity regions to higher dimensions
- A CLT for a one-dimensional class cover problem
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Subadditive ergodic theory
- Multiparameter subadditive processes
- First-passage percolation on the square lattice
- A matching problem and subadditive Euclidean functionals
- Approximation algorithms for the class cover problem
- 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
- Weak laws of large numbers in geometric probability
- Percolation in the secrecy graph
- 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
- The Domination Number of On-line Social Networks and Random Geometric Graphs
- Ergodic theorems for superadditive processes.
- Learning pattern classification-a survey
- Limit Theorems in Discrete Stochastic Geometry
This page was built for publication: Law of large numbers for a two-dimensional class cover problem
