Regret bounds for hierarchical classification with linear-threshold functions

DOI10.1007/978-3-540-27819-1_7MaRDI QIDQ4680918zbMATH OpenOpenAlexFDO

Authors Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile

Publication date 13 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98522

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Incremental algorithms for hierarchical classification
• Learning taxonomy adaptation in large-scale classification
• Kernel-based learning of hierarchical multilabel classification models
• Large margin hierarchical classification with mutually exclusive class membership
• Data dependent risk bounds for hierarchical mixture of experts classifiers

Cited in

(4)

• Incremental algorithms for hierarchical classification
• Learning taxonomy adaptation in large-scale classification
• On Loss Functions and Regret Bounds for Multi-Category Classification
• Angle-Based Hierarchical Classification Using Exact Label Embedding

This page was built for publication: Regret bounds for hierarchical classification with linear-threshold functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680918)