On convergence rate of a convex relaxation of semisupervised support vector machines

DOI10.7546/CRABS.2019.05.02zbMATH Open1435.68283OpenAlexW2947605833MaRDI QIDQ4972145FDOQ4972145

Authors: Fariha Umbreen, Faizan Ahmed, M. Faisal Iqbal 

Publication date: 22 November 2019

Full work available at URL: https://doi.org/10.7546/crabs.2019.05.02

Recommendations

• Conic relaxations for semi-supervised support vector machines
• A new conic approach to semisupervised support vector machines
• SDP relaxation for semi-supervised support vector machine
• A class of semi-supervised support vector machines by DC programming
• Optimization techniques for semi-supervised support vector machines

zbMATH Keywords

convergenceconvex relaxationsemi-supervised support vector machinescone programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (5)

• Conic relaxations for semi-supervised support vector machines
• A class of semi-supervised support vector machines by DC programming
• SDP relaxation for semi-supervised support vector machine
• Rates of convergence for Laplacian semi-supervised learning with low labeling rates
• A new conic approach to semisupervised support vector machines

This page was built for publication: On convergence rate of a convex relaxation of semisupervised support vector machines

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