The following pages link to (Q3174170):
Displaying 20 items.
- A statistical view of clustering performance through the theory of \(U\)-processes (Q392047) (← links)
- Overlaying classifiers: A practical approach to optimal scoring (Q607486) (← links)
- On the ERA ranking representability of pairwise bipartite ranking functions (Q646530) (← links)
- The risk of trivial solutions in bipartite top ranking (Q669314) (← links)
- Exploiting the relationships among several binary classifiers via data transformation (Q898390) (← links)
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity (Q1722329) (← links)
- Learning layered ranking functions with structured support vector machines (Q1932121) (← links)
- Preference-based learning to rank (Q1959596) (← links)
- A review on instance ranking problems in statistical learning (Q2127240) (← links)
- Concentration inequalities for two-sample rank processes with application to bipartite ranking (Q2233587) (← links)
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank (Q2251435) (← links)
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization (Q2256621) (← links)
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods (Q2444590) (← links)
- Applications of concentration inequalities for statistical scoring and ranking problems (Q3451708) (← links)
- Bias corrected regularization kernel method in ranking (Q4615656) (← links)
- Elicitability of Instance and Object Ranking (Q5868898) (← links)
- Optimality of regularized least squares ranking with imperfect kernels (Q6125450) (← links)
- Quantitative robustness of instance ranking problems (Q6175812) (← links)
- Analysis of regularized least squares ranking with centered reproducing kernel (Q6591691) (← links)
- Statistical computational learning (Q6602226) (← links)
