Learning to Rank for Information Retrieval
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Recommendations
Cited in
(44)- Tolerant information retrieval with backpropagation networks
- Utilizing sources of evidence in relevance feedback through geometry
- Dyad ranking using Plackett-Luce models based on joint feature representations
- Learning to rank in PRISM
- Exploiting explicit and implicit feedback for personalized ranking
- A review on instance ranking problems in statistical learning
- Generalized vec trick for fast learning of pairwise kernel models
- Optimal full ranking from pairwise comparisons
- 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
- 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
- Semi-parametric order-based generalized multivariate regression
- \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices
- Row and column generation algorithm for maximization of minimum margin for ranking problems
- Learning linear ranking functions for beam search with application to planning
- Learning bilinear model for matching queries and documents
- QoRank: A query-dependent ranking model using LSE-based weighted multiple hyperplanes aggregation for information retrieval
- Learning multiple metrics for ranking
- Multiple ranker method in document retrieval
- scientific article; zbMATH DE number 1934560 (Why is no real title available?)
- Active learning with multiple localized regression models
- Research advances and prospects of learning to rank
- Online learning to rank with top-k feedback
- Forward stagewise additive modeling for entity ranking in documents
- Probabilistic generative ranking method based on multi-support vector domain description
- Factorization machines with regularization for sparse feature interactions
- U-Processes and Preference Learning
- scientific article; zbMATH DE number 6253913 (Why is no real title available?)
- Large Scale Ranking Using Stochastic Gradient Descent
- Learning to rank in vector spaces and social networks
- Listwise approaches based on feature ranking discovery
- \textsc{PeerNomination}: a novel peer selection algorithm to handle strategic and noisy assessments
- How to build high quality L2R training data: unsupervised compression-based selective sampling for learning to rank
- Subgraph nomination: query by example subgraph retrieval in networks
- A feature-centric view of information retrieval.
- Graph neural networks-based preference learning method for object ranking
- Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies. II
- A machine learning approach to rank pricing problems in branch-and-price
- Limited memory bundle DC algorithm for sparse pairwise kernel learning
- Optimal large-scale stochastic optimization of NDCG surrogates for deep learning
- DEARank: a data-envelopment-analysis-based ranking method
- Learning to rank: a ROC-based graph-theoretic approach
This page was built for publication: Learning to Rank for Information Retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577032)
