The University of Southampton
University of Southampton Institutional Repository

Class-dependent features and multicategory classification

Class-dependent features and multicategory classification
Class-dependent features and multicategory classification

The problem of pattern classification is considered for the case of multicategory classification where the number of classes, k, is greater than two. Many classification algorithms are in fast 2-class classifiers and are generalised to solve k-class problems. Which classifiers are naturally multicategory and the nature of the generalisation of a 2-class classifier to k classes is not often investigated. A thorough analysis of multicategory classification is given in this thesis which provides a new taxonomy of popular classification algorithms, and goes on to derive these from a probabilistic viewpoint. A clear distinction is made between classifiers that partition the input space and those that partition the set of k classes. Of the classifiers which partition the set of classes, the one-of-n, pairwise, and hierarchical methods of decomposition are shown to be equivalent in the knowledge of the true data distributions. The scaling properties of these algorithms are analysed for increasing k. The effects of learning models on finite data are then investigated to show the practical differences between each decomposition.

In classification problems with many classes it is commonly the case that different classes exhibit wildly different properties. In this case it is unreasonable to expect to be able to summarise these properties by using features designed to represent all the classes. In contrast, features should be designed to represent subsets of classes that exhibit common properties without regard to any class outside the subset. The value for classes outside the subset may be meaningless, or simply undefined. The multicategory classification schemes proposed explicitly deal with such class-dependent features, and attractive properties of these classifiers are demonstrated for a real-world handwritten digit recognition application.

University of Southampton
Bailey, Alex
cd2762de-6a67-4ffc-ab42-2842ca378fa8
Bailey, Alex
cd2762de-6a67-4ffc-ab42-2842ca378fa8

Bailey, Alex (2001) Class-dependent features and multicategory classification. University of Southampton, Doctoral Thesis.

Record type: Thesis (Doctoral)

Abstract

The problem of pattern classification is considered for the case of multicategory classification where the number of classes, k, is greater than two. Many classification algorithms are in fast 2-class classifiers and are generalised to solve k-class problems. Which classifiers are naturally multicategory and the nature of the generalisation of a 2-class classifier to k classes is not often investigated. A thorough analysis of multicategory classification is given in this thesis which provides a new taxonomy of popular classification algorithms, and goes on to derive these from a probabilistic viewpoint. A clear distinction is made between classifiers that partition the input space and those that partition the set of k classes. Of the classifiers which partition the set of classes, the one-of-n, pairwise, and hierarchical methods of decomposition are shown to be equivalent in the knowledge of the true data distributions. The scaling properties of these algorithms are analysed for increasing k. The effects of learning models on finite data are then investigated to show the practical differences between each decomposition.

In classification problems with many classes it is commonly the case that different classes exhibit wildly different properties. In this case it is unreasonable to expect to be able to summarise these properties by using features designed to represent all the classes. In contrast, features should be designed to represent subsets of classes that exhibit common properties without regard to any class outside the subset. The value for classes outside the subset may be meaningless, or simply undefined. The multicategory classification schemes proposed explicitly deal with such class-dependent features, and attractive properties of these classifiers are demonstrated for a real-world handwritten digit recognition application.

Text
786515.pdf - Version of Record
Available under License University of Southampton Thesis Licence.
Download (6MB)

More information

Published date: 2001

Identifiers

Local EPrints ID: 464347
URI: http://eprints.soton.ac.uk/id/eprint/464347
PURE UUID: c349a4c7-3a06-4d9c-971f-51c51a9b9cb8

Catalogue record

Date deposited: 04 Jul 2022 22:18
Last modified: 16 Mar 2024 19:26

Export record

Contributors

Author: Alex Bailey

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×