All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A self adaptive harmony search based functional link higher order ANN for non-linear data classification

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86099061" target="_blank" >RIV/61989100:27240/16:86099061 - isvavai.cz</a>

  • Result on the web

    <a href="http://ac.els-cdn.com/S0925231215018494/1-s2.0-S0925231215018494-main.pdf?_tid=a97b19de-0a8b-11e7-90dc-00000aacb360&acdnat=1489698241_39d83b622e036bde3e20d6d631daafb8" target="_blank" >http://ac.els-cdn.com/S0925231215018494/1-s2.0-S0925231215018494-main.pdf?_tid=a97b19de-0a8b-11e7-90dc-00000aacb360&acdnat=1489698241_39d83b622e036bde3e20d6d631daafb8</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.neucom.2015.11.051" target="_blank" >10.1016/j.neucom.2015.11.051</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A self adaptive harmony search based functional link higher order ANN for non-linear data classification

  • Original language description

    In the data classification process involving higher order ANNs, it's a herculean task to determine the optimal ANN classification model due to non-linear nature of real world datasets. To add to the woe, it is tedious to adjust the set of weights of ANNs by using appropriate learning algorithm to obtain better classification accuracy. In this paper, an improved variant of harmony search (HS), called self-adaptive harmony search (SAHS) along with gradient descent learning is used with functional link artificial neural network (FLANN) for the task of classification in data mining. Using its past experiences, SAHS adjusts the harmonies according to the maximum and minimum values in the current harmony memory. The powerful combination of this unique strategy of SAHS and searching capabilities of gradient descent search is used to obtain optimal set of weights for FLANN. The proposed method (SAHS-FLANN) is implemented in MATLAB and the results are contrasted with other alternatives (FLANN, GA based FLANN, PSO based FLANN, HS based FLANN, improved HS based FLANN and TLBO based FLANN). To illustrate its effectiveness, SAHS-FLANN is tested on various benchmark datasets from UCI machine learning repository by using 5-fold cross validation technique. Under the null-hypothesis, the proposed method is analyzed by using various statistical tests for statistical correctness of results. The performance of the SAHS-FLANN is found to be better and statistically significant in comparison with other alternatives. The SAHS-FLANN differs from HS-FLANN (HS based FLANN) by the elimination of constant parameters (bandwidth and pitch adjustment rate). Furthermore, it leads to the simplification of steps for the improvisation of weight-sets in IHS-FLANN (improved HS based FLANN) by incorporating adjustments of new weight-sets according to the weight-sets with maximum and minimum fitness. (C) 2015 Elsevier B.V.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2016

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Neurocomputing

  • ISSN

    0925-2312

  • e-ISSN

  • Volume of the periodical

    179

  • Issue of the periodical within the volume

    February

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    19

  • Pages from-to

    69-87

  • UT code for WoS article

    000370090300006

  • EID of the result in the Scopus database

    2-s2.0-84955629389