Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion
DOI10.1080/00207160.2017.1322688zbMATH Open1499.68157OpenAlexW2608799779MaRDI QIDQ5028602FDOQ5028602
Authors: Wei Gao, Weifan Wang 
Publication date: 10 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2017.1322688
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
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Computational learning theory (68Q32)
Cites Work
- Learning Theory
- On the mathematical foundations of learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Generalization bounds for ranking algorithms via algorithmic stability
- Margin-based ranking and an equivalence between AdaBoost and RankBoost
- Generalization bounds for the area under the ROC curve
- 10.1162/1532443041827916
- The covering number in learning theory
- Capacity of reproducing kernel spaces in learning theory
- Title not available (Why is that?)
- Geometry on probability spaces
- Learning Theory
- Learning to rank on graphs
- Stability analysis of learning algorithms for ontology similarity computation
- Semantic granularity in ontology-driven geographic information systems
- The asymptotics of ranking algorithms
- Convergence of spectral clustering with a general similarity function
- Evaluation of ontology merging tools in bioinformatics
Cited In (7)
- The treerank tournament algorithm for multipartite ranking
- Nanomaterial treatment due to imposing MHD flow considering melting surface heat transfer
- Modeling of hybrid nanofluid behavior within a permeable media involving buoyancy effect
- A discrete dynamics approach to sparse calculation and applied in ontology science
- 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
Uses Software
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)
