Show simple item record

dc.contributor.advisorAdisantoso, Julio
dc.contributor.authorPutri, Arini Daribti
dc.date.accessioned2013-08-30T01:52:15Z
dc.date.available2013-08-30T01:52:15Z
dc.date.issued2013
dc.identifier.urihttp://repository.ipb.ac.id/handle/123456789/65199
dc.description.abstractIncreasing number of documents makes people more difficult to obtain the information which they desired. This problem requires text processing techniques to organize the documents in accordance with the categories. One of which is text classification. Text classification can organize document in accordance with predefined categories automatically (supervised machine learning). One popular method of text classification is support vector machines (SVM) that tries to find the best hyperplane in the input space. This algorithm is the best classification algorithm compared with other vector space classification method, namely Rocchio, k-nearest neighbor (KNN) and decision tree. This research measures the suitability of SVM for text classification and to prove whether the SVM is able to classify the documents in a linear separable manner. The final result shows that linear kernel and polynomial kernel in the SVM test produce the same accuracy value of 96.3504% and testing the RBF kernel produces accuracy of 95.6204% for classification of text documents using chi-squared feature selectionen
dc.subjectBogor Agricultural University (IPB)en
dc.subjectsupport vector machinesen
dc.subjectmachine learningen
dc.subjecttext classificationen
dc.titleKlasifikasi Dokumen Teks Menggunakan Metode Support Vector Machine dengan Pemilihan Fitur Chi-Square.en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record