Efficient prediction algorithms for binary decomposition techniques

DOI10.1007/S10618-011-0219-9zbMath1235.68180OpenAlexW2008763786WikidataQ59195223 ScholiaQ59195223MaRDI QIDQ408680

Sang-Hyeun Park, Johannes Fürnkranz

Publication date: 11 April 2012

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-011-0219-9

zbMATH Keywords

aggregationmulticlass classificationbinary decompositionefficient decodingefficient votingpairwise classificationternary ECOC

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Label ranking by learning pairwise preferences ⋮ Preference-based reinforcement learning: a formal framework and a policy iteration algorithm ⋮ Efficient implementation of class-based decomposition schemes for naïve Bayes ⋮ Tackling ordinal regression problem for heterogeneous data: sparse and deep multi-task learning approaches

Uses Software

• UCI-ml
• RCV1

Cites Work

• Label ranking by learning pairwise preferences
• 10.1162/15324430152733133
• On a class of error correcting binary group codes
• 10.1162/153244302320884605
• Compressed sensing
• On the learnability and design of output codes for multiclass problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient prediction algorithms for binary decomposition techniques