Classifier Selection in a Family of Polyhedron Classifiers
We consider an algorithm to approximate each class region by a small number of convex hulls and to apply them to classification. The convex hull of a finite set of points is computationally hard to be constructed in high dimensionality. Therefore, instead of the exact convex hull, we find an approximate convex hull (a polyhedron) in a time complexity that is linear in dimension. On the other hand, the set of such convex hulls is often too much complicated for classification. Thus we control the complexity by adjusting the number of faces of convex hulls. For reducing the computational time, we use an upper bound of the leave-one-out estimated error to evaluate the classifiers.
KeywordsSupport Vector Machine Convex Hull Testing Error Support Plane Class Region
- 1.Kudo, M., Shimbo, M.: Appriximation of class region by convex hulls. Technical report of IEICE. PRMU 100, 1–6 (2000) (in Japanese)Google Scholar
- 3.Kudo, M., Takigawa, I., Nakamura, A.: Classification by reflective convex hulls. In: Proceedings of 19th International Conference on Pattern Recognision (ICPR 2008), Tampa, Florida, USA (2008)Google Scholar
- 5.Asuncion, A., Newman, D.: UCI machine learning repository (2007)Google Scholar
- 6.Zhou, D., Xiao, B., Zhou, H.: Global geometry of svm classifiers. Technical report, AI Lab, Institute of Automation, Chinese Academy of Sciences (2002)Google Scholar
- 7.Theodoridis, S., Mavroforakis, M.: Reduced convex hulls: A geometric approach to support vector machines. IEEE Signal Processing Magazine 1 (2007)Google Scholar