A Hybrid Approach for Sub-Acute Ischemic Stroke Lesion Segmentation Using Random Decision Forest and Gravitational Search Algorithm

2019 ◽  
Vol 15 (2) ◽  
pp. 170-183
Author(s):  
Sunil Babu Melingi ◽  
V. Vijayalakshmi
Keyword(s):  
Ischemic Stroke ◽  
Magnetic Resonance ◽  
Acute Ischemic Stroke ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Mr Images ◽  
Random Decision Forest ◽  
Number Of Leaves ◽  
Gravitational Search ◽  
Decision Forest

Background: The sub-acute ischemic stroke is the most basic illnesses reason for death on the planet. We evaluate the impact of segmentation technique during the time of breaking down the capacities of the cerebrum. </P><P> Objective: The main objective of this paper is to segment the ischemic stroke lesions in Magnetic Resonance (MR) images in the presence of other pathologies like neurological disorder, encephalopathy, brain damage, Multiple sclerosis (MS). Methods: In this paper, we utilize a hybrid way to deal with segment the ischemic stroke from alternate pathologies in magnetic resonance (MR) images utilizing Random Decision Forest (RDF) and Gravitational Search Algorithm (GSA). The RDF approach is an effective machine learning approach. Results: The RDF strategy joins two parameters; they are; the number of trees in the forest and the number of leaves per tree; it runs quickly and proficiently when dealing with vast data. The GSA algorithm is utilized to optimize the RDF data for choosing the best number of trees and the number of leaves per tree in the forest. Conclusion: This paper provides a new hybrid GSA-RDF classifier technique to segment the ischemic stroke lesions in MR images. The experimental results demonstrate that the proposed technique has the Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE), and Mean Bias Error (MBE) ranges are 16.5485 %, 7.2654 %, and 2.4585 %individually. The proposed RDF-GSA algorithm has better precision and execution when compared with the existing ischemic stroke segmentation method.

Analysis of Optimal Power Flow Using Gravitational Search Algorithm

2016 ◽  
Vol 3 (4) ◽  
pp. 1-11
Author(s):  
M. Lakshmikantha Reddy ◽  
◽  
M. Ramprasad Reddy ◽  
V.C. Veera Reddy ◽  
◽  
...  
Keyword(s):  
Power Flow ◽  
Optimal Power Flow ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Optimal Power ◽  
Gravitational Search

Automatic Mining of Quantitative Association Rules with Gravitational Search Algorithm

2017 ◽  
Vol 27 (03) ◽  
pp. 343-372 ◽  
Author(s):  
Umit Can ◽  
Bilal Alatas
Keyword(s):  
Association Rules ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Fitness Function ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Search Space ◽  
Search Method ◽  
Quantitative Association Rules ◽  
Gravitational Search

The classical optimization algorithms are not efficient in solving complex search and optimization problems. Thus, some heuristic optimization algorithms have been proposed. In this paper, exploration of association rules within numerical databases with Gravitational Search Algorithm (GSA) has been firstly performed. GSA has been designed as search method for quantitative association rules from the databases which can be regarded as search space. Furthermore, determining the minimum values of confidence and support for every database which is a hard job has been eliminated by GSA. Apart from this, the fitness function used for GSA is very flexible. According to the interested problem, some parameters can be removed from or added to the fitness function. The range values of the attributes have been automatically adjusted during the time of mining of the rules. That is why there is not any requirements for the pre-processing of the data. Attributes interaction problem has also been eliminated with the designed GSA. GSA has been tested with four real databases and promising results have been obtained. GSA seems an effective search method for complex numerical sequential patterns mining, numerical classification rules mining, and clustering rules mining tasks of data mining.

scholarly journals Influence of Wind Power on Modeling of Bidding Strategy in a Promising Power Market with a Modified Gravitational Search Algorithm

2021 ◽  
Vol 11 (10) ◽  
pp. 4438
Author(s):  
Satyendra Singh ◽  
Manoj Fozdar ◽  
Hasmat Malik ◽  
Maria del Valle Fernández Moreno ◽  
Fausto Pedro García Márquez
Keyword(s):  
Wind Power ◽  
Electricity Market ◽  
Large Scale ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Optimization Methods ◽  
Bidding Strategy ◽  
Wind Speed Profile ◽  
Gravitational Search ◽  
Modified Gravitational Search Algorithm

It is expected that large-scale producers of wind energy will become dominant players in the future electricity market. However, wind power output is irregular in nature and it is subjected to numerous fluctuations. Due to the effect on the production of wind power, producing a detailed bidding strategy is becoming more complicated in the industry. Therefore, in view of these uncertainties, a competitive bidding approach in a pool-based day-ahead energy marketplace is formulated in this paper for traditional generation with wind power utilities. The profit of the generating utility is optimized by the modified gravitational search algorithm, and the Weibull distribution function is employed to represent the stochastic properties of wind speed profile. The method proposed is being investigated and simplified for the IEEE-30 and IEEE-57 frameworks. The results were compared with the results obtained with other optimization methods to validate the approach.

Sign in / Sign up

Export Citation Format

Share Document