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 A New “Good and Bad Groups-Based Optimizer” for Solving Various Optimization Problems

2021 ◽  
Vol 11 (10) ◽  
pp. 4382
Author(s):  
Ali Sadeghi ◽  
Sajjad Amiri Doumari ◽  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Pavel Trojovský ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Fitness Function ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Gray Wolf ◽  
Good Group ◽  
Good Ability ◽  
Whale Optimization

Optimization is the science that presents a solution among the available solutions considering an optimization problem’s limitations. Optimization algorithms have been introduced as efficient tools for solving optimization problems. These algorithms are designed based on various natural phenomena, behavior, the lifestyle of living beings, physical laws, rules of games, etc. In this paper, a new optimization algorithm called the good and bad groups-based optimizer (GBGBO) is introduced to solve various optimization problems. In GBGBO, population members update under the influence of two groups named the good group and the bad group. The good group consists of a certain number of the population members with better fitness function than other members and the bad group consists of a number of the population members with worse fitness function than other members of the population. GBGBO is mathematically modeled and its performance in solving optimization problems was tested on a set of twenty-three different objective functions. In addition, for further analysis, the results obtained from the proposed algorithm were compared with eight optimization algorithms: genetic algorithm (GA), particle swarm optimization (PSO), gravitational search algorithm (GSA), teaching–learning-based optimization (TLBO), gray wolf optimizer (GWO), and the whale optimization algorithm (WOA), tunicate swarm algorithm (TSA), and marine predators algorithm (MPA). The results show that the proposed GBGBO algorithm has a good ability to solve various optimization problems and is more competitive than other similar algorithms.

scholarly journals An adaptive gravitational search algorithm for global optimization

2019 ◽  
Vol 16 (2) ◽  
pp. 724
Author(s):  
Ying-Ying Koay ◽  
Jian-Ding Tan ◽  
Chin-Wai Lim ◽  
Siaw-Paw Koh ◽  
Sieh-Kiong Tiong ◽  
...  
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Population Based ◽  
Adaptive Search ◽  
Step Size ◽  
Search Mechanism ◽  
Gravitational Search

<span>Optimization algorithm has become one of the most studied branches in the fields of artificial intelligent and soft computing. Many powerful optimization algorithms with global search ability can be found in the literature. Gravitational Search Algorithm (GSA) is one of the relatively new population-based optimization algorithms. In this research, an Adaptive Gravitational Search Algorithm (AGSA) is proposed. The AGSA is enhanced with an adaptive search step local search mechanism. The adaptive search step begins the search with relatively larger step size, and automatically fine-tunes the step size as iterations go. This enhancement grants the algorithm a more powerful exploitation ability, which in turn grants solutions with higher accuracies. The proposed AGSA was tested in a test suit with several well-established optimization test functions. The results showed that the proposed AGSA out-performed other algorithms such as conventional GSA and Genetic Algorithm in the benchmarking of speed and accuracy. It can thus be concluded that the proposed AGSA performs well in solving local and global optimization problems. Applications of the AGSA to solve practical engineering optimization problems can be considered in the future.</span>

Analysis of Gravitation-Based Optimization Algorithms for Clustering and Classification

2020 ◽  
pp. 74-99 ◽  
Author(s):  
Sajad Ahmad Rather ◽  
P. Shanthi Bala
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Clustering Algorithms ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Search Space ◽  
Classification Problems ◽  
Local Optima ◽  
Clustering And Classification

In recent years, various heuristic algorithms based on natural phenomena and swarm behaviors were introduced to solve innumerable optimization problems. These optimization algorithms show better performance than conventional algorithms. Recently, the gravitational search algorithm (GSA) is proposed for optimization which is based on Newton's law of universal gravitation and laws of motion. Within a few years, GSA became popular among the research community and has been applied to various fields such as electrical science, power systems, computer science, civil and mechanical engineering, etc. This chapter shows the importance of GSA, its hybridization, and applications in solving clustering and classification problems. In clustering, GSA is hybridized with other optimization algorithms to overcome the drawbacks such as curse of dimensionality, trapping in local optima, and limited search space of conventional data clustering algorithms. GSA is also applied to classification problems for pattern recognition, feature extraction, and increasing classification accuracy.

