Classification using class cover catch digraphs

Journal of Classification

Volumn 20, Issue 1, 2003, Pages 3-23

  Priebe, Carey E ^a   Marchette, David J ^b   DeVinney, Jason G ^c   Socolinsky, Diego A ^d  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b NAVAL SURFACE WARFARE CENTER   (United States)

^c Center for Computing Sciences   (United States)

^d Equinox Corporation   (United States)

Author keywords

Class cover; Classification; Prototype selection; Random graph

Indexed keywords

EID: 0037899011     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00357-003-0003-7     Document Type: Article

References (34)

1. ARORA, S., and LUND, C. (1997), Hardness of approximations. PWS Publishing Company.
2. CHVATAL, V. (1979), "A greedy heuristic for the set-covering problem," Mathematics of Operations Research, 4:233-235.
3. COVER, T.M., and HART, P.E. (1967), "Nearest Neighbor Pattern Classification," IEEE Transactions on Information Theory, 13, 21-27.
4. DASRATHY, B.V., and SÁNCHEZ, J.S. (2000), "Tandem fusion of nearest neighbor editing and condensing algorithms - data dimensionality effects," Proceedings of the 15th International Conference on Pattern Recognition, Volume 2, 692-695.
5. DEVINNEY, J.G., PRIESE, C.E., MARCHETTE, D.J., and SOCOLINSKY, D.A. (2002), "Random Walks and Catch Digraphs in Classification," Computing Science and Statistics, 34, to appear.
6. DEVINNEY, J.G., and PRIESE, C.E, (2001+), "Class cover catch digraphs," submitted for publication.
7. DEVINNEY, J.G. (2003), "The Class Cover Problem and its Applications in Pattern Recognition," Ph.D. Thesis, Department of Mathematical Sciences, Johns Hopkins University, Baltimore, MD.
8. DEVROYE, L., GYORFI, L., and LUGOSI, G. (1996), A Probabilistic Theory of Pattern Recognition. Springer.
9. DUDA, R.O., HART, P.E., and STORK, D.G. (2001), Pattern Classification, 2nd Edition, Wiley.
10. FRIEDMAN, J.H. (1996), "Another Approach to Polychotomous Classification," Stanford University Technical Report (unpublished).
11. HARTIGAN, J.A. (1975), Clustering Algorithms. Wiley.
12. HARTIGAN, J.A., and WONG, M. A. (1979), "A k-means clustering algorithm," Applied Statistics, 28, 100-108.
13. HASTIE, T., and TIBSHIRANI, R. (1998), "Classification by Pairwise Coupling," Annals of Statistics, 26, 2, 451-471.
14. HO, T.K., and BASU, M. (2002), "Complexity Measures of Supervised Classification Problems," IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 3, 289-300.
15. JAIN, A.K., Mao, J., and HOHLUDDIN, K.M. (1996), "Artificial Neural Networks: A Tutorial," IEEE Computer, March, 31-44.
16. JOACHIMS, T. (1999) in: Making large-Scale SVM Learning Practical. Advances in Kernel Methods - Support Vector Learning, B. Schlkopf and C. Burges and A. Smola (ed.), MIT Press.
17. KARP, R. (1972), Reducibility among combinatorial problems. Plenum Press.
18. KAROŃSKI, M. SCHEINERMAN, E.R., and SINGER-COHEN, K.B. (1999), "On random intersection graphs: the subgraph problem," Combinatorics, Probability and Computing, 8, 131-159.
19. KULKARNI, S.R., LUGOSI, G., and VENKATESH, S. (1998), "Learning Pattern Classification - A Survey," IEEE Transactions on Information Theory, 44, 6, 2178-2206.
20. LEBOURGEOIS, F., and EMPTOZ, H. (1996), "Pretopological Approach for Supervised Learning," Proceedings of the 13th International Conference on Pattern Recognition, 256-260.
21. MAA, J.-F., PEARL, D.K., and BARTOSZYNSKI, R. (1996), "Reducing multidimensional two-sample data to one-dimensional interpoint comparisons," Annals of Statistics 24, 1069-1074.
22. MAEHARA, H. (1984), "A digraph represented by a family of boxes or spheres," Journal of Graph Theory 8, 431-439.
23. MARCHETTE, D. J., and PRIESE, C.E. (2003) "Characterizing the Scale Dimension of a high dimensional classification problem," Pattern Recognition, 36, 1, 45-60.
24. OLSON, T., PANG, J.S., and PRIEBE, C.E. (2001+), "A Likelihood-MPEC Approach to Target Classification," Mathematical Programming, to appear.
25. PAREKH, A.K. (1991), "Analysis of a greedy heuristic for finding small dominating sets in graphs," Information Processing Letters, 39:237-240.
26. PRIEBE, C.E., DEVINNEY, J.G., and MARCHETTE, D.J. (2001), "On the distribution of the domination number of random class cover catch digraphs," Statistics and Probability Letters, 55, 3, 239-246.
27. PRIEBE, C.E., NAIMAN, D.Q., and COPE, L. (2001), "Importance Sampling for Spatial Scan Analysis: Computing Scan Statistic p-Values for Marked Point Processes," Computational Statistics and Data Analysis, 35, 4, 475-485.
28. PRIEBE, C.E., PANG, J.S., and OLSON, T. (1999), "Optimizing Sensor Fusion for Classification Performance," Proceedings of the International Conference on Imaging Science, Systems, and Technology: CISST '99, 397-403.
29. SCHOLKOPF, B., PLATT, J., SHAWE-TAYLOR, J., SMOLA, A.J., and WILLIAMSON, R.C. (2001), "Estimating the support of a high-dimensional distribution," Neural Computation, 13, 7.
30. SKALAK, D.B. (1997), "Prototype Selection for Composite Nearest Neighbor Classifiers," Ph.D. Thesis, Department of Computer Science, University of Massachusetts, Amherst, MA.
31. SMITH, D.L. (1995), "Detection Technologies for Mines and Minelike Targets," SPIE Volume 2496: Detection Technologies for Mines and Minelike Targets, 404-408.
32. SOCOLINSKY, D.A., NEUHEISEL, J.D., PRIEBE, C.E., MARCHETTE, D.J., and DEVINNEY, J.G. (2003), "Fast Face Detection with a Boosted CCCD Classifier," submitted for publication. (Available as Technical Report No. 634, Department of Mathematical Sciences, Johns Hopkins University, Baltimore, MD 21218-2682.)
33. VAPNIK, V.N. (1995), The Nature of Statistical Learning Theory. Springer.
34. WITHERSPOON, N.H., HOLLOWAY, J.H., DAVIS, K.S., MILLER, R.W., and DUBEY, A.C. (1995), "The Coastal Battlefield Reconnaissance and Analysis (COBRA) Program for Minefield Detection," SPIE Volume 2496: Detection Technologies for Mines and Minelike Targets, 500-508.