Presentation 2008-12-18
Classifier selection in a family of polyhedron classifiers
Tetsuji TAKAHASHI, Mineichi KUDO, Astuhiro NAKAMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is an efficient way to approximate a class region by convex hulls of samples. However, the convex hull is computationally hard to be constructed in high dimensions. In this paper, we propose a way to construct an approximate convex hull in a linear time of dimension. In addition, we discuss on selecting an optimal classifier from a family of polyhedron classifiers derived from approximate convex hulls.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Pattern recognition / Convex hull / Generalization error / Classifier selection
Paper # PRMU2008-153
Date of Issue

Conference Information
Committee PRMU
Conference Date 2008/12/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Pattern Recognition and Media Understanding (PRMU)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Classifier selection in a family of polyhedron classifiers
Sub Title (in English)
Keyword(1) Pattern recognition
Keyword(2) Convex hull
Keyword(3) Generalization error
Keyword(4) Classifier selection
1st Author's Name Tetsuji TAKAHASHI
1st Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University()
2nd Author's Name Mineichi KUDO
2nd Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
3rd Author's Name Astuhiro NAKAMURA
3rd Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
Date 2008-12-18
Paper # PRMU2008-153
Volume (vol) vol.108
Number (no) 363
Page pp.pp.-
#Pages 5
Date of Issue