General framework for binary classification on top samples

DOI10.1080/10556788.2021.1965601MaRDI QIDQ5058388zbMATH OpenOpenAlexFDO

Authors Lukáš Adam, Václav Mácha, Václav Smídl, Tomáš Pevný

Publication date 20 December 2022

Published in Optimization Methods \& Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2002.10923

zbMATH Keywords

accuracy at the topclassificationgeneral frameworkNeyman-PearsonPat\&Matranking

Mathematics Subject Classification ID

Optimality conditions for free problems in two or more independent variables (49K10) Numerical methods based on necessary conditions (49M05) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)

Recommendations

• A general approach to classification problems
• scientific article; zbMATH DE number 3942809
• On the optimal binary classifier with an application
• Classification model based on topological approximation space
• Generic subset ranking using binary classifiers
• Approximations for binary Gaussian process classification
• Generalised indirect classifiers
• scientific article; zbMATH DE number 4123085

Cites work

• 10.1162/1532443041827916
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Minimizing finite sums with the stochastic average gradient
• Statistical comparisons of classifiers over multiple data sets
• The p-norm push: a simple convex ranking algorithm that concentrates at the top of the list

Cited in

(2)

• Binarised regression tasks: methods and evaluation metrics
• The risk of trivial solutions in bipartite top ranking

Describes a project that uses

Uses Software

• Adam

This page was built for publication: General framework for binary classification on top samples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058388)