scholarly journals Development of the classifier based on a multilayer perceptron using genetic algorithm and cart decision tree

2021 ◽  
Vol 5 (9 (113)) ◽  
pp. 82-90
Author(s):  
Lyudmila Dobrovska ◽  
Olena Nosovets

The problem of developing universal classifiers of biomedical data, in particular those that characterize the presence of a large number of parameters, inaccuracies and uncertainty, is urgent. Many studies are aimed at developing methods for analyzing these data, among them there are methods based on a neural network (NN) in the form of a multilayer perceptron (MP) using GA. The question of the application of evolutionary algorithms (EA) for setting up and learning the neural network is considered. Theories of neural networks, genetic algorithms (GA) and decision trees intersect and penetrate each other, new developed neural networks and their applications constantly appear. An example of a problem that is solved using EA algorithms is considered. Its goal is to develop and research a classifier for the diagnosis of breast cancer, obtained by combining the capabilities of the multilayer perceptron using the genetic algorithm (GA) and the CART decision tree. The possibility of improving the classifiers of biomedical data in the form of NN based on GA by applying the process of appropriate preparation of biomedical data using the CART decision tree has been established. The obtained results of the study indicate that these classifiers show the highest efficiency on the set of learning and with the minimum reduction of Decision Trees; increasing the number of contractions usually degrades the simulation result. On two datasets on the test set, the simulation accuracy was »83–87 %. The experiments carried out have confirmed the effectiveness of the proposed method for the synthesis of neural networks and make it possible to recommend it for practical use in processing data sets for further diagnostics, prediction, or pattern recognition

2017 ◽  
pp. 1437-1467
Author(s):  
Joydev Hazra ◽  
Aditi Roy Chowdhury ◽  
Paramartha Dutta

Registration of medical images like CT-MR, MR-MR etc. are challenging area for researchers. This chapter introduces a new cluster based registration technique with help of the supervised optimized neural network. Features are extracted from different cluster of an image obtained from clustering algorithms. To overcome the drawback regarding convergence rate of neural network, an optimized neural network is proposed in this chapter. The weights are optimized to increase the convergence rate as well as to avoid stuck in local minima. Different clustering algorithms are explored to minimize the clustering error of an image and extract features from suitable one. The supervised learning method applied to train the neural network. During this training process an optimization algorithm named Genetic Algorithm (GA) is used to update the weights of a neural network. To demonstrate the effectiveness of the proposed method, investigation is carried out on MR T1, T2 data sets. The proposed method shows convincing results in comparison with other existing techniques.


1993 ◽  
Vol 32 (01) ◽  
pp. 55-58 ◽  
Author(s):  
M. N. Narayanan ◽  
S. B. Lucas

Abstract:The ability of neural networks to predict the international normalised ratio (INR) for patients treated with Warfarin was investigated. Neural networks were obtained by using all the predictor variables in the neural network, or by using a genetic algorithm to select an optimal subset of predictor variables in a neural network. The use of a genetic algorithm gave a marked and significant improvement in the prediction of the INR in two of the three cases investigated. The mean error in these cases, typically, reduced from 1.02 ± 0.29 to 0.28 ± 0.25 (paired t-test, t = −4.71, p <0.001, n = 30). The use of a genetic algorithm with Warfarin data offers a significant enhancement of the predictive ability of a neural network with Warfarin data, identifies significant predictor variables, reduces the size of the neural network and thus the speed at which the reduced network can be trained, and reduces the sensitivity of a network to over-training.


2018 ◽  
Vol 7 (11) ◽  
pp. 430 ◽  
Author(s):  
Krzysztof Pokonieczny

The classification of terrain in terms of passability plays a significant role in the process of military terrain assessment. It involves classifying selected terrain to specific classes (GO, SLOW-GO, NO-GO). In this article, the problem of terrain classification to the respective category of passability was solved by applying artificial neural networks (multilayer perceptron) to generate a continuous Index of Passability (IOP). The neural networks defined this factor for primary fields in two sizes (1000 × 1000 m and 100 × 100 m) based on the land cover elements obtained from Vector Smart Map (VMap) Level 2 and Shuttle Radar Topography Mission (SRTM). The work used a feedforward neural network consisting of three layers. The paper presents a comprehensive analysis of the reliability of the neural network parameters, taking into account the number of neurons, learning algorithm, activation functions and input data configuration. The studies and tests carried out have shown that a well-trained neural network can automate the process of terrain classification in terms of passability conditions.


2001 ◽  
Vol 11 (03) ◽  
pp. 247-255 ◽  
Author(s):  
GUIDO BOLOGNA

The problem of rule extraction from neural networks is NP-hard. This work presents a new technique to extract "if-then-else" rules from ensembles of DIMLP neural networks. Rules are extracted in polynomial time with respect to the dimensionality of the problem, the number of examples, and the size of the resulting network. Further, the degree of matching between extracted rules and neural network responses is 100%. Ensembles of DIMLP networks were trained on four data sets in the public domain. Extracted rules were on average significantly more accurate than those extracted from C4.5 decision trees.


2021 ◽  
Vol 6 (2) ◽  
pp. 128-133
Author(s):  
Ihor Koval ◽  