scholarly journals APPLICATION OF THE GRAVITY SEARCH METHOD TO MINIMIZE THE COST OF CONDUCTING A MULTIFACTOR EXPERIMENT

2021 ◽  
pp. 42-48
Author(s):  
N.D. Koshevoy ◽  
A.V. Malkova
Keyword(s):  
Experimental Research ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Optimization Method ◽  
Search Method ◽  
Main Task ◽  
Multifactor Experiment ◽  
Gravitational Search ◽  
The Cost

Experimental research methods are increasingly used in industry in the optimization of production processes. Experiments, as a rule, are multifactorial and are connected with optimization of quality of materials, search of optimum conditions of carrying out technological processes, development of the most rational designs of the equipment, etc. The use of experimental planning makes the behavior of the experimenter purposeful and organized, significantly increases productivity and reliability of the results. An important advantage is its versatility, suitability in the vast majority of research areas. When implementing an industrial experiment, the main task is to obtain the maximum amount of useful information about the influence of individual factors of the production process, provided that the minimum number of expensive observations in the shortest period of time. Therefore, it is important to increase the efficiency of experimental research with minimal time and cost. For this purpose, it is expedient to develop systems of automation of experiments which will allow to reduce terms of carrying out experimental researches and to reduce expenses for them. Object of research: processes of optimization of plans of multifactor experiment on cost and time expenses. Subject of research: an optimization method developed on the basis of the gravitational search algorithm, which consists in comparing the force of gravity (cost) of the first row of the planning matrix of the experiment to the next rows of the matrix. In the study of photoelectric transducers of angular displacements, the efficiency and effectiveness of the gravitational search method were analyzed in comparison with previously developed methods: analysis of line permutations, particle swarm, taboo search. The cost of carrying out the experiment plan and the efficiency for solving optimization problems in comparison with the original plan and the implementation of the above methods are shown.

scholarly journals APPLICATION OF THE GRAVITY SEARCH METHOD TO MINIMIZE THE COST OF CONDUCTING A MULTIFACTOR EXPERIMENT

2020 ◽  
pp. 51-57
Author(s):  
N.D. Koshevoy ◽  
A.V. Malkova
Keyword(s):  
Experimental Research ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Optimization Method ◽  
Search Method ◽  
Main Task ◽  
Multifactor Experiment ◽  
Gravitational Search ◽  
The Cost

Experimental research methods are increasingly used in industry in the optimization of production processes. Experiments, as a rule, are multifactorial and are connected with optimization of quality of materials, search of optimum conditions of carrying out technological processes, development of the most rational designs of the equipment, etc. The use of experimental planning makes the behavior of the experimenter purposeful and organized, significantly increases productivity and reliability of the results. An important advantage is its versatility, suitability in the vast majority of research areas. When implementing an industrial experiment, the main task is to obtain the maximum amount of useful information about the influence of individual factors of the production process, provided that the minimum number of expensive observations in the shortest period of time. Therefore, it is important to increase the efficiency of experimental research with minimal time and cost. For this purpose, it is expedient to develop systems of automation of experiments which will allow to reduce terms of carrying out experimental researches and to reduce expenses for them. Object of research: processes of optimization of plans of multifactor experiment on cost and time expenses. Subject of research: an optimization method developed on the basis of the gravitational search algorithm, which consists in comparing the force of gravity (cost) of the first row of the planning matrix of the experiment to the next rows of the matrix. In the study of photoelectric transducers of angular displacements, the efficiency and effectiveness of the gravitational search method were analyzed in comparison with previously developed methods: analysis of line permutations, particle swarm, taboo search. The cost of carrying out the experiment plan and the efficiency for solving optimization problems in comparison with the original plan and the implementation of the above methods are shown.

Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC&amp;rsquo;17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

scholarly journals Binary Spring Search Algorithm for Solving Various Optimization Problems

2021 ◽  
Vol 11 (3) ◽  
pp. 1286 ◽  
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Ali Dehghani ◽  
Om P. Malik ◽  
Ruben Morales-Menendez ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
High Performance ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Bat Algorithm ◽  
Search Space ◽  
Binary Particle Swarm Optimization ◽  
Dragonfly Algorithm ◽  
Grasshopper Optimization Algorithm

