Ranking by Multitask Learning
Explore this paper's citation graph
Summary
A new ranking method, which is proposed, that combines one-against-one decomposition and multitask feature learning, which remains efficient and can achieve low training times with the use of fast linear base learners.
- Published
- 2014-04-03
- Cited by
- 0
- References
- 50
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:118491828
References
- An Efficient Boosting Algorithm for Combining Preferences
- Statistical Comparisons of Classifiers over Multiple Data Sets
- A comparison of methods for multiclass support vector machines
- Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
- Solving Multiclass Learning Problems via Error-Correcting Output Codes
- PLS regression methods
- The differentiation of cardiomyocytes from mouse embryonic stem cells is altered by dioxin.
- An experimental comparison of cross-validation techniques for estimating the area under the ROC curve
- Efficient prediction algorithms for binary decomposition techniques
- Genome-wide expression dynamics during mouse embryonic development reveal similarities to Drosophila development.
- Regulatory networks define phenotypic classes of human stem cell lines
- The transcriptional program of meiosis and sporulation in fission yeast
- Significance analysis of microarray transcript levels in time series experiments
- Training linear SVMs in linear time
- Gene function in early mouse embryonic stem cell differentiation
- Support vector learning for ordinal regression
- Convex multi-task feature learning
- Probability Estimates for Multi-class Classification by Pairwise Coupling
- Learning from Imbalanced Data
- Task Clustering and Gating for Bayesian Multitask Learning
Cited by
No citing papers recorded for this paper.
Related papers
No related papers recorded.