scholarly journals Clustering by Hybrid K-Harmonic Means and Biogeography Based Optimization Algorithm for Medical Data

2020 ◽  
Vol 9 (6) ◽  
pp. 517-522
Keyword(s):  
Clustering Algorithm ◽  
Fitness Function ◽  
Optimization Technique ◽  
Optimization Methods ◽  
Medical Data ◽  
Local Optima ◽  
Computation Cost ◽  
Actual Creation ◽  
Partition Clustering ◽  
Harmonic Means

: In today trendy world hybrid based optimized data clustering is unique and imperative clustering tool in the area of data mining, which is dynamic research of actual creation problems. The oldest and furthermost commonly used popular clustering technique is the K-means(KM) algorithm, which is very complex and for the initialization of the cluster centroid and it will easily go for premature converge. This initialization problem of K-means can be evaded by built in boost function of K-Harmonic Means, which is centroid based clustering algorithm and also unresponsive for collection of initial partition clustering , but it can easily go for pre-matured conjunction in local optima. To avoid this convergence problem, this proposed algorithm uses Boosting K-harmonic means(KHM) algorithm with BBO to produce more precise, robust, better clustering solution in few number of iterations, evade conning in local optima and simply convergence to relate with Harmonic Means, BBO algorithms. Biogeography based algorithm works with the concept of emigration and immigration of inhabitants from one location to another location, Which has high computation cost. For avoiding this high computation cost in this hybrid optimization technique Biogeography-Based Optimization (BBO) is integrated with K-Harmonic means algorithm to produce optimum and effective clustering solution with faster convergence. BBO is universal optimization methods to solve utmost of the optimization problem, which is an production based generation of evolutionary algorithm (EA)that augments a function by stochastically and re peatedly improving the clustering solution of quality, or fitness function. The experimental results of this paper shown as the projected method is very resourceful and faster to afford better clustering solution in less number of repetitions for medical data

scholarly journals A New Method on Data Clustering Based on Hybrid K-Harmonic Means and Imperialist Competitive Algorithm

2013 ◽  
Vol 10 (7) ◽  
pp. 1848-1857
Author(s):  
Marjan Abdeyazdan
Keyword(s):  
Data Clustering ◽  
Particle Swarm Optimization Algorithm ◽  
Clustering Algorithms ◽  
Optimization Technique ◽  
Imperialist Competitive Algorithm ◽  
Swarm Optimization ◽  
Local Optima ◽  
Evolutionary Genetic ◽  
Harmonic Means ◽  
Global Optimization Technique

Data clustering is one of the commonest data mining techniques. The K-means algorithm is one of the most wellknown clustering algorithms thatare increasingly popular due to the simplicity of implementation and speed of operation. However, its performancecouldbe affected by some issues concerningsensitivity to the initialization and getting stuck in local optima. The K-harmonic means clustering method manages the issue of sensitivity to initialization but the local optimaissue still compromises the algorithm. Particle Swarm Optimization algorithm is a stochastic global optimization technique which is a good solution to the above-mentioned problems. In the present article, the PSOKHM, a hybrid algorithm which draws upon the advantages of both of the algorithms, strives not only to overcome the issue of local optima in KHM but also the slow convergence speed of PSO. In this article, the proposed GSOKHM method, which is a combination of PSO and the evolutionary genetic algorithmwithin PSOKHM,has been positedto enhancethe PSO operation. To carry out this experiment, four real datasets have been employed whose results indicate thatGSOKHMoutperforms PSOKHM.

scholarly journals Non-Deterministic Methods and Surrogates in the Design of Rockfill Dams

2021 ◽  
Vol 11 (8) ◽  
pp. 3699
Author(s):  
Rajeev Das ◽  
Azzedine Soulaimani
Keyword(s):  
Inverse Analysis ◽  
Polynomial Regression ◽  
Optimization Technique ◽  
Constitutive Models ◽  
Optimization Methods ◽  
Local Optima ◽  
Actual Performance ◽  
Deterministic Algorithms ◽  
Deterministic Methods ◽  
Deterministic Framework