One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. BSSA is an algorithm based on a simulation of the famous Hooke’s law (physics) for the traditional weights and springs system. In this proposal, the population comprises weights that are connected by unique springs. The mathematical modeling of the proposed algorithm is presented to be used to achieve solutions to optimization problems. The results were thoroughly validated in different unimodal and multimodal functions; additionally, the BSSA was compared with high-performance algorithms: binary grasshopper optimization algorithm, binary dragonfly algorithm, binary bat algorithm, binary gravitational search algorithm, binary particle swarm optimization, and binary genetic algorithm. The results show the superiority of the BSSA. The results of the Friedman test corroborate that the BSSA is more competitive.

scholarly journals GMBO: Group Mean-Based Optimizer for Solving Various Optimization Problems

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1190
Author(s):  
Mohammad Dehghani ◽  
Zeinab Montazeri ◽  
Štěpán Hubálovský
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Random Search ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Main Idea ◽  
Population Based ◽  
Grey Wolf Optimizer ◽  
Whale Optimization

There are many optimization problems in the different disciplines of science that must be solved using the appropriate method. Population-based optimization algorithms are one of the most efficient ways to solve various optimization problems. Population-based optimization algorithms are able to provide appropriate solutions to optimization problems based on a random search of the problem-solving space without the need for gradient and derivative information. In this paper, a new optimization algorithm called the Group Mean-Based Optimizer (GMBO) is presented; it can be applied to solve optimization problems in various fields of science. The main idea in designing the GMBO is to use more effectively the information of different members of the algorithm population based on two selected groups, with the titles of the good group and the bad group. Two new composite members are obtained by averaging each of these groups, which are used to update the population members. The various stages of the GMBO are described and mathematically modeled with the aim of being used to solve optimization problems. The performance of the GMBO in providing a suitable quasi-optimal solution on a set of 23 standard objective functions of different types of unimodal, high-dimensional multimodal, and fixed-dimensional multimodal is evaluated. In addition, the optimization results obtained from the proposed GMBO were compared with eight other widely used optimization algorithms, including the Marine Predators Algorithm (MPA), the Tunicate Swarm Algorithm (TSA), the Whale Optimization Algorithm (WOA), the Grey Wolf Optimizer (GWO), Teaching–Learning-Based Optimization (TLBO), the Gravitational Search Algorithm (GSA), Particle Swarm Optimization (PSO), and the Genetic Algorithm (GA). The optimization results indicated the acceptable performance of the proposed GMBO, and, based on the analysis and comparison of the results, it was determined that the GMBO is superior and much more competitive than the other eight algorithms.

scholarly journals An Effective Method for Parameter Estimation of Solar PV Cell Using Grey-Wolf Optimization Technique

2021 ◽  
Vol 6 (3) ◽  
pp. 911-931
Author(s):  
Abhishek Sharma ◽  
Abhinav Sharma ◽  
Averbukh Moshe ◽  
Nikhil Raj ◽  
Rupendra Kumar Pachauri
Keyword(s):  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Parameter Extraction ◽  
Solar Pv ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
Swarm Optimization ◽  
Pv Cell ◽  
Gravitational Search

In the field of renewable energy, the extraction of parameters for solar photovoltaic (PV) cells is a widely studied area of research. Parameter extraction of solar PV cell is a highly non-linear complex optimization problem. In this research work, the authors have explored grey wolf optimization (GWO) algorithm to estimate the optimized value of the unknown parameters of a PV cell. The simulation results have been compared with five different pre-existing optimization algorithms: gravitational search algorithm (GSA), a hybrid of particle swarm optimization and gravitational search algorithm (PSOGSA), sine cosine (SCA), chicken swarm optimization (CSO) and cultural algorithm (CA). Furthermore, a comparison with the algorithms existing in the literature is also carried out. The comparative results comprehensively demonstrate that GWO outperforms the existing optimization algorithms in terms of root mean square error (RMSE) and the rate of convergence. Furthermore, the statistical results validate and indicate that GWO algorithm is better than other algorithms in terms of average accuracy and robustness. An extensive comparison of electrical performance parameters: maximum current, voltage, power, and fill factor (FF) has been carried out for both PV model.

Sign in / Sign up

Export Citation Format

Share Document