The University of Southampton
University of Southampton Institutional Repository

Kernel-Based Learning of Hierarchical Multilabel Classification Models

Kernel-Based Learning of Hierarchical Multilabel Classification Models
Kernel-Based Learning of Hierarchical Multilabel Classification Models
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is a variant of the Maximum Margin Markov Network framework, where the classification hierarchy is represented as a Markov tree equipped with an exponential family defined on the edges. We present an efficient optimization algorithm based on incremental conditional gradient ascent in single-example subspaces spanned by the marginal dual variables. The optimization is facilitated with a dynamic programming based algorithm that computes best update directions in the feasible set. Experiments show that the algorithm can feasibly optimize training sets of thousands of examples and classification hierarchies consisting of hundreds of nodes. Training of the full hierarchical model is as efficient as training independent SVM-light classifiers for each node. The algorithm's predictive accuracy was found to be competitive with other recently introduced hierarchical multi-category or multilabel classification learning algorithms.
kernel methods, text classification
1601-1626
Rousu, J.
4ef21914-6600-483b-9995-ff0283dad7b3
Saunders, C.
38a38da8-1eb3-47a8-80bc-b9cbb43f26e3
Szedmak, S.
993ca93f-c7c7-4d0b-a5f7-374eb0401add
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db
Rousu, J.
4ef21914-6600-483b-9995-ff0283dad7b3
Saunders, C.
38a38da8-1eb3-47a8-80bc-b9cbb43f26e3
Szedmak, S.
993ca93f-c7c7-4d0b-a5f7-374eb0401add
Shawe-Taylor, J.
c32d0ee4-b422-491f-8c28-78663851d6db

Rousu, J., Saunders, C., Szedmak, S. and Shawe-Taylor, J. (2006) Kernel-Based Learning of Hierarchical Multilabel Classification Models. Journal of Machine Learning Research, 7, 1601-1626.

Record type: Article

Abstract

We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is a variant of the Maximum Margin Markov Network framework, where the classification hierarchy is represented as a Markov tree equipped with an exponential family defined on the edges. We present an efficient optimization algorithm based on incremental conditional gradient ascent in single-example subspaces spanned by the marginal dual variables. The optimization is facilitated with a dynamic programming based algorithm that computes best update directions in the feasible set. Experiments show that the algorithm can feasibly optimize training sets of thousands of examples and classification hierarchies consisting of hundreds of nodes. Training of the full hierarchical model is as efficient as training independent SVM-light classifiers for each node. The algorithm's predictive accuracy was found to be competitive with other recently introduced hierarchical multi-category or multilabel classification learning algorithms.

Text
rousu06a.pdf - Other
Download (193kB)

More information

Published date: July 2006
Keywords: kernel methods, text classification
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 262947
URI: http://eprints.soton.ac.uk/id/eprint/262947
PURE UUID: 6c0445c5-ffec-4fdd-b509-c50ec6116cdd

Catalogue record

Date deposited: 07 Sep 2006
Last modified: 14 Mar 2024 07:22

Export record

Contributors

Author: J. Rousu
Author: C. Saunders
Author: S. Szedmak
Author: J. Shawe-Taylor

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.

×