Applying Backtracking in Hierarchical Classification to Recover from Error Propagation

Author/Creator ORCID

Date

2022-01-01

Department

Computer Science and Electrical Engineering

Program

Computer Science

Citation of Original Publication

Rights

This item may be protected under Title 17 of the U.S. Copyright Law. It is made available by UMBC for non-commercial research and education. For permission to publish or reproduce, please see http://aok.lib.umbc.edu/specoll/repro.php or contact Special Collections at speccoll(at)umbc.edu
Access limited to the UMBC community. Item may possibly be obtained via Interlibrary Loan through a local library, pending author/copyright holder's permission.
Access limited to the UMBC community. Item may possibly be obtained via Interlibrary Loan thorugh a local library, pending author/copyright holder's permission.

Abstract

Hierarchical classification has been previously demonstrated to yield more ac- curate results in comparison to flat classifiers; however, the tree-like structure intro- duces the problem of error propagation. Error propagation happens when a parent classifier within the hierarchy misclassifies an object. In traditional hierarchical structures, the system cannot recover from such misclassifications. In this paper, we propose a method of backtracking that allows the system to recover from such errors. For each non-root classifier in the structure, we add a new label option, "incorrect”. In the case that an object is classified as "incorrect” we perform back- tracking up the hierarchy and reclassify the object to the next best class from that previous level of the hierarchy. Through experimentation we have found that this method can help the system recover from individual instances of error propagation; however, more work is necessary to find an appropriate weight to give the "incorrect” class that doesn’t cause other errors, decreasing the over-all accuracy.