Twin minimax probability machine for pattern classification
DOI10.1016/j.neunet.2020.07.030zbMath1480.62135OpenAlexW3046870250WikidataQ98498887 ScholiaQ98498887MaRDI QIDQ2057726
Yakun Wen, Min Zhang, Xue Wang, Liming Yang
Publication date: 7 December 2021
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2020.07.030
fractional programmingconcave maximization problemminimax probability machinetwin support vector machinenonparallel separation hyperplane
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Minimax procedures in statistical decision theory (62C20) Fractional programming (90C32)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Robust fractional programming
- Robust duality for fractional programming problems with constraint-wise data uncertainty
- Generalized convexity and optimization. Theory and applications
- High-probability minimax probability machines
- A robust outlier control framework for classification designed with family of homotopy loss function
- A robust classification framework with mixture correntropy
- General twin support vector machine with pinball loss function
- Strong duality for robust minimax fractional programming problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- 10.1162/153244303321897726
- Multivariate Chebyshev Inequalities
- Fractional programming
This page was built for publication: Twin minimax probability machine for pattern classification