The parameters of the constitutive models used in the design of rockfill dams are associated with a high degree of uncertainty. This occurs because rockfill dams are comprised of numerous zones, each with different soil materials, and it is not feasible to extract materials from such structures to accurately ascertain their behavior or their respective parameters. The general approach involves laboratory tests using small material samples or empirical data from the literature. However, such measures lack an accurate representation of the actual scenario, resulting in uncertainties. This limits the suitability of the model in the design process. Inverse analysis provides an option to better understand dam behavior. This procedure involves the use of real monitored data, such as deformations and stresses, from the dam structure via installed instruments. Fundamentally, it is a non-destructive approach that considers optimization methods and actual performance data to determine the values of the parameters by minimizing the differences between simulated and observed results. This paper considers data from an actual rockfill dam and proposes a surrogate assisted non-deterministic framework for its inverse analysis. A suitable error/objective function that measures the differences between the actual and simulated displacement values is defined first. Non-deterministic algorithms are used as the optimization technique, as they can avoid local optima and are more robust when compared to the conventional deterministic methods. Three such approaches, the genetic algorithm, differential evolution, and particle swarm optimization are evaluated to identify the best strategy in solving problems of this nature. A surrogate model in the form of a polynomial regression is studied and recommended in place of the actual numerical model of the dam to reduce computation cost. Finally, this paper presents the relevant dam parameters estimated by the analysis and provides insights into the performance of the three procedures to solve the inverse problem.

scholarly journals Modified Immune Evolutionary Algorithm for Medical Data Clustering and Feature Extraction under Cloud Computing Environment

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Jing Yu ◽  
Hang Li ◽  
Desheng Liu
Keyword(s):  
Cloud Computing ◽  
Feature Extraction ◽  
Big Data ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Fitness Function ◽  
Medical Data ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
Evolutionary Method

Medical data have the characteristics of particularity and complexity. Big data clustering plays a significant role in the area of medicine. The traditional clustering algorithms are easily falling into local extreme value. It will generate clustering deviation, and the clustering effect is poor. Therefore, we propose a new medical big data clustering algorithm based on the modified immune evolutionary method under cloud computing environment to overcome the above disadvantages in this paper. Firstly, we analyze the big data structure model under cloud computing environment. Secondly, we give the detailed modified immune evolutionary method to cluster medical data including encoding, constructing fitness function, and selecting genetic operators. Finally, the experiments show that this new approach can improve the accuracy of data classification, reduce the error rate, and improve the performance of data mining and feature extraction for medical data clustering.

A hybrid clustering algorithm based on improved GWO and KHM clustering

2021 ◽  
pp. 1-14
Author(s):  
Feng Xue ◽  
Yongbo Liu ◽  
Xiaochen Ma ◽  
Bharat Pathak ◽  
Peng Liang
Keyword(s):  
Clustering Algorithm ◽  
Test Functions ◽  
Convergence Factor ◽  
Step Size ◽  
Local Optima ◽  
Hybrid Clustering ◽  
Clustering Problem ◽  
Dynamic Weight ◽  
The Stability ◽  
Harmonic Means

To solve the problem that the K-means algorithm is sensitive to the initial clustering centers and easily falls into local optima, we propose a new hybrid clustering algorithm called the IGWOKHM algorithm. In this paper, we first propose an improved strategy based on a nonlinear convergence factor, an inertial step size, and a dynamic weight to improve the search ability of the traditional grey wolf optimization (GWO) algorithm. Then, the improved GWO (IGWO) algorithm and the K-harmonic means (KHM) algorithm are fused to solve the clustering problem. This fusion clustering algorithm is called IGWOKHM, and it combines the global search ability of IGWO with the local fast optimization ability of KHM to both solve the problem of the K-means algorithm’s sensitivity to the initial clustering centers and address the shortcomings of KHM. The experimental results on 8 test functions and 4 University of California Irvine (UCI) datasets show that the IGWO algorithm greatly improves the efficiency of the model while ensuring the stability of the algorithm. The fusion clustering algorithm can effectively overcome the inadequacies of the K-means algorithm and has a good global optimization ability.

scholarly journals Adaptive Gene Level Mutation

