2005
DOI: 10.1007/11527862_24
|View full text |Cite
|
Sign up to set email alerts
|

Learning Classifiers Using Hierarchically Structured Class Taxonomies

Abstract: Abstract. We consider classification problems in which the class labels are organized into an abstraction hierarchy in the form of a class taxonomy. We define a structured label classification problem. We explore two approaches for learning classifiers in such a setting. We also develop a class of performance measures for evaluating the resulting classifiers. We present preliminary results that demonstrate the promise of the proposed approaches.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0
2

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 66 publications
(41 citation statements)
references
References 4 publications
0
39
0
2
Order By: Relevance
“…By doing this, the class predictions respect the hierarchy constraints. This approach was proposed by Wu et al (2005) and was referred to as "Binarized Structured Label Learning" (BSLL).…”
Section: Local Classifier Per Node Approachmentioning
confidence: 99%
See 2 more Smart Citations
“…By doing this, the class predictions respect the hierarchy constraints. This approach was proposed by Wu et al (2005) and was referred to as "Binarized Structured Label Learning" (BSLL).…”
Section: Local Classifier Per Node Approachmentioning
confidence: 99%
“…There are, at least, two approaches that could be used to cope with the multi-label scenario. One is to use a multi-label classifier at each parent node, as done by Wu et al (2005). The second approach is to take into account the different confidence scores provided by each classifier and have some kind of decision thresholds based on those scores to allow multiple labels.…”
Section: Local Classifier Per Parent Node Approachmentioning
confidence: 99%
See 1 more Smart Citation
“…The first proposals in which sequential boolean decisions are applied in combination with local classifiers per node can be found in (D'Alessio et al, 2000), (Dumais & Chen, 2000), and (Sun & Lim, 2001). In Wu et al (2005), the idea of mirroring the taxonomy structure through binary classifiers is clearly highlighted; the authors call this technique "binarized structured label learning". In PF, given a taxonomy, where each node represents a classifier entrusted with recognizing all corresponding positive inputs (i.e., interesting documents), each input traverses the taxonomy as a "token", starting from the root.…”
Section: Vertical Combinationmentioning
confidence: 99%
“…Desse modo, a taxonomia de classes pode ser definida como uma árvore estruturada sobre um conjunto parcialmente ordenado (L, ≺), onde L é um conjunto finito composto por todas as classes presentes na taxonomia e ≺ representa a relação é uma (is-a) assimétrica, antirreflexiva e transitiva (Silla Jr & Freitas, 2011;Wu et al, 2005). Essas propriedades são definidas a seguir:…”
Section: Fundamentos E Definições Para Classificação Hierárquicaunclassified