Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons

This study proposes a concept of representation learning by implementing multi-strategy deep learning harmony memory improvisation for selecting the best harmony of self-organizing neurons. Representation learning is a set of methods that allows a machine to be fed with raw data and to automatically...

Full description

Saved in:
Bibliographic Details
Main Authors: Hasan, Shafaatunnur, Shamsuddin, Siti Mariyam
Format: Article
Published: Springer Verlag 2019
Subjects:
Online Access:http://eprints.utm.my/id/eprint/87542/
http://dx.doi.org/10.1007/s00500-018-3116-y
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
id my.utm.87542
record_format eprints
spelling my.utm.875422020-11-08T04:06:11Z http://eprints.utm.my/id/eprint/87542/ Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons Hasan, Shafaatunnur Shamsuddin, Siti Mariyam QA75 Electronic computers. Computer science This study proposes a concept of representation learning by implementing multi-strategy deep learning harmony memory improvisation for selecting the best harmony of self-organizing neurons. Representation learning is a set of methods that allows a machine to be fed with raw data and to automatically discover the representations needed for detection or classification. In our study, the deep multi-strategy learning involves the convolution of the self-organizing neurons with deep harmony memories improvisation in self-organizing and representation of map learning. The convolution of self-organizing neurons and harmony memory optimize the representation neurons’ weights by generating the optimal best matching unit which is represented as fitness function of f1(x) and f2(x). While f1[g(f1′′(x))] and f2[g(f2′(x))] represent the New Harmony fitness function. The best fitness function, fbest(x) is selected based on the f1(x) and f2(x) performance which will be later stored in the harmony memory vector. The position vector of a particle is subjected to the Newtonian mechanics constant acceleration during the interval Δ t. The search space of self-organizing map with Newton-based particle swarm algorithm particles depends on the width area, σα(t) of organizing neurons lattice structure. Our proposed methods are experimented on various biomedical datasets. The findings indicate that the proposed methods provide better quantization error for clustering and good classification accuracy with statistical measurement validations. Springer Verlag 2019-01-24 Article PeerReviewed Hasan, Shafaatunnur and Shamsuddin, Siti Mariyam (2019) Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons. Soft Computing, 23 (1). pp. 285-303. ISSN 1432-7643 http://dx.doi.org/10.1007/s00500-018-3116-y DOI:10.1007/s00500-018-3116-y
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Hasan, Shafaatunnur
Shamsuddin, Siti Mariyam
Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons
description This study proposes a concept of representation learning by implementing multi-strategy deep learning harmony memory improvisation for selecting the best harmony of self-organizing neurons. Representation learning is a set of methods that allows a machine to be fed with raw data and to automatically discover the representations needed for detection or classification. In our study, the deep multi-strategy learning involves the convolution of the self-organizing neurons with deep harmony memories improvisation in self-organizing and representation of map learning. The convolution of self-organizing neurons and harmony memory optimize the representation neurons’ weights by generating the optimal best matching unit which is represented as fitness function of f1(x) and f2(x). While f1[g(f1′′(x))] and f2[g(f2′(x))] represent the New Harmony fitness function. The best fitness function, fbest(x) is selected based on the f1(x) and f2(x) performance which will be later stored in the harmony memory vector. The position vector of a particle is subjected to the Newtonian mechanics constant acceleration during the interval Δ t. The search space of self-organizing map with Newton-based particle swarm algorithm particles depends on the width area, σα(t) of organizing neurons lattice structure. Our proposed methods are experimented on various biomedical datasets. The findings indicate that the proposed methods provide better quantization error for clustering and good classification accuracy with statistical measurement validations.
format Article
author Hasan, Shafaatunnur
Shamsuddin, Siti Mariyam
author_facet Hasan, Shafaatunnur
Shamsuddin, Siti Mariyam
author_sort Hasan, Shafaatunnur
title Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons
title_short Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons
title_full Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons
title_fullStr Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons
title_full_unstemmed Multi-strategy learning and deep harmony memory improvisation for self-organizing neurons
title_sort multi-strategy learning and deep harmony memory improvisation for self-organizing neurons
publisher Springer Verlag
publishDate 2019
url http://eprints.utm.my/id/eprint/87542/
http://dx.doi.org/10.1007/s00500-018-3116-y
_version_ 1683230781227401216