Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-27T21:23:13.037Z Has data issue: false hasContentIssue false
  • English
  • Français

Selecting effective index terms using a decision tree

Published online by Cambridge University Press:  21 August 2002

TOKUNAGA TAKENOBU ,
KIMURA KENJI ,
OGIBAYASHI HIRONORI  and
TANAKA HOZUMI
TOKUNAGA TAKENOBU
Affiliation:
Department of Computer Science, Tokyo Institute of Technology, Tokyo, Japan
KIMURA KENJI
Affiliation:
Department of Computer Science, Tokyo Institute of Technology, Tokyo, Japan
OGIBAYASHI HIRONORI
Affiliation:
Department of Computer Science, Tokyo Institute of Technology, Tokyo, Japan
TANAKA HOZUMI
Affiliation:
Department of Computer Science, Tokyo Institute of Technology, Tokyo, Japan
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper explores the effectiveness of index terms more complex than the single words used in conventional information retrieval systems. Retrieval is done in two phases: in the first, a conventional retrieval method (the Okapi system) is used; in the second, complex index terms such as syntactic relations and single words with part-of-speech information are introduced to rerank the results of the first phase. We evaluated the effectiveness of the different types of index terms through experiments using the TREC-7 test collection and 50 queries. The retrieval effectiveness was improved for 32 out of 50 queries. Based on this investigation, we then introduce a method to select effective index terms by using a decision tree. Further experiments with the same test collection showed that retrieval effectiveness was improved in 25 of the 50 queries.

Type
Research Article
Information
Natural Language Engineering , Volume 8 , Issue 2-3 , June 2002 , pp. 193 - 207
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)