<?xml version="1.0" encoding="UTF-8"?>

<article xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.3" xml:lang="en">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher">setsci</journal-id>
   <journal-title-group>
    <journal-title>Setsci conference indexing system</journal-title>
   </journal-title-group>
   <issn>2618-6446</issn>
   <publisher>
    <publisher-name>SET Technology</publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="publisher-id">f2a2633c-d224-4e07-bf8a-831514b3c8f1</article-id>
   <title-group>
    <article-title>Comparison of Text Classification Performances in Balanced and Imbalanced Datasets</article-title>
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" corresp="yes">
     <name>
      <surname>Karaca</surname>
      <given-names>Mehmet Fatih</given-names>
     </name>
     <xref ref-type="aff" rid="aff1"/>
    </contrib>
    <contrib contrib-type="author">
     <name>
      <surname>Bayır</surname>
      <given-names>Şafak</given-names>
     </name>
     <xref ref-type="aff" rid="aff2"/>
    </contrib>
   </contrib-group>
   <aff id="aff1">
    <institution>Department of Computer Technologies, Gaziosmanpaşa University</institution>
   </aff>
   <aff id="aff2">
    <institution>Department of Computer Engineering, Karabük University</institution>
   </aff>
   <pub-date date-type="pub">
    <day>23</day>
    <month>06</month>
    <year>2018</year>
   </pub-date>
   <volume>2</volume>
   <fpage>223</fpage>
   <lpage>223</lpage>
   <permissions>
    <copyright-statement>© 2018 SET Technology</copyright-statement>
    <copyright-year>2018</copyright-year>
    <copyright-holder>SET Technology</copyright-holder>
    <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
     <license-p>CC BY 4.0</license-p>
    </license>
   </permissions>
   <abstract>
    <p>Text mining, which aims to derive unknown and useful information from available textual data, is one of the subfield&#13;
of data mining. Text mining transforms unstructured textual data into structured form by utilizing various methods. Data mining&#13;
techniques can also be applied to textual data as a result of transformation to structured form. Text classification which is one of&#13;
the widely favoured subject of text mining is the process of assigning texts into predefined classes. As a result of this,&#13;
classification is realized more rapidly and consistently.&#13;
&#13;
In this study, text classification performances in balanced and imbalanced datasets were compared. Corpora which consist of&#13;
Turkish and English texts were utilized. The features of 4 datasets including 5 classes in each were as follows: Corpus 1 and&#13;
Corpus 3 include Turkish contents and Corpus 2 and Corpus 4 include English contents. 3375 training and 1125 test documents&#13;
were included in the Corpus 1 and Corpus 2 which are balanced datasets, whereas 1825 training and 825 test documents were&#13;
included in the Corpus 3 and Corpus 4 which are imbalanced datasets.&#13;
&#13;
Documents included in datasets were pre-processed, weighted as binary and tf-idf and document vectors were obtained. kNN&#13;
was preferred for text classification and Manhattan Distance, Harmonic Mean, Inner Product, Squared Chord and Dice’s&#13;
Coefficient were selected for the measurement of similarities of document vectors.&#13;
&#13;
Results were taken into consideration in terms of classification success as well as process time. Since the number of the documents within the classes are equal, it is seen that more successful classification was obtained in terms of average values in both Turkish and English content balanced datasets but the process time was longer.  </p>
   </abstract>
   <kwd-group xml:lang="en">
    <kwd>text mining, text classification, kNN, balanced dataset, imbalanced dataset</kwd>
   </kwd-group>
   <kwd-group xml:lang="en">
    <kwd>text mining, text classification, kNN, balanced dataset, imbalanced dataset</kwd>
   </kwd-group>
  </article-meta>
 </front>
</article>
