Abstract
The basic k-nearest neighbor classifier works well in text classification. However, improving performance of the classifier is still attractive. Combining multiple classifiers is an effective technique for improving accuracy. There are many general combining algorithms, such as Bagging, or Boosting that significantly improve the classifier such as decision trees, rule learners, or neural networks. Unfortunately, these combining methods do not improve the nearest neighbor classifiers. In this paper we present a new approach to general multiple reducts based on rough sets theory, in which we apply multiple reducts to improve the performance of the k-nearest neighbor classifier. This paper describes the proposed technique and provides experimental results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Joachims, “Text Classification with Support Vector Machines: Learning with Many Relevant Features”, ECML-98, 10th European Conference on Machine Learning, 1998, pp. 170–178.
M. Craven, D. Dipasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam & S. Slattery, “Learning to Symbolic Knowledge from the World Wide Web”, Proceeding of the 15th Na-tional Conference on Artificial Intelligence (AAAI-98), 1998, pp. 509–516.
K. Lang, “Newsweeder: Learning to Filter Netnews”, Machine Learning: Proceeding of the Twelfth International (ICML95), 1995, pp. 331–339.
Y. Yang, “An Evaluation of Statistical Approaches to Text Classification”, Journal of Infor-mation Retrieval, 1, 1999, pp. 69–90.
A. Skowron & C. Rauszer, “The Discernibility Matrices and Functions in Information Systems”, in R. Slowinski (ed.) Intelligent Decision Support—Handbook of Application and Advances of Rough Sets Theory, Kluwer Academic Publishers, Dordrecht, 1992, pp. 331–362.
S.D. Bay, “ Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets”, Intelligent Data Analysis, 3(3), 1999, pp. 191–209.
Itqon, S. Kaneko & S. Igarashi, “ Combining Multiple k-Nearest Neighbor Classifiers Using Feature Combinations”, Journal IECI, 2(3), 2000, pp. 23–319.
Y. Bao, S. Aoyama, X. Du, K. Yamada & N. Ishii, “A Rough Set-Based Hybrid Method to Text Categorization”, Proc. 2nd International Conf. on Web Information Systems Engi-neering, Kyoto, Japan, pp. 254–261, Dec. 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, Y., Ishii, N. (2002). Combining Multiple K-Nearest Neighbor Classifiers for Text Classification by Reducts. In: Lange, S., Satoh, K., Smith, C.H. (eds) Discovery Science. DS 2002. Lecture Notes in Computer Science, vol 2534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36182-0_34
Download citation
DOI: https://doi.org/10.1007/3-540-36182-0_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00188-1
Online ISBN: 978-3-540-36182-4
eBook Packages: Springer Book Archive