Proceedings

Does a New Simple Gaussian Weighting Approach Perform Well in Text Categorization?

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 581-585.

© 2003 International Joint Conferences on Artificial Intelligence

Abstract

A new approach to the Text Categorization problem is here presented. It is called Gaussian Weighting and it is a supervised learning algorithm that, during the training phase, estimates two very simple and easily computable statistics which are: the Presence P, how much a term tis present in a category c; the Expressiveness E, how much t is present outside c in the rest of the domain. Once the system has learned this information, a Gaussian function is shaped for each term of a category, in order to assign the term a weight that estimates the level of its importance for that particular category. We tested our learning method on the task of single-label classification using the Reuters-21578 benchmark. The outcome of the result was quite impressive: in different experimental setups, we reached a microaveraged F1-measure of0 .89, with a peak of0 .899. Moreover, a macro-averaged Recall and Precision was calculated: the former reported a 0.72, the latter a 0.79. These results reach most of the stateof-the-art techniques of machine learning applied to Text Categorization, demonstrating that this new weighting scheme does perform well on this particular task.

  1. [Chickering eta!., 1997] D. Chickering, D. Heckerman, and C. Meek. A bayesian approach for learning bayesian net- works with local structure. In Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence, pages 307-315. Springer Verlag, Heidelberg, DE, 1997.
  2. [Dumais eta!., 1998] S. Dumais, J. Platt, D. Heckerman, and M. Sahami. Inductive learning algorithms and representa- tions for text categorization. In Proceedings of the Seventh International Conference on Information and Knowledge Management, pages 148-155. ACM Press, 1998.
  3. [Hull, 1994] D.A. Hull. Information Retrieval Using Statis- tical Classification. PhD thesis, University of Stanford, 1994.
  4. [Joachims, 1998] T. Joachims. Text categorization with sup- port vector machines: learning with many relevant fea- tures. In C. Nedellec and C. Rouveirol, editors, Proceed- ings of ECML-98, 1Oth European Conference on Machine Learning, number 1398, pages 137-142, Chemnitz, DE, 1998. Springer Verlag, Heidelberg, DE.
  5. [Kohavi and John, 1997] R. Kohavi and G. H. John. Wrap- pers for feature subset selection. Artificial Intelligence, 97(1-2):273-324, 1997.
  6. [Lewis, 1998] D. D. Lewis. Naive (Bayes) at forty : The independence assumption in information retrieval. In C. Nedellec and C. Rouveirol, editors, Proceedings of ECML-98, lOth European Conference on Machine Learn- ing, number 1398, pages 4-15, Chernnitz, DE, 1998. Springer Verlag, Heidelberg, DE.
  7. [Rocchio, 1971] J.J. Rocchio. Relevance feedback in infor- mation retrieval. In The SMART Retrieval System: Exper- iments in Automatic Document PRocessing, pages 313- 323 .
  8. G.Salton editor, 1971.
  9. [Sahami, 1996] M. Sahami. Learning limited dependence Bayesian classifiers. In Second International Conference on Knowledge Discovery in Databases, 1996.
  10. [Sebastiani, 2002] F. Sebastiani. Machine learning in auto- mated text categorization. ACM Computing Surveys, Vol. 34, No.1, pp.l-47, 2002.
  11. [Yang and Liu, 1999] Y. Yang and X. Liu. A re-examination of text categorization methods. In 22nd Annual Interna- tional SIGIR, pages 42--49, Berkley, 1999.
  12. [Yang and Pedersen, 1997] Y. Yang and J. 0. Pedersen. A comparative study on feature selection in text categoriza- tion. In Douglas H. Fisher, editor, Proceedings of ICML- 97, 14th International Conference on Machine Learning, pages 412--420, Nashville, US, 1997.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards