Turkish Document Classification Using Shorter Roots
Cataltepe, Z.
Turan, Y.
Kesgin, F.
Istanbul Teknik Univ., Istanbul;
This paper appears in: Signal Processing and Communications Applications, 2007. SIU 2007. IEEE 15th
Publication Date: 11-13 June 2007
On page(s): 1-4
Location: Eskisehir,
ISBN: 1-4244-0719-2
INSPEC Accession Number: 9774527
Digital Object Identifier: 10.1109/SIU.2007.4298786
Current Version Published: 2007-09-04
Abstract
Stemming is one of commonly used pre-processing steps in document categorization. Especially when fast and accurate classification of a lot of documents is needed, it is important to have as small number of and as small length roots as possible. This would not only reduce the time it takes to train and test classifiers but also would reduce the storage requirements for each document. In this study, we analyze the performance of classifiers when the longest or shortest roots found by a stemmer are used. We also analyze the effect of using only the consonants in the roots. We use two document data sets, obtained from Milliyet newspaper and Wikipedia to analyze classification accuracy of classifiers when roots obtained under these four conditions are used. We also analyze the classification accuracy when only the first 4, 3 or 2 letters or consonants are used from the roots. Using smaller roots results in smaller number of TF-IDF vectors. Especially for small sized TF-IDF vectors, using only consonants in the roots gives better performance than using all letters in the roots.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
