Classifier Selection in a Family of Polyhedron Classifiers

  • Authors:
  • Tetsuji Takahashi;Mineichi Kudo;Atsuyoshi Nakamura

  • Affiliations:
  • Division of Computer Science Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814;Division of Computer Science Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814;Division of Computer Science Information Science and Technology, Hokkaido University, Sapporo, Japan 060-0814

  • Venue:
  • CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.