Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

PDF

Computer Sciences

2016

University of Nebraska - Lincoln

Hierarchical labeling

Articles 1 - 1 of 1

Full-Text Articles in Engineering

Learning Hierarchically Decomposable Concepts With Active Over-Labeling, Yuji Mo, Stephen Scott, Doug Downey Jan 2016

Learning Hierarchically Decomposable Concepts With Active Over-Labeling, Yuji Mo, Stephen Scott, Doug Downey

CSE Conference and Workshop Papers

Many classification tasks target high-level concepts that can be decomposed into a hierarchy of finer-grained subconcepts. For example, some string entities that are Locations are also Attractions, some Attractions are Museums, etc. Such hierarchies are common in named entity recognition (NER), document classification, and biological sequence analysis. We present a new approach for learning hierarchically decomposable concepts. The approach learns a high-level classifier (e.g., location vs. non-location) by seperately learning multiple finer-grained classifiers (e.g., museum vs. non-museum), and then combining the results. Soliciting labels at a finer level of granularity than that of the target concept is a new approach …