An Efficient Approach to Optimize the Learning Rate of Radial Basis Function Neural Network for Prediction of Metastatic Carcinoma

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is based on the optimization of linear weights in a radial basis function neural network that connects the hidden layer and the output layer. A new optimization algorithm called dualist algorithm is applied for choosing an optimal learning parameter. A conventional strategy of random selection of radial basis function (RBF) centers and the width, as well as the weights, are estimated by gradient descent method and least square methods, respectively. The ideology behind this study is to predict the occurrence of metastatic carcinoma in human cells by computational approaches. Our simulation consists of comparing the predictive accuracy of harmony search-radial basis function network (RBFN) and dualist-RBFN by optimizing the weight factor. The Wisconsin breast cancer dataset is used as a benchmark to experiment our training pattern. The learning rate (weight factor) is taken as the optimized parameter to obtain the best possible solution.

Cite

CITATION STYLE

APA

Vijayeeta, P., Das, M. N., & Mishra, B. S. P. (2020). An Efficient Approach to Optimize the Learning Rate of Radial Basis Function Neural Network for Prediction of Metastatic Carcinoma. In Advances in Intelligent Systems and Computing (Vol. 999, pp. 935–946). Springer. https://doi.org/10.1007/978-981-13-9042-5_80

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free