Learning to Rank for Information Retrieval
From MaRDI portal
Publication:3577032
DOI10.1007/978-3-642-14267-3zbMath1227.68002OpenAlexW4302313152MaRDI QIDQ3577032
Publication date: 3 August 2010
Full work available at URL: https://doi.org/10.1007/978-3-642-14267-3
Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20)
Related Items (22)
A review on instance ranking problems in statistical learning ⋮ Generalized vec trick for fast learning of pairwise kernel models ⋮ Utilizing sources of evidence in relevance feedback through geometry ⋮ Dyad ranking using Plackett-Luce models based on joint feature representations ⋮ Optimal full ranking from pairwise comparisons ⋮ Semi-parametric order-based generalized multivariate regression ⋮ DEARank: a data-envelopment-analysis-based ranking method ⋮ \textsc{PeerNomination}: a novel peer selection algorithm to handle strategic and noisy assessments ⋮ Active Learning with Multiple Localized Regression Models ⋮ Subgraph nomination: query by example subgraph retrieval in networks ⋮ \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices ⋮ U-Processes and Preference Learning ⋮ Learning to rank in PRISM ⋮ How can lenders prosper? Comparing machine learning approaches to identify profitable peer-to-peer loan investments ⋮ Editorial: Preference learning and ranking ⋮ Robust ordinal regression in preference learning and ranking ⋮ Exploiting explicit and implicit feedback for personalized ranking ⋮ Row and Column Generation Algorithm for Maximization of Minimum Margin for Ranking Problems ⋮ Generalized transitivity: a systematic comparison of concepts with an application to preferences in the Babington Smith model ⋮ Adjacency-based regularization for partially ranked data with non-ignorable missing ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
This page was built for publication: Learning to Rank for Information Retrieval
