<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-018-04-0507</article-id>
      <article-id pub-id-type="publisher-id">23083</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>I.5.1 - Models</subject>
          <subject>I.5.3 - Clustering</subject>
          <subject>I.5.4 - Applications</subject>
          <subject>I.5.5 - Implementation</subject>
          <subject>J.4 - SOCIAL AND BEHAVIORAL SCIENCES</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>The Unification and Assessment of Multi-Objective Clustering Results of Categorical Datasets with H-Confidence Metric</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Sert</surname>
            <given-names>Onur Can</given-names>
          </name>
          <email xlink:type="simple">ocsert@etu.edu.tr</email>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Dursun</surname>
            <given-names>Kayhan</given-names>
          </name>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Özyer</surname>
            <given-names>Tansel</given-names>
          </name>
          <uri content-type="orcid">https://orcid.org/0000-0002-2529-5533</uri>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Jida</surname>
            <given-names>Jamal</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Alhajj</surname>
            <given-names>Reda</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
      </contrib-group>
      <aff id="A3">
        <label>3</label>
        <addr-line content-type="verbatim">TOBB Economics and Technology University, Ankara, Turkey</addr-line>
        <institution>TOBB Economics and Technology University</institution>
        <addr-line content-type="city">Ankara</addr-line>
        <country>Turkey</country>
      </aff>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Lebanese University, Tripoli, Lebanon</addr-line>
        <institution>Lebanese University</institution>
        <addr-line content-type="city">Tripoli</addr-line>
        <country>Lebanon</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">University of Calgary, Calgary, Canada</addr-line>
        <institution>University of Calgary</institution>
        <addr-line content-type="city">Calgary</addr-line>
        <country>Canada</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Onur Can Sert (<email xlink:type="simple">ocsert@etu.edu.tr</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2012</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>02</month>
        <year>2012</year>
      </pub-date>
      <volume>18</volume>
      <issue>4</issue>
      <fpage>507</fpage>
      <lpage>531</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/23970644-EF7F-558B-A439-457E157E5FDC">23970644-EF7F-558B-A439-457E157E5FDC</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/5504979">5504979</uri>
      <history>
        <date date-type="received">
          <day>29</day>
          <month>09</month>
          <year>2011</year>
        </date>
        <date date-type="accepted">
          <day>14</day>
          <month>12</month>
          <year>2011</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Onur Can Sert, Kayhan Dursun, Tansel Özyer, Jamal Jida, Reda Alhajj</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Multi objective clustering is one focused area of multi objective optimization. Multi objective optimization attracted many researchers in several areas over a decade. Utilizing multi objective clustering mainly considers multiple objectives simultaneously and results with several natural clustering solutions. Obtained result set suggests different point of views for solving the clustering problem. This paper assumes all potential solutions belong to different experts and in overall; ensemble of solutions finally has been utilized for finding the final natural clustering. We have tested on categorical datasets and compared them against single objective clustering result in terms of purity and distance measure of k-modes clustering. Our clustering results have been assessed to find the most natural clustering. Our results get hold of existing classes decided by human experts.</p>
      </abstract>
    </article-meta>
  </front>
</article>
