Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

Artificial Neural Networks Hidden Unit and Weight Connection Optimization by Quasi-Refection-Based Learning Artificial Bee Colony Algorithm

Identifikátory výsledku

  • Kód výsledku v IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F21%3A50019006" target="_blank" >RIV/62690094:18470/21:50019006 - isvavai.cz</a>

  • Výsledek na webu

    <a href="https://ieeexplore.ieee.org/document/9648205" target="_blank" >https://ieeexplore.ieee.org/document/9648205</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ACCESS.2021.3135201" target="_blank" >10.1109/ACCESS.2021.3135201</a>

Alternativní jazyky

  • Jazyk výsledku

    angličtina

  • Název v původním jazyce

    Artificial Neural Networks Hidden Unit and Weight Connection Optimization by Quasi-Refection-Based Learning Artificial Bee Colony Algorithm

  • Popis výsledku v původním jazyce

    Artificial neural networks are one of the most commonly used methods in machine learning. Performance of network highly depends on the learning method. Traditional learning algorithms are prone to be trapped in local optima and have slow convergence. At the other hand, nature-inspired optimization algorithms are proven to be very efficient in complex optimization problems solving due to derivative-free solutions. Addressing issues of traditional learning algorithms, in this study, an enhanced version of artificial bee colony nature-inspired metaheuristics is proposed to optimize connection weights and hidden units of artificial neural networks. Proposed improved method incorporates quasi-reflection-based learning and guided best solution bounded mechanisms in the original approach and manages to conquer its deficiencies. First, the method is tested on a recent challenging CEC 2017 benchmark function set, then applied for training artificial neural network on five well-known medical benchmark datasets. Further, devised algorithm is compared to other metaheuristics-based methods. The efficiency is measured by five metrics-accuracy, specificity, sensitivity, geometric mean, and area under the curve. Simulation results prove that the proposed algorithm outperforms other metaheuristics in terms of accuracy and convergence speed. The improvement of the accuracy over the other methods on different datasets are between 0.03% and 12.94%. The quasi-refection-based learning mechanism significantly improves the convergence speed of the original artificial bee colony algorithm and together with the guided best solution bounded, the exploitation capability is enhanced, which results in significantly better accuracy.

  • Název v anglickém jazyce

    Artificial Neural Networks Hidden Unit and Weight Connection Optimization by Quasi-Refection-Based Learning Artificial Bee Colony Algorithm

  • Popis výsledku anglicky

    Artificial neural networks are one of the most commonly used methods in machine learning. Performance of network highly depends on the learning method. Traditional learning algorithms are prone to be trapped in local optima and have slow convergence. At the other hand, nature-inspired optimization algorithms are proven to be very efficient in complex optimization problems solving due to derivative-free solutions. Addressing issues of traditional learning algorithms, in this study, an enhanced version of artificial bee colony nature-inspired metaheuristics is proposed to optimize connection weights and hidden units of artificial neural networks. Proposed improved method incorporates quasi-reflection-based learning and guided best solution bounded mechanisms in the original approach and manages to conquer its deficiencies. First, the method is tested on a recent challenging CEC 2017 benchmark function set, then applied for training artificial neural network on five well-known medical benchmark datasets. Further, devised algorithm is compared to other metaheuristics-based methods. The efficiency is measured by five metrics-accuracy, specificity, sensitivity, geometric mean, and area under the curve. Simulation results prove that the proposed algorithm outperforms other metaheuristics in terms of accuracy and convergence speed. The improvement of the accuracy over the other methods on different datasets are between 0.03% and 12.94%. The quasi-refection-based learning mechanism significantly improves the convergence speed of the original artificial bee colony algorithm and together with the guided best solution bounded, the exploitation capability is enhanced, which results in significantly better accuracy.

Klasifikace

  • Druh

    J<sub>imp</sub> - Článek v periodiku v databázi Web of Science

  • CEP obor

  • OECD FORD obor

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Návaznosti výsledku

  • Projekt

  • Návaznosti

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Ostatní

  • Rok uplatnění

    2021

  • Kód důvěrnosti údajů

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Údaje specifické pro druh výsledku

  • Název periodika

    IEEE Access

  • ISSN

    2169-3536

  • e-ISSN

    2169-3536

  • Svazek periodika

    9

  • Číslo periodika v rámci svazku

    December

  • Stát vydavatele periodika

    US - Spojené státy americké

  • Počet stran výsledku

    21

  • Strana od-do

    169135-169155

  • Kód UT WoS článku

    000736731200001

  • EID výsledku v databázi Scopus

    2-s2.0-85121844511