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