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

Internet Financial Risk Monitoring and Evaluation Based on GABP Algorithm

Author

Listed:
  • Yaqin Guang
  • Shunyong Li
  • Quanping Li
  • Miaochao Chen

Abstract

Due to the generality and particularity of Internet financial risks, it is imperative for the institutions involved to establish a sound risk prevention, control, monitoring, and management system and timely identify and alert potential risks. Firstly, the importance of Internet financial risk monitoring and evaluation is expounded. Secondly, the basic principles of backpropagation (BP) neural network, genetic algorithm (GA), and GABP algorithms are discussed. Thirdly, the weight and threshold of the BP algorithm are optimized by using the GA, and the GABP model is established. The financial risks are monitored and evaluated by the Internet financial system as the research object. Finally, GABP is further optimized by the simulated annealing (SA) algorithm. The results show that, compared with the calculation results of the BP model, the GABP algorithm can reduce the number of BP training, has high prediction accuracy, and realizes the complementary advantages of GA and BP neural network. The GABP network optimized by simulated annealing method has better global convergence, higher learning efficiency, and prediction accuracy than the traditional BP and GABP neural network, achieves better prediction effect, effectively solves the problem that the enterprise financial risk cannot be quantitatively evaluated, more accurately assesses the size of Internet financial risk, and has certain popularization value in the application of Internet financial risk prediction.

Suggested Citation

  • Yaqin Guang & Shunyong Li & Quanping Li & Miaochao Chen, 2022. "Internet Financial Risk Monitoring and Evaluation Based on GABP Algorithm," Journal of Mathematics, Hindawi, vol. 2022, pages 1-14, February.
  • Handle: RePEc:hin:jjmath:4807428
    DOI: 10.1155/2022/4807428
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jmath/2022/4807428.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/jmath/2022/4807428.xml
    Download Restriction: no

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