Parametric Non-Parallel Support Vector Machines for Pattern Classification
Abstract
This paper proposes Parametric non-parallel support vector machines for binary pattern classification. Through an intelligent redesigning of the Support vector machine optimisation, not only do we bring noise resilience into the model, but also retain its sparsity. Our model exhibits properties similar to Support vector machines, hence many SVM related learning algorithms can be extended to make it scalable for large scale problems. Experimental results on several benchmark UCI datasets validate our claims.
Cite
Text
Jain and Rastogi. "Parametric Non-Parallel Support Vector Machines for Pattern Classification." Machine Learning, 2024. doi:10.1007/S10994-022-06238-0Markdown
[Jain and Rastogi. "Parametric Non-Parallel Support Vector Machines for Pattern Classification." Machine Learning, 2024.](https://mlanthology.org/mlj/2024/jain2024mlj-parametric/) doi:10.1007/S10994-022-06238-0BibTeX
@article{jain2024mlj-parametric,
title = {{Parametric Non-Parallel Support Vector Machines for Pattern Classification}},
author = {Jain, Sambhav and Rastogi, Reshma},
journal = {Machine Learning},
year = {2024},
pages = {1567-1594},
doi = {10.1007/S10994-022-06238-0},
volume = {113},
url = {https://mlanthology.org/mlj/2024/jain2024mlj-parametric/}
}