The problem of finding objects in images using modern computer vision algorithms has been considered. The description of the main types of algorithms and methods for finding objects based on the use of convolutional neural networks has been given. A comparative analysis and modeling of neural network algorithms to solve the problem of finding objects in images has been conducted. The results of testing neural network models with different architectures on data sets VOC2012 and COCO have been presented. The results of the study of the accuracy of recognition depending on different hyperparameters of learning have been analyzed. The change in the value of the time of determining the location of the object depending on the different architectures of the neural network has been investigated.


2020 ◽  
Author(s):  
Alisson Steffens Henrique ◽  
Vinicius Almeida dos Santos ◽  
Rodrigo Lyra

There are several challenges when modeling artificial intelligencemethods for autonomous players on games (bots). NEAT is one ofthe models that, combining genetic algorithms and neural networks,seek to describe a bot behavior more intelligently. In NEAT, a neuralnetwork is used for decision making, taking relevant inputs fromthe environment and giving real-time decisions. In a more abstractway, a genetic algorithm is applied for the learning step of the neuralnetworks’ weights, layers, and parameters. This paper proposes theuse of relative position as the input of the neural network, basedon the hypothesis that the bot profit will be improved.


Author(s):  
Tshilidzi Marwala

The problem of missing data in databases has recently been dealt with through the use computational intelligence. The hybrid of auto-associative neural networks and genetic algorithms has proven to be a successful approach to missing data imputation. Similarly, two auto-associative neural networks are developed to be used in conjunction with genetic algorithm to estimate missing data, and these approaches are compared to a Bayesian auto-associative neural network and genetic algorithm approach. One technique combines three neural networks to form a hybrid auto-associative network, while the other merges principal component analysis and neural networks. The hybrid of the neural network and genetic algorithm approach proves to be the most accurate when estimating one missing value, while a hybrid of principal component and neural networks is more consistent and captures patterns in the data more efficiently.


2007 ◽  
Vol 16 (01) ◽  
pp. 111-120 ◽  
Author(s):  
MANISH MANGAL ◽  
MANU PRATAP SINGH

This paper describes the application of two evolutionary algorithms to the feedforward neural networks used in classification problems. Besides of a simple backpropagation feedforward algorithm, the paper considers the genetic algorithm and random search algorithm. The objective is to analyze the performance of GAs over the simple backpropagation feedforward in terms of accuracy or speed in this problem. The experiments considered a feedforward neural network trained with genetic algorithm/random search algorithm and 39 types of network structures and artificial data sets. In most cases, the evolutionary feedforward neural networks seemed to have better of equal accuracy than the original backpropagation feedforward neural network. We found few differences in the accuracy of the networks solved by applying the EAs, but found ample differences in the execution time. The results suggest that the evolutionary feedforward neural network with random search algorithm might be the best algorithm on the data sets we tested.


2020 ◽  
Vol 34 (04) ◽  
pp. 3882-3889
Author(s):  
Wolfgang Fuhl ◽  
Gjergji Kasneci ◽  
Wolfgang Rosenstiel ◽  
Enkeljda Kasneci

We present an alternative layer to convolution layers in convolutional neural networks (CNNs). Our approach reduces the complexity of convolutions by replacing it with binary decisions. Those binary decisions are used as indexes to conditional distributions where each weight represents a leaf in a decision tree. This means that only the indices to the weights need to be determined once, thus reducing the complexity of convolutions by the depth of the output tensor. Index computation is performed by simple binary decisions that require fewer cycles compared to conventionally used multiplications. In addition, we show how convolutions can be replaced by binary decisions. These binary decisions form indices in the conditional distributions and we show how they are used to replace 2D weight matrices as well as 3D weight tensors. These new layers can be trained like convolution layers in CNNs based on the backpropagation algorithm, for which we provide a formalization. Our results on multiple publicly available data sets show that our approach performs similar to conventional neuronal networks. Beyond the formalized reduction of complexity and the improved qualitative performance, we show the runtime improvement empirically compared to convolution layers.


2007 ◽  
Vol 60 (2) ◽  
pp. 291-301 ◽  
Author(s):  
M. Mohasseb ◽  
A. El-Rabbany ◽  
O. Abd El-Alim ◽  
R. Rashad

This paper focuses on modelling and predicting differential GPS corrections transmitted by marine radio-beacon systems using artificial neural networks. Various neural network structures with various training algorithms were examined, including Linear, Radial Biases, and Feedforward. Matlab Neural Network toolbox is used for this purpose. Data sets used in building the model are the transmitted pseudorange corrections and broadcast navigation message. Model design is passed through several stages, namely data collection, preprocessing, model building, and finally model validation. It is found that feedforward neural network with automated regularization is the most suitable for our data. In training the neural network, different approaches are used to take advantage of the pseudorange corrections history while taking into account the required time for prediction and storage limitations. Three data structures are considered in training the neural network, namely all round, compound, and average. Of the various data structures examined, it is found that the average data structure is the most suitable. It is shown that the developed model is capable of predicting the differential correction with an accuracy level comparable to that of beacon-transmitted real-time DGPS correction.


Sign in / Sign up

Export Citation Format

Share Document