The vast quantity of information on the Web has resulted in the proliferation of topic hierarchies that allow users to browse, rather than search, for Web pages. In our research on conceptual retrieval, we classify documents during indexing so that they can later be retrieved by a combination of keyword and conceptual match. These and other applications have created a need for tools that automatically classify new documents with respect to such hierarchies. Most approaches use flat classifiers that ignore the hierarchical structure, treating each topic as a separate class. Although these flat classifiers are computationally simple, they fail to exploit the information inherent in the structural relationship between topics. This paper explores the use of hierarchical structure for classifying a large, heterogeneous collection of Web content. Use of the hierarchical structure during classification has resulted in a significant improvement of 45.4% in exact match precision when compared with a flat classifier.
[1]
Ee-Peng Lim,et al.
Performance measurement framework for hierarchical text classification
,
2003,
J. Assoc. Inf. Sci. Technol..
[2]
L. R. Rasmussen,et al.
In information retrieval: data structures and algorithms
,
1992
.
[3]
Aaron Kershenbaum,et al.
The Effect of Using Hierarchical Classifiers in Text Categorization
,
2000,
RIAO.
[4]
Víctor Pàmies,et al.
Open Directory Project
,
2003
.
[5]
Alexander Pretschner,et al.
Ontology-Based User Profiles for Search and Browsing
,
2002
.
[6]
Susan T. Dumais,et al.
Hierarchical classification of Web content
,
2000,
SIGIR '00.