Back

Title
  • en Margin Preserved Approximate Convex Hulls for Classification
Creator
Accessrights open access
Rights
  • en © 2010 IEEE. Reprinted, with permission, from Takahashi, T., Kudo, M., Margin Preserved Approximate Convex Hulls for Classification, 2010 20th International Conference on Pattern Recognition (ICPR), Aug. 2010. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Hokkaido University products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Subject
  • Other en Pattern recognition
  • Other en Margin
  • Other en Convex hull
  • NDC 007
Description
  • Abstract en The usage of convex hulls for classification is discussed with a practical algorithm, in which a sample is classified according to the distances to convex hulls. Sometimes convex hulls of classes are too close to keep a large margin. In this paper, we discuss a way to keep a margin larger than a specified value. To do this, we introduce a concept of "expanded convex hull" and confirm its effectiveness.
Publisher en IEEE
Date
    Issued2010-08
Language
  • eng
Resource Type conference paper
Version Type AM
Identifier HDL http://hdl.handle.net/2115/48299
Relation
  • isVersionOf DOI https://doi.org/10.1109/ICPR.2010.985
Journal
    • PISSN 1051-4651
      • en 2010 20th International Conference on Pattern Recognition (ICPR)
      • Page Start4052 Page End4055
Conference
    • 会議名 en International Conference on Pattern Recognition (ICPR)
    • 回次 20
    • 開催国 TUR
    • 開催地 en Istanbul
File
Oaidate 2023-07-26