Construction of convex hull classifiers in high dimensions

Takahashi, Tetsuji; Kudo, Mineichi; Nakamura, Atsuyoshi

doi:10.1016/j.patrec.2011.06.020


Hokkaido University \| Library \| HUSCAP	Advanced Search		言語

	Home
	About HUSCAP
	Open Access Policy

	Browse by Author

Browse
	Communities & Collections

	Scholarly Journals
	Theses
	Doctoral Dissertations Listed by Graduate Schools
	Conference Procs.
	Events

	HUSCAP Senior (in Japanese)

	Societies

	Downloads (country)

For university staff
	How to post your papers to HUSCAP
	Publication of theses
	Helpline about theses publication

Open Archives Compliant

You can search our collection also at:
	Google
	Google Scholar
	CiNii
	IRDB
	OAIster
	NDLTD

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

Construction of convex hull classifiers in high dimensions

Files in This Item:

PRL32-16_2224-2230.pdf

530.32 kB

PDF

View/Open

Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/47979

Title:	Construction of convex hull classifiers in high dimensions
Authors:	Takahashi, Tetsuji Browse this author
	Kudo, Mineichi Browse this author →KAKEN DB
	Nakamura, Atsuyoshi Browse this author
Keywords:	Pattern recognition
	Convex hull
	Classifier selection
Issue Date:	1-Dec-2011
Publisher:	Elsevier B.V.
Journal Title:	Pattern Recognition Letters
Volume:	32
Issue:	16
Start Page:	2224
End Page:	2230
Publisher DOI:	10.1016/j.patrec.2011.06.020
Abstract:	We propose an algorithm to approximate each class region by a small number of approximated convex hulls and to use these for classification. The classifier is one of non-kernel maximum margin classifiers. It keeps the maximum margin in the original feature space, unlike support vector machines with a kernel. The construction of an exact convex hull requires an exponential time in dimension, so we find an approximate convex hull (a polyhedron) instead, which is constructed in linear time in dimension. We also propose a model selection procedure to control the number of faces of convex hulls for avoiding over-fitting, in which a fast procedure is adopted to calculate an upper-bound of the leave-one-out error. In comparison with support vector machines, the proposed approach is shown to be comparable in performance but more natural in the extension to multi-class problems.
Type:	article (author version)
URI:	http://hdl.handle.net/2115/47979
Appears in Collections:	情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 工藤峰一

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University