IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7266719.html
   My bibliography  Save this article

Application of a New Loss Function-Based Support Vector Machine Algorithm in Quality Control of Measurement Observation Data

Author

Listed:
  • Youping Wu
  • Guoqiang Tao
  • Zaoli Yang

Abstract

The loss function of the traditional support vector machine (SVM) method consists of hinge function and regularization, which is difficult to achieve the quality control of observation data. It requires a new loss function to measure the quality of the observed data. At this stage, researchers will use data cleaning or data preprocessing to process observational data. The data preprocessing method will normalize the data features, which will make the data process the same interval and a distribution. However, this method is also difficult to guarantee the accuracy of the data. This study uses the SVM method to study the integrity, unity, and accuracy of the observation data. This study also proposes a new loss function, which can obtain the uncertainty distribution of the observed data. The loss function of traditional SVM methods is that the uncertainty distribution of the data cannot be obtained. The results show that the SVM algorithm with the new loss function has better accuracy in processing the observed data. For the maximum prediction error of the observed data, the error with the new loss function is only 2.58%, which is reduced by 0.21% compared to the SVM method with the old loss function. However, the prediction error of the SVM algorithm with the old loss function is 2.78%, and the SVM algorithm with the new loss function has obvious prediction accuracy.

Suggested Citation

  • Youping Wu & Guoqiang Tao & Zaoli Yang, 2022. "Application of a New Loss Function-Based Support Vector Machine Algorithm in Quality Control of Measurement Observation Data," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-8, June.
  • Handle: RePEc:hin:jnlmpe:7266719
    DOI: 10.1155/2022/7266719
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7266719.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7266719.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/7266719?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
    ---><---

    More about this item

    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:hin:jnlmpe:7266719. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.