Convex sets as prototypes for classifying patterns

Engineering Applications of Artificial Intelligence

Volumn 22, Issue 1, 2009, Pages 101-108

  Takigawa, Ichigaku ^a   Kudo, Mineichi ^b   Nakamura, Atsuyoshi ^b  

^a KYOTO UNIVERSITY   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

Boundary projection; Convex hulls; Convex sets; Minimum enclosing balls; Nonparametric method; Pattern classification; Set covering

Indexed keywords

BOUNDARY PROJECTION; CONVEX HULLS; CONVEX SETS; MINIMUM ENCLOSING BALLS; NONPARAMETRIC METHOD; PATTERN CLASSIFICATION; SET COVERING;

SET THEORY;

EID: 58249091995     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2008.05.012     Document Type: Article

References (30)

1. Alexe G., and Hammer P.L. Spanned patterns for the logical analysis of data. Discrete Applied Mathematics 154 7 (2006) 1039-1049
2. Bennett, K.P., Bredensteiner, E.J., 2000. Duality and geometry in SVM classifiers. In: ICML'00: Proceedings of the 17th International Conference on Machine Learning, San Francisco, CA, USA. Morgan Kaufmann, Los Altos, CA, pp. 57-64.
3. Bishop C.M. Pattern Recognition and Machine Learning (Information Science and Statistics) (2006), Springer, New York, Secaucus, NJ, USA
4. Blake, C., Merz, C., 1998. UCI repository of machine learning databases.
5. Briec W. Minimum distance to the complement of a convex set: Duality result. Journal of Optimization Theory and Applications 93 2 (1997) 301-319
6. Cannon A.H., and Cowen L.J. Approximation algorithms for the class cover problem. Annals of Mathematics and Artificial Intelligence 40 (2004) 215-223
7. Cannon A.H., Ettinger J.M., Hush D., and Scovel C. Machine learning with data dependent hypothesis classes. Journal of Machine Learning Research 2 (2002) 335-358
8. DeVinney, J.G., 2003. The class cover problem and its application in pattern recognition. Ph.D. Thesis, The Johns Hopkins University.
9. Devroye L., Györfi L., and Lugosi G. A Probabilistic Theory of Pattern Recognition (1996), Springer, New York
10. Duda R.O., Hart P.E., and Stork D.G. Pattern Classification. second ed. (2001), Wiley, New York
11. Eckstein J., Hammer P.L., Liu Y., Nediak M., and Simeone B. The maximum box problem and its application to data analysis. Computational Optimization and Applications 23 3 (2002) 285-298
12. Fischer, K., Gärtner, B., Kutz, M., 2003. Fast smallest-enclosing-ball computation in high dimensions. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA).
13. Freund R.M., and Orlin J.B. On the complexity of four polyhedral set containment problems. Mathematical Programming 33 (1985) 139-145
14. Gärtner B., and Schönher S. Fast and robust smallest enclosing balls. Proceedings of the 7th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science vol. 1643 (1999), Springer, Berlin 325-338
15. Gritzmann P., and Klee V. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Mathematical Programming 59 (1993) 163-213
16. Hastie, T., Tibshirani, R., Friedman, J.H., 2001. Prototype methods and nearest-neighbors. In: The Elements of Statistical Learning. Springer, New York, pp. 411-435 (Chapter 13).
17. Kudo M., Yanagi S., and Shimbo M. Construction of class regions by a randomized algorithm: a randomized subclass method. Pattern Recognition 29 (1996) 581-588
18. Mangasarian O.L. Polyhedral boundary projection. SIAM Journal of Optimization 9 4 (1999) 1128-1134
19. Marchette D.J. Random Graphs for Statistical Pattern Recognition (2004), Wiley, New York
20. Mavroforakis, M.E., Sdralis, M., Theodoridis, S., 2006. A novel SVM geometric algorithm based on reduced convex hulls. In: ICPR'06: Proceedings of the 18th International Conference on Pattern Recognition, Washington, DC, USA. IEEE Computer Soc. Press, Silver Spring, MD, pp. 564-568.
21. McLachlan G.J., and Peel D. Finite Mixture Models. Wiley Series in Probability and Statistics (2000), Wiley-Interscience, New York
22. Priebe C.E., Marchette D.J., DeVinney J.G., and Socolinsky D.A. Classification using class cover catch digraphs. Journal of Classification 20 (2003) 3-23
23. Schölkopf B., and Smola A.J. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. Adaptive Computation and Machine Learning (2001), MIT Press, Cambridge, MA
24. Takigawa I., Abe N., Shidara Y., and Kudo M. The boosted/bagged subclass method. International Journal of Computing Anticipatory Systems 14 (2004) 311-320
25. Takigawa I., Kudo M., and Nakamura A. The convex subclass method: combinatorial classifier based on a family of convex sets. In: Perner P., and Imiya A. (Eds). Machine Learning and Data Mining in Pattern Recognition (MLDM 2005). LNAI, vol. 3587 (2005), Springer, Heidelberg, Berlin 90-99
26. Tuenter H.J.H. Minimum l1-distance projection onto the boundary of a convex set: simple characterization. Journal of Optimization Theory and Applications 112 2 (2002) 441-445
27. Vapnik V.N. Statistical Learning Theory (1998), Wiley-Interscience, New York
28. Welzl E. Smallest enclosing disks (balls and ellipsoids). New Results and New Trends in Computer Science. Lecture Notes in Computer Science vol. 555 (1991), Springer, Berlin 359-370
29. Zhou, D., Xiao, B., Zhou, H., 2004. Global geometry of SVM classifiers. Technical Report 30-5-02, Institute of Automation, Chinese Academy of Sciences.
30. Zhou G.L., Toh K.C., and Sun J. Efficient algorithms for the smallest enclosing ball problem. Computational Optimization and Applications 30 2 (2005) 147-160