Meny

Du är här

Comparing and combining two approaches to automated subject classification of text

Författare:
Publiceringsår: 2006
Språk: Engelska
Sidor: 467-470
Publikation/Tidskrift/Serie: Research and Advanced Technology for Digital Libraries. Proceedings / Lecture Notes in Computer Science
Volym: 4172
Dokumenttyp: Konferensbidrag
Förlag: Springer Berlin / Heidelberg

Sammanfattning

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.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

10th European Conference, ECDL 2006
2006-09-17/2006-09-22
Alicante, Spain
Published
Yes
  • ISSN: 0302-9743

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen