Skip to main content

A comparison of the performance of SVM and ARNI on Text Categorization with new filtering measures on an unbalanced collection

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2687))

Abstract

Text Categorization (TC) is the process of assigning documents to a set of previously fixed categories. A lot of research is going on with the goal of automating this time-consuming task due to the great amount of information available. Machine Learning (ML) algorithms are methods recently applied with this purpose. In this paper, we compare the performance of two of these algorithms (SVM and ARNI) on a collection with an unbalanced distribution of documents into categories. Feature reduction is previously applied with both classical measures (information gain and term frequency) and 3 new measures that we propose here for first time. We also compare their performance.

The research reported in this paper has been supported in part under MCyT and Feder grant TIC2001-3579 and FICYT grant BP01-114.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. W. Aha. A Study of Instance-based Algorithms for Supervised Learning Tasks: Mathematical, Empirical, and Psychological Evaluations. PhD thesis, University of California at Irvine, 1990.

    Google Scholar 

  2. C. Apte, F. Damerau, and S. Weiss. Automated learning of decision rules for text categorization. Information Systems, 12(3):233–251, 1994.

    Google Scholar 

  3. P. Clark and T. Niblett. The cn2 induction algorithm. Machine Learning, 3(4):261–283, 1989.

    Google Scholar 

  4. W. Cohen. Fast effective rule induction. In International Conference on Machine Learning, 1995.

    Google Scholar 

  5. W. Cohen. Learning to classify english text with ilp methods, 1995.

    Google Scholar 

  6. P. Domingos. Unifying instance-based and rule-based induction. Machine Learning, 24:141–168, 1996.

    Google Scholar 

  7. E. F-Combarro, I. Díaz, E. Monta nés, A. M. Pea, and J. Ranilla. Aplicacin de distintos mtodos de aprendizaje automtico a la clasificacin documental. In Con-ferencia Iberoamericana en Sistemas, Ciberntica e Informtica CISCI 2002, 2002.

    Google Scholar 

  8. J. Fürnkranz and G. Widmer. Incremental reduced error pruning. In International Conference on Machine Learning, pages 70–77, 1994.

    Google Scholar 

  9. T. Joachims. Text categorization with support vector machines: learning with many relevant features. In Claire Nédellec and Céline Rouveirol, editors, Proceedings of ECML-98, 10th European Conference on Machine Learning, number 1398, pages 137–142, Chemnitz, DE, 1998. Springer Verlag, Heidelberg, DE.

    Google Scholar 

  10. S. Muggleton. Inverse entailment and progol. New Generation Computing, Special issue on Inductive Logic Programming, 13(3–4):245–286, 1995.

    Article  Google Scholar 

  11. E. Monta nés, J. Fernández, I. Díaz, E. F. Combarro, and J. Ranilla. Text categorisation with support vector machines and feature reduction. In Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation CIMCA2003, 2003.

    Google Scholar 

  12. M. F. Porter. An algorithm for suffix stripping. Program (Automated Library and Information Systems), 14(3):130–137, 1980.

    Article  Google Scholar 

  13. J. R. Quinlan. Constructing decision tree in c4.5. In Programs of Machine Learning, pages 17–26. Morgan Kaufman, 1993.

    Google Scholar 

  14. J. Ranilla, M. Garca-Pellitero, and A. Bahamonde. Construccin de rboles de decisin usando el nivel de impureza. In Proc. of the VIII Conf. of the Spanish Asoc. for Artificial Intelligence, volume I, pages 34–41, 1999.

    Google Scholar 

  15. J. Ranilla, R. Mones, and A. Bahamonde. El nivel de impureza de una regla de clasificacin aprendida a partir de ejemplos. In VII Conferencia de la Asociacin Espaola para la Inteligencia Artificial, III Jornadas de Transferencia Tecnolgica de Inteligencia Artificial, volume I, pages 64–71, Murcia, Spain, 1999.

    Google Scholar 

  16. J. Rochio. Relevance feedback in information retrieval. smart retrieval system. In Experiments in automatic document processing, pages 313–323. 1971.

    Google Scholar 

  17. G. Salton and M. J. McGill. An introduction to modern information retrieval. McGraw-Hill, 1983.

    Google Scholar 

  18. F. Sebastiani. Machine learning in automated text categorisation. ACM Computing Survey, 34(1), 2002.

    Google Scholar 

  19. M. R. Spiegel. Estadstica. McGraw-Hill, 1970.

    Google Scholar 

  20. V. Vapnik. The Nature of Statistical Learning Theory. Springer-Verlag, 1995.

    Google Scholar 

  21. T. Yang and J. P. Pedersen. A comparative study on feature selection in text categorisation. In Proceedings of ICML’97, 14th International Conference on Machine Learning, pages 412–420, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Combarro, E.F., Montañés, E., Ranilla, J., Fernández, J. (2003). A comparison of the performance of SVM and ARNI on Text Categorization with new filtering measures on an unbalanced collection. In: Mira, J., Álvarez, J.R. (eds) Artificial Neural Nets Problem Solving Methods. IWANN 2003. Lecture Notes in Computer Science, vol 2687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44869-1_94

Download citation

  • DOI: https://doi.org/10.1007/3-540-44869-1_94

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40211-4

  • Online ISBN: 978-3-540-44869-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics