Skip to main content

An Analysis of Linear Weight Updating Algorithms for Text Classification

  • Conference paper
  • 1743 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3955))

Abstract

This paper addresses the problem of text classification in high dimensionality spaces by applying linear weight updating classifiers that have been highly studied in the domain of machine learning. Our experimental results are based on the Winnow family of algorithms that are simple to implement and efficient in terms of computation time and storage requirements. We applied an exponential multiplication function to weight updates and we experimentally calculated the optimal values of the learning rate and the separating surface parameters. Our results are at the level of the best results that were reported on the family of linear algorithms and perform nearly as well as the top performing methodologies in the literature.

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. Aas, K., Eikvil, L.: Text categorization: A survey. Technical report, Norwegian Computing Center (1999)

    Google Scholar 

  2. Apte, C., Damerau, F., Weiss, S.: Toward language independent automated learning of text categorization models. In: Proceedings SIGIR 1994 (1994)

    Google Scholar 

  3. Cortes, C., Vapnik, V.: Support vector networks. Machine Learning 20, 273–297 (1995)

    MATH  Google Scholar 

  4. Dagan, I., Karov, K., Roth, D.: Mistake-Driven Learning in Text Categorization. In: Proceedings of the Second Conference on Empirical Methods in NLP, pp. 55–63 (1997)

    Google Scholar 

  5. Kivinen, J., Warmuth, M., Auer, P.: The Perceptron Algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence 97(1-2), 325–343 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning 2, 285–318 (1988)

    Google Scholar 

  7. Sebastiani, F.: Machine learning in automated text categorization. ACM Computing Surveys 34(1), 1–47 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gkiokas, A., Demiros, I., Piperidis, S. (2006). An Analysis of Linear Weight Updating Algorithms for Text Classification. In: Antoniou, G., Potamias, G., Spyropoulos, C., Plexousakis, D. (eds) Advances in Artificial Intelligence. SETN 2006. Lecture Notes in Computer Science(), vol 3955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752912_56

Download citation

  • DOI: https://doi.org/10.1007/11752912_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34117-8

  • Online ISBN: 978-3-540-34118-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics