Cargando…
Cautious Label-Wise Ranking with Constraint Satisfaction
Ranking problems are difficult to solve due to their combinatorial nature. One way to solve this issue is to adopt a decomposition scheme, splitting the initial difficult problem in many simpler problems. The predictions obtained from these simplified settings must then be combined into one single o...
Autores principales: | Carranza-Alarcon, Yonatan-Carlos, Messoudi, Soundouss, Destercke, Sébastien |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7274705/ http://dx.doi.org/10.1007/978-3-030-50143-3_8 |
Ejemplares similares
-
Deep Conformal Prediction for Robust Models
por: Messoudi, Soundouss, et al.
Publicado: (2020) -
Handling Mixture Optimisation Problem Using Cautious Predictions and Belief Functions
por: Jacquin, Lucie, et al.
Publicado: (2020) -
Cautious apoptosis
por: Wells, William A.
Publicado: (2003) -
List-wise learning to rank biomedical question-answer pairs with deep ranking recursive autoencoders
por: Yan, Yan, et al.
Publicado: (2020) -
Blue cures blue but be cautious
por: Sikka, Pranav, et al.
Publicado: (2011)