Abstract

Abstract Hierarchical text classification or simply hierarchical classification refers to assigning a document to one or more suitable categories from a hierarchical category space. In our literature survey, we have found that the existing hierarchical classification experiments used a variety of measures to evaluate performance. These performance measures often assume independence between categories and do not consider documents misclassified into categories that are similar or not far from the correct categories in the category tree. In this paper, we therefore propose new performance measures for hierarchical classification. The proposed performance measures consist of category similarity measures and distance‐based measures that consider the contributions of misclassified documents. Our experiments on hierarchical classification methods based on SVM classifiers and binary Naïve Bayes classifiers showed that SVM classifiers perform better than Naïve Bayes classifiers on Reuters‐21578 collection according to the extended measures. A new classifier‐centric measure called blocking measure is also defined to examine the performance of subtree classifiers in a top‐down level‐based hierarchical classification method.

Keywords

Computer scienceNaive Bayes classifierArtificial intelligenceSupport vector machineClassifier (UML)Document classificationMachine learningMeasure (data warehouse)Data miningPattern recognition (psychology)

Affiliated Institutions

Related Publications

Publication Info

Year
2003
Type
article
Volume
54
Issue
11
Pages
1014-1028
Citations
70
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

70
OpenAlex

Cite This

Aixin Sun, Ee‐Peng Lim, Wee Keong Ng (2003). Performance measurement framework for hierarchical text classification. Journal of the American Society for Information Science and Technology , 54 (11) , 1014-1028. https://doi.org/10.1002/asi.10298

Identifiers

DOI
10.1002/asi.10298