Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion
From MaRDI portal
(Redirected from Publication:5028602)
Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
Recommendations
- Generalization bounds for the area under the ROC curve
- Ranking data with ordinal labels: optimality and pairwise aggregation
- Strong and weak stability of k-partite ranking algorithms
- Generalization performance of bipartite ranking algorithms with convex losses
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
Cites work
- 10.1162/1532443041827916
- Capacity of reproducing kernel spaces in learning theory
- Convergence of spectral clustering with a general similarity function
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Evaluation of ontology merging tools in bioinformatics
- Generalization bounds for ranking algorithms via algorithmic stability
- Generalization bounds for the area under the ROC curve
- Geometry on probability spaces
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 17207 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Learning Theory
- Learning Theory
- Learning to rank on graphs
- Margin-based ranking and an equivalence between AdaBoost and RankBoost
- On the mathematical foundations of learning
- Semantic granularity in ontology-driven geographic information systems
- Stability analysis of learning algorithms for ontology similarity computation
- The asymptotics of ranking algorithms
- The covering number in learning theory
Cited in
(7)- Nanomaterial treatment due to imposing MHD flow considering melting surface heat transfer
- Modeling of hybrid nanofluid behavior within a permeable media involving buoyancy effect
- Generalization bounds for the area under the ROC curve
- Strong and weak stability of k-partite ranking algorithms
- Ranking data with ordinal labels: optimality and pairwise aggregation
- A discrete dynamics approach to sparse calculation and applied in ontology science
- The treerank tournament algorithm for multipartite ranking
This page was built for publication: Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028602)
