Extracting hierarchies from data clusters for better classification (Q1736527)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7042138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extracting hierarchies from data clusters for better classification |
scientific article; zbMATH DE number 7042138 |
Statements
Extracting hierarchies from data clusters for better classification (English)
0 references
26 March 2019
0 references
Summary: In this paper we present the PHOCS-2 algorithm, which extracts a ``Predicted Hierarchy Of ClassifierS''. The extracted hierarchy helps us to enhance performance of flat classification. Nodes in the hierarchy contain classifiers. Each intermediate node corresponds to a set of classes and each leaf node corresponds to a single class. In the PHOCS-2 we make estimation for each node and achieve more precise computation of false positives, true positives and false negatives. Stopping criteria are based on the results of the flat classification. The proposed algorithm is validated against nine datasets.
0 references
multi-label classification
0 references
hierarchical classification
0 references
clustering
0 references
0 references
0.8705119
0 references
0.8598306
0 references
0 references
