论文信息 - A SLLN for a one-dimensional class cover problem

A SLLN for a one-dimensional class cover problem

Class cover catch digraphs arise in classification problems in statistical pattern recognition. We prove a strong law of large numbers for the domination number in a random one-dimensional model of class cover catch digraphs. The proof avoids complicated computations due to the dependence of random variables by considering a related Poisson process problem where we may apply classical strong law results and Chernoff exponential probability bounds. Complete convergence in the Poisson representation establishes the desired result for the original problem.

John C. Wierman | Jason G. DeVinney

[1] Sanjeev R. Kulkarni,et al. Learning Pattern Classification - A Survey , 1998, IEEE Trans. Inf. Theory.

[2] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[3] Lenore Cowen,et al. Approximation Algorithms for the Class Cover Problem , 2004, Annals of Mathematics and Artificial Intelligence.

[4] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .

[5] Robert L. Taylor,et al. A strong law of large numbers for arrays of rowwise negatively dependent random variables , 2002 .

[6] David J. Marchette,et al. Characterizing the scale dimension of a high-dimensional classification problem , 2003, Pattern Recognit..

[7] K. Joag-dev,et al. Negative Association of Random Variables with Applications , 1983 .

[8] C. Newman. Asymptotic independence and limit theorems for positively and negatively dependent random variables , 1984 .

[9] Carey E. Priebe,et al. Classification Using Class Cover Catch Digraphs , 2003, J. Classif..

[10] P. Billingsley,et al. Probability and Measure , 1980 .

[11] Don R. Hush,et al. Machine Learning with Data Dependent Hypothesis Classes , 2002, J. Mach. Learn. Res..

[12] C. Priebe,et al. On the distribution of the domination number for random class cover catch digraphs , 2001 .