A new family of proximity graphs: Class cover catch digraphs

Discrete Applied Mathematics

Volumn 154, Issue 14, 2006, Pages 1975-1982

  DeVinney, Jason ^a   Priebe, Carey E ^b  

^a Center for Computing Sciences   (United States)

^b Johns Hopkins University   (United States)

Author keywords

Class cover problem; Digraph; Machine learning; Pattern classification

Indexed keywords

LEARNING SYSTEMS; PATTERN RECOGNITION; PROBLEM SOLVING; STATISTICAL METHODS;

CARDINALITY; CATCH DIGRAPHS; CLASS COVER PROBLEM; DIGRAPH;

GRAPH THEORY;

EID: 33745738556     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.004     Document Type: Article

References (21)

1. Bertsimas D., and Tsitsiklis J. Linear Otimization (1997), Athena Scientific
2. Bogart K. Introductory Combinatorics (1990), Harcourt, Brace and Jovanovich, New York
3. Cannon A.H., and Cowen L.J. Approximation algorithms for the class cover problem. Ann. of Math. Artificial Intelligence 40 (2004) 215-223
4. Conway J., and Sloane N. Sphere Packings, Lattices and Groups. third ed. (1999), Springer-Verlag, New York, NY
5. Cox T., and Cox A. Multidimensional Scaling (2001), Chapman & Hall, CRC, London, Boca Raton, FL
6. Critchley F., and Fichet B. Lecture Notes in Statistics: Classification and Dissimilarity Analysis vol. 93 (1994), Springer-Verlag, New York, NY (Chapter 2)
7. Devroye L., Gyorfi L., and Lugosi G. A Probabilistic Theory of Pattern Recognition (1996), Springer, Berlin
8. Eveland C.K., Socolinsky D.A., Priebe C.E., and Marchette D.J. A hierarchical methodology for class detection problems with skewed priors. J. Classification 22 (2005) 17-48
9. Haynes T., Hedetniemi S., and Slater P. Fundamentals of Domination in Graphs (1998), Marcel Dekker, Inc., New York
10. D. Hochbaum, (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Co., Massachusetts, 1997.
11. Jaromczyk J.W., and Toussaint G.T. Relative neighborhood graphs and their relatives. Proc. IEEE 80 9 (1992) 1502-1517
12. Karonski M., Scheinerman E., and Signer-Cohen K. On random intersection graphs: the subgraph problem. Combin. Probab. Comput. 8 (1999) 131-159
13. Maehara H. A digraph represented by a family of boxes or spheres. J. Graph Theory 8 (1984) 431-439
14. Marchette D.J. Random Graphs for Statistical Pattern Recognition (2004), Wiley
15. Marchette D.J., and Characterizing the scale dimension of a high dimensional classification problem C.E.Priebe. Pattern Recognition 36 (2003) 45-60
16. McKee T., and McMorris F. Topics in Intersection Graph Theory (1999), SIAM, Philadelphia, PA
17. Priebe C.E., DeVinney J., and Marchette D. On the distribution of the domination number for random class cover catch digraphs. Statist. Probab. Lett. 55 3 (2001) 239-246
18. Priebe C.E., Marchette D., DeVinney J., and Socolinsky D. Classification using class cover catch digraphs. J. Classification 20 1 (2003) 3-23
19. C.E. Priebe, J.L. Solka, D.J. Marchette, B.T. Clark, Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays, Comput. Statist. Data Anal. 43 (4) (2003) 621-632.
20. D.B. Skalak, Prototype selection for composite nearest neighbor classifiers, Technical Report, University of Massachusetts, 1995.
21. Toussaint G.T. The relative neighborhood graph of a finite planar set. Pattern Recognition 12 (1980) 261-268