Next Article in Journal
Alpha-Beta Pruning and Althöfer’s Pathology-Free Negamax Algorithm
Previous Article in Journal / Special Issue
The Effects of Tabular-Based Content Extraction on Patent Document Clustering
Article Menu

Export Article

Open AccessArticle

Extracting Hierarchies from Data Clusters for Better Classification

Saint Petersburg State Polytechnical University, Polytechnicheskaya 29, Saint Petersburg 194064, Russia
HP Labs Russia, Artilleriyskaya 1, Saint Petersburg 191014, Russia
Authors to whom correspondence should be addressed.
Algorithms 2012, 5(4), 506-520;
Received: 2 July 2012 / Revised: 24 September 2012 / Accepted: 17 October 2012 / Published: 23 October 2012
PDF [1199 KB, uploaded 23 October 2012]


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. View Full-Text
Keywords: multi-label classification; hierarchical classification; clustering multi-label classification; hierarchical classification; clustering

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Sapozhnikov, G.; Ulanov, A. Extracting Hierarchies from Data Clusters for Better Classification. Algorithms 2012, 5, 506-520.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top