IDEAS home Printed from https://ideas.repec.org/a/igg/jkss00/v4y2013i4p32-45.html
   My bibliography  Save this article

A New Back-Propagation Neural Network Algorithm for a Big Data Environment Based on Punishing Characterized Active Learning Strategy

Author

Listed:
  • Qiuhong Zhao

    (School of Economics and Management, Beihang University, Beijing, China)

  • Feng Ye

    (School of Economics and Management, Beihang University, Beijing, China)

  • Shouyang Wang

    (Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China)

Abstract

This paper introduces the active learning strategy to the classical back-propagation neural network algorithm and proposes punishing-characterized active learning Back-Propagation (BP) Algorithm (PCAL-BP) to adapt to big data conditions. The PCAL-BP algorithm selects samples and punishments based on the absolute value of the prediction error to improve the efficiency of learning complex data. This approach involves reducing learning time and provides high precision. Numerical analysis shows that the PCAL-BP algorithm is superior to the classical BP neural network algorithm in both learning efficiency and precision. This advantage is more prominent in the case of extensive sample data. In addition, the PCAL-BP algorithm is compared with 16 types of classical classification algorithms. It performs better than 14 types of algorithms in the classification experiment used here. The experimental results also indicate that the prediction accuracy of the PCAL-BP algorithm can continue to increase with an increase in sample size.

Suggested Citation

  • Qiuhong Zhao & Feng Ye & Shouyang Wang, 2013. "A New Back-Propagation Neural Network Algorithm for a Big Data Environment Based on Punishing Characterized Active Learning Strategy," International Journal of Knowledge and Systems Science (IJKSS), IGI Global, vol. 4(4), pages 32-45, October.
    • Handle: RePEc:igg:jkss00:v:4:y:2013:i:4:p:32-45
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijkss.2013100103
    Download Restriction: no
    ---><---

    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:igg:jkss00:v:4:y:2013:i:4:p:32-45. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.