TreeBoost.MH: A boosting algorithm for multi-label hierarchical text categorization

Andrea Esuli, Tiziano Fagni, Fabrizio Sebastiani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

In this paper we propose TREEBOOST.MH, an algorithm for multi-label Hierarchical Text Categorization (HTC) consisting of a hierarchical variant of ADABOOST.MH. TREEBOOST.MH embodies several intuitions that had arisen before within HTC: e.g. the intuitions that both feature selection and the selection of negative training examples should be performed "locally", i.e. by paying attention to the topology of the classification scheme. It also embodies the novel intuition that the weight distribution that boosting algorithms update at every boosting round should likewise be updated "locally". We present the results of experimenting TREEBOOST.MH on two HTC benchmarks, and discuss analytically its computational cost.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages13-24
Number of pages12
Volume4209 LNCS
Publication statusPublished - 2006
Externally publishedYes
Event13th International Conference on String Processing and Information Retrieval, SPIRE 2006 - Glasgow
Duration: 11 Oct 200613 Oct 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4209 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other13th International Conference on String Processing and Information Retrieval, SPIRE 2006
CityGlasgow
Period11/10/0613/10/06

Fingerprint

Intuition
Text Categorization
Boosting
Labels
Feature extraction
Benchmarking
Topology
Weight Distribution
Feature Selection
Computational Cost
Costs
Weights and Measures
Costs and Cost Analysis
Update
Benchmark

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Esuli, A., Fagni, T., & Sebastiani, F. (2006). TreeBoost.MH: A boosting algorithm for multi-label hierarchical text categorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4209 LNCS, pp. 13-24). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4209 LNCS).

TreeBoost.MH : A boosting algorithm for multi-label hierarchical text categorization. / Esuli, Andrea; Fagni, Tiziano; Sebastiani, Fabrizio.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4209 LNCS 2006. p. 13-24 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4209 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Esuli, A, Fagni, T & Sebastiani, F 2006, TreeBoost.MH: A boosting algorithm for multi-label hierarchical text categorization. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4209 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4209 LNCS, pp. 13-24, 13th International Conference on String Processing and Information Retrieval, SPIRE 2006, Glasgow, 11/10/06.
Esuli A, Fagni T, Sebastiani F. TreeBoost.MH: A boosting algorithm for multi-label hierarchical text categorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4209 LNCS. 2006. p. 13-24. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Esuli, Andrea ; Fagni, Tiziano ; Sebastiani, Fabrizio. / TreeBoost.MH : A boosting algorithm for multi-label hierarchical text categorization. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4209 LNCS 2006. pp. 13-24 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{46a5591c98294b6f9aff06a9fdf70fa4,
title = "TreeBoost.MH: A boosting algorithm for multi-label hierarchical text categorization",
abstract = "In this paper we propose TREEBOOST.MH, an algorithm for multi-label Hierarchical Text Categorization (HTC) consisting of a hierarchical variant of ADABOOST.MH. TREEBOOST.MH embodies several intuitions that had arisen before within HTC: e.g. the intuitions that both feature selection and the selection of negative training examples should be performed {"}locally{"}, i.e. by paying attention to the topology of the classification scheme. It also embodies the novel intuition that the weight distribution that boosting algorithms update at every boosting round should likewise be updated {"}locally{"}. We present the results of experimenting TREEBOOST.MH on two HTC benchmarks, and discuss analytically its computational cost.",
author = "Andrea Esuli and Tiziano Fagni and Fabrizio Sebastiani",
year = "2006",
language = "English",
isbn = "3540457747",
volume = "4209 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "13--24",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - TreeBoost.MH

T2 - A boosting algorithm for multi-label hierarchical text categorization

AU - Esuli, Andrea

AU - Fagni, Tiziano

AU - Sebastiani, Fabrizio

PY - 2006

Y1 - 2006

N2 - In this paper we propose TREEBOOST.MH, an algorithm for multi-label Hierarchical Text Categorization (HTC) consisting of a hierarchical variant of ADABOOST.MH. TREEBOOST.MH embodies several intuitions that had arisen before within HTC: e.g. the intuitions that both feature selection and the selection of negative training examples should be performed "locally", i.e. by paying attention to the topology of the classification scheme. It also embodies the novel intuition that the weight distribution that boosting algorithms update at every boosting round should likewise be updated "locally". We present the results of experimenting TREEBOOST.MH on two HTC benchmarks, and discuss analytically its computational cost.

AB - In this paper we propose TREEBOOST.MH, an algorithm for multi-label Hierarchical Text Categorization (HTC) consisting of a hierarchical variant of ADABOOST.MH. TREEBOOST.MH embodies several intuitions that had arisen before within HTC: e.g. the intuitions that both feature selection and the selection of negative training examples should be performed "locally", i.e. by paying attention to the topology of the classification scheme. It also embodies the novel intuition that the weight distribution that boosting algorithms update at every boosting round should likewise be updated "locally". We present the results of experimenting TREEBOOST.MH on two HTC benchmarks, and discuss analytically its computational cost.

UR - http://www.scopus.com/inward/record.url?scp=33750303526&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750303526&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33750303526

SN - 3540457747

SN - 9783540457749

VL - 4209 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 13

EP - 24

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -