A hybrid text classification approach with low dependency on parameter by integrating K-nearest neighbor and support vector machine

被引:84
作者
Wan, Chin Heng [2 ]
Lee, Lam Hong [1 ]
Rajkumar, Rajprasad [1 ]
Isa, Dino [1 ]
机构
[1] Univ Nottingham, Intelligent Syst Res Grp, Fac Engn, Semenyih 43500, Selangor, Malaysia
[2] Univ Tunku Abdul Rahman, Fac Informat & Commun Technol, Kampar 31900, Perak, Malaysia
关键词
Text document classification; K-nearest neighbor; Support vector machine; Euclidean distance function;
D O I
10.1016/j.eswa.2012.02.068
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work implements a new text document classifier by integrating the K-nearest neighbor (KNN) classification approach with the support vector machine (SVM) training algorithm. The proposed Nearest Neighbor-Support Vector Machine hybrid classification approach is coined as SVM-NN. The KNN has been reported as one of the widely used text classification approaches due to its simplicity and efficiency in handling various types of text classification tasks. However, there exists a major problem of the KNN in determining the appropriate value for parameter K in order to guarantee high classification effectiveness. This is due to the fact that the selection of the value of parameter K has high impact on the accuracy of the KNN classifier. Other than determining the optimal value of parameter K, the KNN is also a lazy learning method which keeps the entire training samples until classification time. Hence, the computational process of the KNN has become intensive when the value of parameter K increases. In this paper, we propose the SVM-NN hybrid classification approach with the objective that to minimize the impact of parameter on classification accuracy. In the training stage, the SVM is utilized to reduce the training samples for each of the available categories to their support vectors (SVs). The SVs from different categories are used as the training data of nearest neighbor classification algorithm in which the Euclidean distance function is used to calculate the average distance between the testing data point to each set of SVs of different categories. The classification decision is made based on the category which has the shortest average distance between its SVs and the testing data point. The experiments on several benchmark text datasets show that the classification accuracy of the SVM-NN approach has low impact on the value of parameter, as compared to the conventional KNN classification model. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:11880 / 11888
页数:9
相关论文
共 51 条
  • [1] Androutsopoulos I., 2000, SIGIR Forum, V34, P160
  • [2] [Anonymous], 2002, Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
  • [3] AUTOMATED LEARNING OF DECISION RULES FOR TEXT CATEGORIZATION
    APTE, C
    DAMERAU, F
    WEISS, SM
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 1994, 12 (03) : 233 - 251
  • [4] Apte C., 1994, SIGIR '94. Proceedings of the Seventeenth Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, P23
  • [5] Blanzieri E, 2007, FLAIRS C, P441
  • [6] Blanzieri E., 2007, P 4 C EM ANT AUG 2 3, P5
  • [7] Estimation of individual prediction reliability using the local sensitivity analysis
    Bosnic, Zoran
    Kononenko, Igor
    [J]. APPLIED INTELLIGENCE, 2008, 29 (03) : 187 - 203
  • [8] Callut J, 2008, LECT NOTES ARTIF INT, V5211, P162, DOI 10.1007/978-3-540-87479-9_29
  • [9] Cardoso-Cachopo A, 2009, DATASETS SINGLE LABE
  • [10] Fast and accurate text classification via multiple linear discriminant projections
    Chakrabarti, S
    Roy, S
    Soundalgekar, MV
    [J]. VLDB JOURNAL, 2003, 12 (02) : 170 - 185