On Machine Learning Methods for Chinese Document Categorization

  • Authors:
  • Ji He;Ah-Hwee Tan;Chew-Lim Tan

  • Affiliations:
  • School of Computing, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260 heji@comp.nus.edu.sg;Nanyang Technological University, School of Computer Engineering, Blk N4, 2A-13 Nanyang Avenue, Singapore 639798. asahtan@ntu.edu.sg;School of Computing, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260. tancl@comp.nus.edu.sg

  • Venue:
  • Applied Intelligence
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper reports our comparative evaluation of three machine learning methods, namely k Nearest Neighbor (kNN), Support Vector Machines (SVM), and Adaptive Resonance Associative Map (ARAM) for Chinese document categorization. Based on two Chinese corpora, a series of controlled experiments evaluated their learning capabilities and efficiency in mining text classification knowledge. Benchmark experiments showed that their predictive performance were roughly comparable, especially on clean and well organized data sets. While kNN and ARAM yield better performances than SVM on small and clean data sets, SVM and ARAM significantly outperformed kNN on noisy data. Comparing efficiency, kNN was notably more costly in terms of time and memory than the other two methods. SVM is highly efficient in learning from well organized samples of moderate size, although on relatively large and noisy data the efficiency of SVM and ARAM are comparable.