Abstract
Textual case bases can contain thousands of features in the form of tokens or words, which can inhibit classification performance. Recent developments in rough set theory and its applications to feature selection offer promising approaches for selecting and reducing the number of features. We adapt two rough set feature selection methods for use on n-ary class text categorization problems. We also introduce a new method for selecting features that computes the union of features selected from randomly-partitioned training subsets. Our comparative evaluation of our method with a conventional method on the Reuters-21578 data set shows that it can dramatically decrease training time without compromising classification accuracy. Also, we found that randomized training set partitions dramatically reduce training time.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chouchoulas, A., Shen, Q.: Rough-set aided keyword reduction for text categorization. Applied Artificial Intelligence 15, 843–873 (2001)
Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Com-puter and System Sciences 9, 256–278 (1974)
Li, Y., Shiu, S.C.K., Pal, S.K.: Combining feature reduction and case selection in building CBR classifiers. In: Pal, S.K., Aha, D.W., Gupta, K.M. (eds.) Case-based reasoning in knowledge discovery and data mining. Wiley, New York (2005) (to appear)
Pal, S.K., Shiu, S.C.K.: Foundations of soft case-based reasoning. Wiley, Hoboken (2004)
Pawlak, Z.: Rough sets: Theoretical aspects of reasoning about data. Kluwer, Dordrecht (1991)
Popova, V.N.: Knowledge discovery and monotonicity. Doctoral dissertation, Rotterdam School of Economics, Erasmus University, The Netherlands (2004)
Reuters (2005), http://www.daviddlewis.com/resources/testcollections/reuters21578
Wiratunga, N., Koychev, I., Massie, S.: Feature selection and generalization for re-trieval of textual cases. In: Proceedings of the Seventh European Conference on Case-Based Reasoning, Madrid, Spain, pp. 806–820. Springer, Heidelberg (2004)
Yang, Y., Pederson, J.: A comparative study of feature selection in text categorization. In: Proceedings of the Fourteenth International Conference on Machine Learning, pp. 412–420. Morgan Kaufmann, Nashville (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, K.M., Moore, P.G., Aha, D.W., Pal, S.K. (2005). Rough Set Feature Selection Methods for Case-Based Categorization of Text Documents. In: Pal, S.K., Bandyopadhyay, S., Biswas, S. (eds) Pattern Recognition and Machine Intelligence. PReMI 2005. Lecture Notes in Computer Science, vol 3776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590316_128
Download citation
DOI: https://doi.org/10.1007/11590316_128
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30506-4
Online ISBN: 978-3-540-32420-1
eBook Packages: Computer ScienceComputer Science (R0)