scholarly journals Momentum Backpropagation Optimization for Cancer Detection Based on DNA Microarray Data

2021 ◽  
Vol 4 (2) ◽  
pp. 127
Author(s):  
Untari Novia Wisesty ◽  
Febryanti Sthevanie ◽  
Rita Rismala
Keyword(s):  
Convergence Rate ◽  
Adaptive Learning ◽  
Dna Microarrays ◽  
Feature Selection Method ◽  
Classification Performance ◽  
Learning Rate ◽  
Training Process ◽  
Backpropagation Algorithm ◽  
Cancer Data ◽  
Dna Microarray Data

Early detection of cancer can increase the success of treatment in patients with cancer. In the latest research, cancer can be detected through DNA Microarrays. Someone who suffers from cancer will experience changes in the value of certain gene expression.  In previous studies, the Genetic Algorithm as a feature selection method and the Momentum Backpropagation algorithm as a classification method provide a fairly high classification performance, but the Momentum Backpropagation algorithm still has a low convergence rate because the learning rate used is still static. The low convergence rate makes the training process need more time to converge. Therefore, in this research an optimization of the Momentum Backpropagation algorithm is done by adding an adaptive learning rate scheme. The proposed scheme is proven to reduce the number of epochs needed in the training process from 390 epochs to 76 epochs compared to the Momentum Backpropagation algorithm. The proposed scheme can gain high accuracy of 90.51% for Colon Tumor data, and 100% for Leukemia, Lung Cancer, and Ovarian Cancer data.

scholarly journals Analisis Error dan Epoch dengan Pengembangan Adaptive Learning Rate dan Parameter Momentum pada Metode Backpropagation

2018 ◽  
Vol 3 (2) ◽  
Author(s):  
Zahratul Fitri
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Adaptive Learning ◽  
Learning Rate ◽  
Backpropagation Algorithm ◽  
Adaptive Learning Rate ◽  
Best Value ◽  
Artificial Neural Network Ann ◽  
Parameter Values ◽  
Value Of Learning

Abstrak— Algoritma backpropagation merupakan bagian dari Jaringan Syaraf Tiruan (JST) yang memiliki beberapa layar tersembunyi. Algoritma backpropagation juga merupakan multi-layer yang banyak digunakan untuk menyelesaikan persoalan yang luas, akan tetapi, algoritma backpropagation juga memiliki kelamahan pada proses pembelajaran yang cukup lambat. Pada penelitian ini penulis menganalisis bagaimana mengembangkan algoritma backpropagation dengan menggunakan learning rate dan parameter momentum untuk meminimalisir error dan epoch yang akurat sebagai proses menghitung perubahan bobot. Dari hasil penelitian diperoleh bahwa pengembangan yang dilakukan memperoleh nilai paling baik pada nilai momentum yaitu 0,9 dan 1.0 dan nilai learning rate yaitu > 0,7. Hal ini membuktikan bahwa nilai pembelajaran dengan menggunakan nilai parameter momentum dan nilai learning rate diatas sangat baik digunakan sebagai percepatan laju konvergensi.Kata kunci— Algoritma Backpropagation, Parameter Momentum, Adaptive Learning Rate . Abstract— Backpropagation algorithm is part of an Artificial Neural Network (ANN), which has some hidden screen. Backpropagation algorithm is also a multi-layer finish that is widely used for large problems, however, the backpropagation algorithm also has weaknesses in the learning process is quite slow. In this study the authors analyze how to develop a backpropagation algorithm using learning rate and momentum parameters to minimize the error and accurate epoch as the process of calculating the weight change. The result showed that the development is carried out to obtain best value on the momentum value of 0.9 and 1.0 and the value of learning rate is> 0.7. It is proved that the value of learning by using the parameter values of momentum and learning rate values above are best used as a convergence rate acceleration.Keywords— Backpropagation Algorithm, Parameter of Momentum, Adaptive   Learning Rate

Diffusion Approximations for the Constant Learning Rate Backpropagation Algorithm and Resistance to Local Minima

1994 ◽  
Vol 6 (2) ◽  
pp. 285-295 ◽  
Author(s):  
William Finnoff
Keyword(s):  
Gradient Descent ◽  
Asymptotic Properties ◽  
Learning Rate ◽  
Local Minima ◽  
Diffusion Approximations ◽  
Training Process ◽  
Training Set ◽  
Backpropagation Algorithm ◽  
Linear Stochastic Differential Equation ◽  
Local Gradient