Algorithms ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 16
Author(s):  
Jalal Al-afandi ◽  
Horváth András
Keyword(s):  
Genetic Algorithms ◽  
Stochastic Optimization ◽  
Specific Problem ◽  
Traditional Approach ◽  
Fitness Function ◽  
Optimization Methods ◽  
Analytic Solutions ◽  
Problem Representation ◽  
Travelling Salesman ◽  
Gene Level

Genetic Algorithms are stochastic optimization methods where solution candidates, complying to a specific problem representation, are evaluated according to a predefined fitness function. These approaches can provide solutions in various tasks even, where analytic solutions can not be or are too complex to be computed. In this paper we will show, how certain set of problems are partially solvable allowing us to grade segments of a solution individually, which results local and individual tuning of mutation parameters for genes. We will demonstrate the efficiency of our method on the N-Queens and travelling salesman problems where we can demonstrate that our approach always results faster convergence and in most cases a lower error than the traditional approach.

Factor-Bounded Nonnegative Matrix Factorization

2021 ◽  
Vol 15 (6) ◽  
pp. 1-18
Author(s):  
Kai Liu ◽  
Xiangyu Li ◽  
Zhihui Zhu ◽  
Lodewijk Brand ◽  
Hua Wang
Keyword(s):  
Matrix Factorization ◽  
Clustering Algorithm ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Optimization Methods ◽  
Auxiliary Function ◽  
Image Clustering ◽  
Real World Datasets ◽  
The Relationship ◽  
Matrix Factors

Nonnegative Matrix Factorization (NMF) is broadly used to determine class membership in a variety of clustering applications. From movie recommendations and image clustering to visual feature extractions, NMF has applications to solve a large number of knowledge discovery and data mining problems. Traditional optimization methods, such as the Multiplicative Updating Algorithm (MUA), solves the NMF problem by utilizing an auxiliary function to ensure that the objective monotonically decreases. Although the objective in MUA converges, there exists no proof to show that the learned matrix factors converge as well. Without this rigorous analysis, the clustering performance and stability of the NMF algorithms cannot be guaranteed. To address this knowledge gap, in this article, we study the factor-bounded NMF problem and provide a solution algorithm with proven convergence by rigorous mathematical analysis, which ensures that both the objective and matrix factors converge. In addition, we show the relationship between MUA and our solution followed by an analysis of the convergence of MUA. Experiments on both toy data and real-world datasets validate the correctness of our proposed method and its utility as an effective clustering algorithm.

Optimization Design of Trusses Based on Covariance Matrix Adaptation Evolution Strategy Algorithm

2012 ◽  
Vol 215-216 ◽  
pp. 133-137
Author(s):  
Guo Shao Su ◽  
Yan Zhang ◽  
Zhen Xing Wu ◽  
Liu Bin Yan
Keyword(s):  
Stochastic Optimization ◽  
Covariance Matrix ◽  
Optimization Problems ◽  
Fitness Function ◽  
Optimization Methods ◽  
Evolution Strategy ◽  
Covariance Matrix Adaptation ◽  
Study Results ◽  
Highly Nonlinear ◽  
Adaptation Evolution

Covariance matrix adaptation evolution strategy algorithm (CMA-ES) is a newly evolution algorithm. It has become a powerful tool for solving highly nonlinear multi-peak optimization problems. In many real-world optimization problems, the location of multiple optima is often required in a search space. In order to evaluate the solution, thousands of fitness function evaluations are involved that is a time consuming or expensive processes. Therefore, conventional stochastic optimization methods meet a special challenge for a very large number of problem function evaluations. Aiming to overcome the shortcoming of stochastic optimization methods in the high calculation cost, a truss optimal method based on CMA-ES algorithm is proposed and applied to solve the section and shape optimization problems of trusses. The study results show that the method is feasible and has the advantages of high accuracy, high efficiency and easy implementation.

Optimizing the Learning Process of Feedforward Neural Networks Using Lightning Search Algorithm

2016 ◽  
Vol 25 (06) ◽  
pp. 1650033 ◽  
Author(s):  
Hossam Faris ◽  
Ibrahim Aljarah ◽  
Nailah Al-Madi ◽  
Seyedali Mirjalili
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Technique ◽  
Back Propagation ◽  
Feedforward Neural Networks ◽  
Training Algorithms ◽  
Local Optima ◽  
Local Solutions

