Dergi makalesi Açık Erişim

The nearest polyhedral convex conic regions for high-dimensional classification

Cevikalp, Hakan; Cimen, Emre; Ozturk, Gurkan


DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/234240</identifier>
  <creators>
    <creator>
      <creatorName>Cevikalp, Hakan</creatorName>
      <givenName>Hakan</givenName>
      <familyName>Cevikalp</familyName>
      <affiliation>Eskisehir Osmangazi Univ, Fac Engn &amp; Architecture, Dept Elect &amp; Elect Engn, Eskisehir, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Cimen, Emre</creatorName>
      <givenName>Emre</givenName>
      <familyName>Cimen</familyName>
      <affiliation>Eskisehir Tech Univ, Computat Intelligence &amp; Optimizat Lab, Dept Ind Engn, Fac Engn, Eskisehir, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Ozturk, Gurkan</creatorName>
      <givenName>Gurkan</givenName>
      <familyName>Ozturk</familyName>
      <affiliation>Eskisehir Tech Univ, Computat Intelligence &amp; Optimizat Lab, Dept Ind Engn, Fac Engn, Eskisehir, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>The Nearest Polyhedral Convex Conic Regions For High-Dimensional Classification</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2021</publicationYear>
  <dates>
    <date dateType="Issued">2021-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/234240</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.3906/elk-2005-142</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">In the nearest-convex-model type classifiers, each class in the training set is approximated with a convex class model, and a test sample is assigned to a class based on the shortest distance from the test sample to these class models. In this paper, we propose new methods for approximating the distances from test samples to the convex regions spanned by training samples of classes. To this end, we approximate each class region with a polyhedral convex conic region by utilizing polyhedral conic functions (PCFs) and its extension, extended PCFs. Then, we derive the necessary formulations for computing the distances from test samples to these new models. We tested the proposed methods on different high-dimensional classification tasks including face, digit, and generic object classification as well as on some lower-dimensional classification problems. The experimental results on different datasets show that the proposed classifiers achieve either the best or comparable results on high-dimensional classification problems compared to other nearest-convex-model classifiers, which shows the superiority of the proposed methods.</description>
  </descriptions>
</resource>
10
4
görüntülenme
indirilme
Görüntülenme 10
İndirme 4
Veri hacmi 824 Bytes
Tekil görüntülenme 7
Tekil indirme 4

Alıntı yap