Cost-sensitive learning to rank

6Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

We formulate the Cost-Sensitive Learning to Rank problem of learning to prioritize limited resources to mitigate the most costly outcomes. We develop improved ranking models to solve this problem, as verified by experiments in diverse domains such as forest fire prevention, crime prevention, and preventing storm caused outages in electrical networks.

Cite

CITATION STYLE

APA

McBride, R., Wang, K., Ren, Z., & Li, W. (2019). Cost-sensitive learning to rank. In 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019 (pp. 4570–4577). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33014570

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free