Comparing and combining two approaches to automated subject classification of text

  • Authors:

  • Koraljka Golub;Anders Ardö;Dunja Mladenić;Marko Grobelnik

  • Affiliations:

  • KnowLib Research Group, Dept. of Information Technology, Lund University, Sweden;KnowLib Research Group, Dept. of Information Technology, Lund University, Sweden;J. Stefan Institute, Ljubljana, Slovenia;J. Stefan Institute, Ljubljana, Slovenia

  • Venue:
  • ECDL'06 Proceedings of the 10th European conference on Research and Advanced Technology for Digital Libraries
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A machine-learning and a string-matching approach to automated subject classification of text were compared, as to their performance, advantages and downsides. The former approach was based on an SVM algorithm, while the latter comprised string-matching between a controlled vocabulary and words in the text to be classified. Data collection consisted of a subset from Compendex, classified into six different classes. It was shown that SVM on average outperforms the string-matching approach: our hypothesis that SVM yields better recall and string-matching better precision was confirmed only on one of the classes. The two approaches being complementary, we investigated different combinations of the two based on combining their vocabularies. The results have shown that the original approaches, i.e. machine-learning approach without using background knowledge from the controlled vocabulary, and string-matching approach based on controlled vocabulary, outperform approaches in which combinations of automatically and manually obtained terms were used. Reasons for these results need further investigation, including a larger data collection and combining the two using predictions.