In this paper we discuss the asymptotic properties of the most commonly used variant of the backpropagation algorithm in which network weights are trained by means of a local gradient descent on examples drawn randomly from a fixed training set, and the learning rate η of the gradient updates is held constant (simple backpropagation). Using stochastic approximation results, we show that for η → 0 this training process approaches a batch training. Further, we show that for small η one can approximate simple backpropagation by the sum of a batch training process and a gaussian diffusion, which is the unique solution to a linear stochastic differential equation. Using this approximation we indicate the reasons why simple backpropagation is less likely to get stuck in local minima than the batch training process and demonstrate this empirically on a number of examples.

scholarly journals Application of a modified Inception-v3 model in the dynasty-based classification of ancient murals

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Jianfang Cao ◽  
Minmin Yan ◽  
Yiming Jia ◽  
Xiaodong Tian ◽  
Zibang Zhang
Keyword(s):  
Transfer Learning ◽  
Adaptive Learning ◽  
Deep Level ◽  
Image Resolution ◽  
Learning Rate ◽  
Stochastic Gradient Descent ◽  
Natural Image ◽  
Historical Period ◽  
Proposed Model

AbstractIt is difficult to identify the historical period in which some ancient murals were created because of damage due to artificial and/or natural factors; similarities in content, style, and color among murals; low image resolution; and other reasons. This study proposed a transfer learning-fused Inception-v3 model for dynasty-based classification. First, the model adopted Inception-v3 with frozen fully connected and softmax layers for pretraining over ImageNet. Second, the model fused Inception-v3 with transfer learning for parameter readjustment over small datasets. Third, the corresponding bottleneck files of the mural images were generated, and the deep-level features of the images were extracted. Fourth, the cross-entropy loss function was employed to calculate the loss value at each step of the training, and an algorithm for the adaptive learning rate on the stochastic gradient descent was applied to unify the learning rate. Finally, the updated softmax classifier was utilized for the dynasty-based classification of the images. On the constructed small datasets, the accuracy rate, recall rate, and F1 value of the proposed model were 88.4%, 88.36%, and 88.32%, respectively, which exhibited noticeable increases compared with those of typical deep learning models and modified convolutional neural networks. Comparisons of the classification outcomes for the mural dataset with those for other painting datasets and natural image datasets showed that the proposed model achieved stable classification outcomes with a powerful generalization capacity. The training time of the proposed model was only 0.7 s, and overfitting seldom occurred.

Design of novel multi filter union feature selection framework for breast cancer dataset

2021 ◽  
pp. 1063293X2110160
Author(s):  
Dinesh Morkonda Gunasekaran ◽  
Prabha Dhandayudam
Keyword(s):  
Breast Cancer ◽  
Feature Selection ◽  
Care Center ◽  
Feature Selection Method ◽  
Selection Method ◽  
Cancer Center ◽  
Breast Cancer Dataset ◽  
Data Set ◽  
Health Care Center ◽  
Cancer Data

Nowadays women are commonly diagnosed with breast cancer. Feature based Selection method plays an important step while constructing a classification based framework. We have proposed Multi filter union (MFU) feature selection method for breast cancer data set. The feature selection process based on random forest algorithm and Logistic regression (LG) algorithm based union model is used for selecting important features in the dataset. The performance of the data analysis is evaluated using optimal features subset from selected dataset. The experiments are computed with data set of Wisconsin diagnostic breast cancer center and next the real data set from women health care center. The result of the proposed approach shows high performance and efficient when comparing with existing feature selection algorithms.

scholarly journals Comparison of Multi Layered Percepton and Radial Basis Function Classification Performance of Lung Cancer Data

2020 ◽  
Vol 1471 ◽  
pp. 012043
Author(s):  
Yessi Jusman ◽  
Zul Indra ◽  
Roni Salambue ◽  
Siti Nurul Aqmariah Mohd Kanafiah ◽  
Muhammad Ahdan Fawwaz Nurkholid
Keyword(s):  
Lung Cancer ◽  
Radial Basis Function ◽  
Basis Function ◽  
Classification Performance ◽  
Cancer Data ◽  
Lung Cancer Data ◽  
Radial Basis
Sign in / Sign up

Export Citation Format

Share Document