Efficient prediction algorithms for binary decomposition techniques
From MaRDI portal
Publication:408680
DOI10.1007/S10618-011-0219-9zbMATH Open1235.68180OpenAlexW2008763786WikidataQ59195223 ScholiaQ59195223MaRDI QIDQ408680FDOQ408680
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
Recommendations
- Binary prediction
- scientific article
- A nearly optimal algorithm to decompose binary forms
- Predicting the integer decomposition property via machine learning
- Structural, Syntactic, and Statistical Pattern Recognition
- Best subset binary prediction
- Efficient algorithms for combinatorial online prediction
- Greedy algorithms for prediction
- A superfast randomized algorithm to decompose binary forms
- Algorithm for the \(E\)-prediction
aggregationmulticlass classificationbinary decompositionefficient decodingefficient votingpairwise classificationternary ECOC
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compressed sensing
- On a class of error correcting binary group codes
- Reducing multiclass to binary: A unifying approach for margin classifiers
- Title not available (Why is that?)
- Title not available (Why is that?)
- 10.1162/153244302320884605
- On the learnability and design of output codes for multiclass problems
- Label ranking by learning pairwise preferences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning valued preference structures for solving classification problems
- Tackling ordinal regression problem for heterogeneous data: sparse and deep multi-task learning approaches
- Preference-based reinforcement learning: a formal framework and a policy iteration algorithm
- Label ranking by learning pairwise preferences
- Efficient implementation of class-based decomposition schemes for naïve Bayes
Uses Software
This page was built for publication: Efficient prediction algorithms for binary decomposition techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408680)
