A SLLN for a one-dimensional class cover problem

DOI10.1016/S0167-7152(02)00243-2zbMath1018.60031OpenAlexW1991846872MaRDI QIDQ1871304

John C. Wierman, Jason G. 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

zbMATH Keywords

classificationpattern recognitioncomplete convergencestrong law of large numbersPoisson representationclass cover problemcatch digraph

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Strong limit theorems (60F15)

Related Items (7)

A general SLLN for the one-dimensional class cover problem ⋮ 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 ⋮ 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 ⋮ Prototype selection for interpretable classification ⋮ Law of large numbers for a two-dimensional class cover problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Topics in Intersection Graph Theory
• Learning pattern classification-a survey
• 10.1162/153244302760200650

This page was built for publication: A SLLN for a one-dimensional class cover problem