Evolutionary Neural Networks are proven to be beneficial in solving challenging datasets mainly due to the high local optima avoidance. Stochastic operators in such techniques reduce the probability of stagnation in local solutions and assist them to supersede conventional training algorithms such as Back Propagation (BP) and Levenberg-Marquardt (LM). According to the No-Free-Lunch (NFL), however, there is no optimization technique for solving all optimization problems. This means that a Neural Network trained by a new algorithm has the potential to solve a new set of problems or outperform the current techniques in solving existing problems. This motivates our attempts to investigate the efficiency of the recently proposed Evolutionary Algorithm called Lightning Search Algorithm (LSA) in training Neural Network for the first time in the literature. The LSA-based trainer is benchmarked on 16 popular medical diagnosis problems and compared to BP, LM, and 6 other evolutionary trainers. The quantitative and qualitative results show that the LSA algorithm is able to show not only better local solutions avoidance but also faster convergence speed compared to the other algorithms employed. In addition, the statistical test conducted proves that the LSA-based trainer is significantly superior in comparison with the current algorithms on the majority of datasets.

Biomedical Document Clustering Based on Accelerated Symbiotic Organisms Search Algorithm

2021 ◽  
Vol 12 (4) ◽  
pp. 169-185
Author(s):  
Saida Ishak Boushaki ◽  
Omar Bendjeghaba ◽  
Nadjet Kamel
Keyword(s):  
Clustering Algorithm ◽  
Search Algorithm ◽  
Clustering Algorithms ◽  
Document Clustering ◽  
Latent Semantic Indexing ◽  
Research Area ◽  
Semantic Indexing ◽  
Local Optima ◽  
Symbiotic Organisms Search ◽  
Symbiotic Organisms

Clustering is an important unsupervised analysis technique for big data mining. It finds its application in several domains including biomedical documents of the MEDLINE database. Document clustering algorithms based on metaheuristics is an active research area. However, these algorithms suffer from the problems of getting trapped in local optima, need many parameters to adjust, and the documents should be indexed by a high dimensionality matrix using the traditional vector space model. In order to overcome these limitations, in this paper a new documents clustering algorithm (ASOS-LSI) with no parameters is proposed. It is based on the recent symbiotic organisms search metaheuristic (SOS) and enhanced by an acceleration technique. Furthermore, the documents are represented by semantic indexing based on the famous latent semantic indexing (LSI). Conducted experiments on well-known biomedical documents datasets show the significant superiority of ASOS-LSI over five famous algorithms in terms of compactness, f-measure, purity, misclassified documents, entropy, and runtime.

Solving Mono- and Multi-Objective Problems Using Hybrid Evolutionary Algorithms and Nelder-Mead Method

2021 ◽  
Vol 12 (4) ◽  
pp. 98-116
Author(s):  
Noureddine Boukhari ◽  
Fatima Debbat ◽  
Nicolas Monmarché ◽  
Mohamed Slimane
Keyword(s):  
Convergence Rate ◽  
Optimization Problem ◽  
Optimization Problems ◽  
State Of The Art ◽  
Hybrid Approach ◽  
Optimization Methods ◽  
Global Optimum ◽  
Stochastic Methods ◽  
Local Optima ◽  
Portfolio Optimization Problem

Evolution strategies (ES) are a family of strong stochastic methods for global optimization and have proved their capability in avoiding local optima more than other optimization methods. Many researchers have investigated different versions of the original evolution strategy with good results in a variety of optimization problems. However, the convergence rate of the algorithm to the global optimum stays asymptotic. In order to accelerate the convergence rate, a hybrid approach is proposed using the nonlinear simplex method (Nelder-Mead) and an adaptive scheme to control the local search application, and the authors demonstrate that such combination yields significantly better convergence. The new proposed method has been tested on 15 complex benchmark functions and applied to the bi-objective portfolio optimization problem and compared with other state-of-the-art techniques. Experimental results show that the performance is improved by this hybridization in terms of solution eminence and strong convergence.

Sign in / Sign up

Export Citation Format

Share Document