1 Ocak 2011 Dergi makalesi Açık Erişim

Bagirov, Adil M.; Ugon, Julien; Webb, Dean; Karasozen, B.

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/22323</identifier>
  <creators>
    <creator>
      <creatorName>Bagirov, Adil M.</creatorName>
      <givenName>Adil M.</givenName>
      <familyName>Bagirov</familyName>
      <affiliation>Univ Ballarat, CIAO, Sch Informat Technol &amp; Math Sci, Ballarat, Vic 3353, Australia</affiliation>
    </creator>
    <creator>
      <creatorName>Ugon, Julien</creatorName>
      <givenName>Julien</givenName>
      <familyName>Ugon</familyName>
      <affiliation>Univ Ballarat, CIAO, Sch Informat Technol &amp; Math Sci, Ballarat, Vic 3353, Australia</affiliation>
    </creator>
    <creator>
      <creatorName>Webb, Dean</creatorName>
      <givenName>Dean</givenName>
      <familyName>Webb</familyName>
      <affiliation>Univ Ballarat, CIAO, Sch Informat Technol &amp; Math Sci, Ballarat, Vic 3353, Australia</affiliation>
    </creator>
    <creator>
      <creatorName>Karasozen, B.</creatorName>
      <givenName>B.</givenName>
      <familyName>Karasozen</familyName>
    </creator>
  </creators>
  <titles>
    <title>Classification Through Incremental Max-Min Separability</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2011</publicationYear>
  <dates>
    <date dateType="Issued">2011-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/22323</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1007/s10044-010-0191-9</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">Piecewise linear functions can be used to approximate non-linear decision boundaries between pattern classes. Piecewise linear boundaries are known to provide efficient real-time classifiers. However, they require a long training time. Finding piecewise linear boundaries between sets is a difficult optimization problem. Most approaches use heuristics to avoid solving this problem, which may lead to suboptimal piecewise linear boundaries. In this paper, we propose an algorithm for globally training hyperplanes using an incremental approach. Such an approach allows one to find a near global minimizer of the classification error function and to compute as few hyperplanes as needed for separating sets. We apply this algorithm for solving supervised data classification problems and report the results of numerical experiments on real-world data sets. These results demonstrate that the new algorithm requires a reasonable training time and its test set accuracy is consistently good on most data sets compared with mainstream classifiers.</description>
  </descriptions>
</resource>