Analysis of k-partite ranking algorithm in area under the receiver operating characteristic curve criterion
From MaRDI portal
Publication:5028602
DOI10.1080/00207160.2017.1322688zbMath1499.68157OpenAlexW2608799779MaRDI QIDQ5028602
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
Computational learning theory (68Q32) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometry on probability spaces
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Semantic granularity in ontology-driven geographic information systems
- The covering number in learning theory
- Learning to rank on graphs
- Stability analysis of learning algorithms for ontology similarity computation
- The asymptotics of ranking algorithms
- On the mathematical foundations of learning
- Learning Theory
- Capacity of reproducing kernel spaces in learning theory
- 10.1162/1532443041827916
- Convergence of spectral clustering with a general similarity function
- Learning Theory