On Equivalence Relationships Between Classification and Ranking Algorithms
We demonstrate that there are machine learning algorithms that can achieve success for two separate tasks simultaneously, namely the tasks of classification and bipartite ranking. This means that advantages gained from solving one task can be carried over to the other task, such as the ability to ob...
Main Authors: | Rudin, Cynthia, Ertekin, Seyda |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | en_US |
Published: |
MIT Press
2012
|
Online Access: | http://hdl.handle.net/1721.1/71247 https://orcid.org/0000-0001-6541-1650 |
Similar Items
-
On equivalence relationships between classification and ranking algorithms
by: Ertekin, Seyda, et al.
Published: (2012) -
Margin-based Ranking and an Equivalence between AdaBoost and RankBoost
by: Rudin, Cynthia, et al.
Published: (2010) -
Learning customized and optimized lists of rules with mathematical programming
by: Rudin, Cynthia, et al.
Published: (2021) -
Approximating the crowd
by: Ertekin, Şeyda, et al.
Published: (2016) -
Wisely Using a Budget for Crowdsourcing
by: Ertekin, Seyda, et al.
Published: (2012)