원문정보
초록
영어
The text representation, “bag of words” or vector space model, is widely used by most of the classifiers in text categorization. All the documents fed into the classifier are represented as a vector in the vector space, which consists of all the terms extracted from training set. Due to the characteristics of high dimensionality, feature selection algorithm is usually used to reduce the dimensionality of the vector space. Through feature selection, each document is represented by some representative terms extracted from the training set. Although the classification results based on this document representation methodare better, it is inevitable that some documents may contain few even none representative terms, and these documents must be misclassified. In this paper, we proposed a new text representation method, KT-of-DOC, which represents one document using some key terms extracted from this document. We selected key terms of each document based on six feature selection algorithms, Improved Gini Index (GINI), Information Gain (IG), Mutual Information (MI), Odds Ratio (OR), Ambiguity Measure (AM) and DIA association factor (DIA), respectively, and evaluated the performance of two classifiers, Support Vector Machines (SVM) and K-Nearest Neighbors (KNN), on three benchmark collections, 20-Newsgroups, Reuters-21578 and WebKB. The results show that the proposed representation method can significantly improve the performance of classifier.
목차
1. Introduction
2. Related Work
3. Algorithm Description
3.1. Problem and Motivation
3.2. Algorithm Implement
3.3 Complexity Analysis
4. Experiment Setup
4.1 Feature-Selection Algorithms
4.2. Data Sets
4.3 Classifiers
4.4. Performance Measures
5. Results
5.1 Results of Algorithm for SVM
5.2 Results of Algorithm for KNN
6. Discussions
7. Conclusion
Acknowledgment
References