IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v42y2025i04ns0217595924500313.html
   My bibliography  Save this article

A CVaR-Based Programming for Support Vector Machine with Uncertain Information

Author

Listed:
  • Jiakang Du

    (School of Management Science, Qufu Normal University, Rizhao Shandong 276800, P. R. China)

  • Yiju Wang

    (School of Management Science, Qufu Normal University, Rizhao Shandong 276800, P. R. China)

  • Yuanhai Shao

    (School of Mathematics and Statistics, Hainan University, Haikou, Hainan 570228, P. R. China)

Abstract

For the parallel support vector machine problem with uncertain information on the observation, by characterizing the violation of the positive class training data to the “upper†support hyperplane and that of the negative class training data to the “lower†support hyperplane via the conditional value-at-risk (CVaR), we establish a CVaR-based optimization model. For the model, we first show that it is a good convex approximation to the basic chance-constrained optimization model for the problem, then with the help of Lagrange duality theory, we transform it into a deterministic semi-definite programming (SDP) which can be numerically solved by the state-of-the-art SDP solvers. Numerical experiments conducted on the artificial and the real benchmark datasets show the validity and the efficiency of the proposed model.

Suggested Citation

  • Jiakang Du & Yiju Wang & Yuanhai Shao, 2025. "A CVaR-Based Programming for Support Vector Machine with Uncertain Information," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 42(04), pages 1-23, August.
    • Handle: RePEc:wsi:apjorx:v:42:y:2025:i:04:n:s0217595924500313
    DOI: 10.1142/S0217595924500313
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595924500313
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595924500313?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:42:y:2025:i:04:n:s0217595924500313. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.