Query-dependent ranking and its asymptotic properties
From MaRDI portal
Publication:1722064
DOI10.1214/19-EJS1531zbMath1462.62141MaRDI QIDQ1722064
Publication date: 14 February 2019
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ejs/1549962032
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics in engineering and industry; control charts (62P30) Statistical ranking and selection procedures (62F07)
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Statistical methods for ranking data
- U-processes: Rates of convergence
- Smoothing techniques. With implementation in S
- On kernel methods for covariates that are rankings
- The covering number in learning theory
- Weak convergence and empirical processes. With applications to statistics
- Learning to rank on graphs
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Ranking and empirical minimization of \(U\)-statistics
- Robust Truncated Hinge Loss Support Vector Machines
- Censored Regression: Local Linear Approximations and Their Applications
- On ψ-Learning
- 10.1162/153244303322533223
- Targeted Local Support Vector Machine for Age-Dependent Classification
- All of Nonparametric Statistics
- Convexity, Classification, and Risk Bounds
- A NEW MEASURE OF RANK CORRELATION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Query-dependent ranking and its asymptotic properties
