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

Verification of Classification Model and Dendritic Neuron Model Based on Machine Learning

Author

Listed:
  • Dongbao Jia
  • Weixiang Xu
  • Dengzhi Liu
  • Zhongxun Xu
  • Zhaoman Zhong
  • Xinxin Ban
  • Shi Cheng

Abstract

Artificial neural networks have achieved a great success in simulating the information processing mechanism and process of neuron supervised learning, such as classification. However, traditional artificial neurons still have many problems such as slow and difficult training. This paper proposes a new dendrite neuron model (DNM), which combines metaheuristic algorithm and dendrite neuron model effectively. Eight learning algorithms including traditional backpropagation, classic evolutionary algorithms such as biogeography-based optimization, particle swarm optimization, genetic algorithm, population-based incremental learning, competitive swarm optimization, differential evolution, and state-of-the-art jSO algorithm are used for training of dendritic neuron model. The optimal combination of user-defined parameters of model has been systemically investigated, and four different datasets involving classification problem are investigated using proposed DNM. Compared with common machine learning methods such as decision tree, support vector machine, k-nearest neighbor, and artificial neural networks, dendritic neuron model trained by biogeography-based optimization has significant advantages. It has the characteristics of simple structure and low cost and can be used as a neuron model to solve practical problems with a high precision.

Suggested Citation

  • Dongbao Jia & Weixiang Xu & Dengzhi Liu & Zhongxun Xu & Zhaoman Zhong & Xinxin Ban & Shi Cheng, 2022. "Verification of Classification Model and Dendritic Neuron Model Based on Machine Learning," Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-14, July.
  • Handle: RePEc:hin:jnddns:3259222
    DOI: 10.1155/2022/3259222
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2022/3259222.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/ddns/2022/3259222.xml
    Download Restriction: no

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