scientific article
From MaRDI portal
Publication:3174170
zbMath1222.68171arXivmath/0611133MaRDI QIDQ3174170
Stéphan Clémençon, Nicolas Vayatis
Publication date: 12 October 2011
Full work available at URL: https://arxiv.org/abs/math/0611133
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (19)
A review on instance ranking problems in statistical learning ⋮ Applications of concentration inequalities for statistical scoring and ranking problems ⋮ Overlaying classifiers: A practical approach to optimal scoring ⋮ A statistical view of clustering performance through the theory of \(U\)-processes ⋮ Learning layered ranking functions with structured support vector machines ⋮ Optimality of regularized least squares ranking with imperfect kernels ⋮ Exploiting the relationships among several binary classifiers via data transformation ⋮ The fraud loss for selecting the model complexity in fraud detection ⋮ Quantitative robustness of instance ranking problems ⋮ Bias corrected regularization kernel method in ranking ⋮ On the ERA ranking representability of pairwise bipartite ranking functions ⋮ Preference-based learning to rank ⋮ An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods ⋮ Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity ⋮ Concentration inequalities for two-sample rank processes with application to bipartite ranking ⋮ The risk of trivial solutions in bipartite top ranking ⋮ Calibration and regret bounds for order-preserving surrogate losses in learning to rank ⋮ On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization ⋮ Elicitability of Instance and Object Ranking
This page was built for publication:
