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

Optimization of the Economic and Trade Management Legal Model Based on the Support Vector Machine Algorithm and Logistic Regression Algorithm

Author

Listed:
  • Zhihai Nie
  • Xue Bai
  • Lihai Nie
  • Jin Wu
  • Wen-Tsao Pan

Abstract

Nowadays, various algorithms are widely used in the field of economy and trade, and economic and trade management laws also need to introduce scientific and effective data models for optimization. In this paper, support vector machine algorithm and logistic regression algorithm are used to analyze and process the actual economic and trade case data and bank loan user data, and a hybrid model of support vector machine and logistic regression is established. This study first introduces the basic definitions and contents of the support vector machine algorithm and logistic regression algorithm, and then constructs a hybrid model by randomly dividing the data, first using the support vector machine algorithm to calculate the results, and then inputting them into the logistic regression algorithm. The first mock exam is that the efficiency of the hybrid model is much higher than that of the single model. This study mainly optimizes and upgrades the legal system of economic and trade management from two aspects. In the prediction of economic and trade legal cases, the hybrid model is significantly better than FastText and LSTM models in accuracy and macro recall performance. In terms of credit risk prediction of economic and trade loan users, the subset most likely to default in the loan customer set is obtained.

Suggested Citation

  • Zhihai Nie & Xue Bai & Lihai Nie & Jin Wu & Wen-Tsao Pan, 2022. "Optimization of the Economic and Trade Management Legal Model Based on the Support Vector Machine Algorithm and Logistic Regression Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-9, June.
  • Handle: RePEc:hin:jnlmpe:4364295
    DOI: 10.1155/2022/4364295
    as

    Download full text from publisher

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

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

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