CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem
This paper describes in full detail a model of a hierarchical classifier (HC). The original classification problem is broken down into several subproblems and a weak classifier is built for each of them. Subproblems consist of examples from a subset of the whole set of output classes. It is essentia...
Saved in:
| Published in | Pattern analysis and applications : PAA Vol. 14; no. 4; pp. 395 - 413 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
London
Springer-Verlag
01.11.2011
Springer |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1433-7541 1433-755X |
| DOI | 10.1007/s10044-011-0204-3 |
Cover
| Summary: | This paper describes in full detail a model of a hierarchical classifier (HC). The original classification problem is broken down into several subproblems and a weak classifier is built for each of them. Subproblems consist of examples from a subset of the whole set of output classes. It is essential for this classification framework that the generated subproblems would overlap, i.e. some individual classes could belong to more than one subproblem. This approach allows to reduce the overall risk. Individual classifiers built for the subproblems are weak, i.e. their accuracy is only a little better than the accuracy of a random classifier. The notion of weakness for a multiclass model is extended in this paper. It is more intuitive than approaches proposed so far. In the HC model described, after a single node is trained, its problem is split into several subproblems using a clustering algorithm. It is responsible for selecting classes similarly classified. The main scope of this paper is focused on finding the most appropriate clustering method. Some algorithms are defined and compared. Finally, we compare a whole HC with other machine learning approaches. |
|---|---|
| ISSN: | 1433-7541 1433-755X |
| DOI: | 10.1007/s10044-011-0204-3 |