Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A fast elitism Gaussian estimation of distribution algorithm and application for PID optimization.

ABSTRACT: Estimation of distribution algorithm (EDA) is an intelligent optimization algorithm based on the probability statistics theory. A fast elitism Gaussian estimation of distribution algorithm (FEGEDA) is proposed in this paper. The Gaussian probability model is used to model the solution distribution. The parameters of Gaussian come from the statistical information of the best individuals by fast learning rule. A fast learning rule is used to enhance the efficiency of the algorithm, and an elitism strategy is used to maintain the convergent performance. The performances of the algorithm are examined based upon several benchmarks. In the simulations, a one-dimensional benchmark is used to visualize the optimization process and probability model learning process during the evolution, and several two-dimensional and higher dimensional benchmarks are used to testify the performance of FEGEDA. The experimental results indicate the capability of FEGEDA, especially in the higher dimensional problems, and the FEGEDA exhibits a better performance than some other algorithms and EDAs. Finally, FEGEDA is used in PID controller optimization of PMSM and compared with the classical-PID and GA.

SUBMITTER: Xu Q

PROVIDER: S-EPMC4032667 | biostudies-other | 2014

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

A penalized EM algorithm incorporating missing data mechanism for Gaussian parameter estimation.

Project description:Missing data rates could depend on the targeted values in many settings, including mass spectrometry-based proteomic profiling studies. Here, we consider mean and covariance estimation under a multivariate Gaussian distribution with non-ignorable missingness, including scenarios in which the dimension (p) of the response vector is equal to or greater than the number (n) of independent observations. A parameter estimation procedure is developed by maximizing a class of penalized likelihood functions that entails explicit modeling of missing data probabilities. The performance of the resulting "penalized EM algorithm incorporating missing data mechanism (PEMM)" estimation procedure is evaluated in simulation studies and in a proteomic data illustration.

| S-EPMC4061266 | biostudies-literature

Application of an Enhanced Whale Optimization Algorithm on Coverage Optimization of Sensor.

Project description:The wireless sensor network (WSN) is an essential technology of the Internet of Things (IoT) but has the problem of low coverage due to the uneven distribution of sensor nodes. This paper proposes a novel enhanced whale optimization algorithm (WOA), incorporating Lévy flight and a genetic algorithm optimization mechanism (WOA-LFGA). The Lévy flight technique bolsters the global search ability and convergence speed of the WOA, while the genetic optimization mechanism enhances its local search and random search capabilities. WOA-LFGA is tested with 29 mathematical optimization problems and a WSN coverage optimization model. Simulation results demonstrate that the improved algorithm is highly competitive compared with mainstream algorithms. Moreover, the practicality and the effectiveness of the improved algorithm in optimizing wireless sensor network coverage are confirmed.

| S-EPMC10452118 | biostudies-literature

Application of genetic algorithm to hexagon-based motion estimation.

Project description:With the improvement of science and technology, the development of the network, and the exploitation of the HDTV, the demands of audio and video become more and more important. Depending on the video coding technology would be the solution for achieving these requirements. Motion estimation, which removes the redundancy in video frames, plays an important role in the video coding. Therefore, many experts devote themselves to the issues. The existing fast algorithms rely on the assumption that the matching error decreases monotonically as the searched point moves closer to the global optimum. However, genetic algorithm is not fundamentally limited to this restriction. The character would help the proposed scheme to search the mean square error closer to the algorithm of full search than those fast algorithms. The aim of this paper is to propose a new technique which focuses on combing the hexagon-based search algorithm, which is faster than diamond search, and genetic algorithm. Experiments are performed to demonstrate the encoding speed and accuracy of hexagon-based search pattern method and proposed method.

| S-EPMC3925528 | biostudies-other

Fast-SNP: a fast matrix pre-processing algorithm for efficient loopless flux optimization of metabolic models.

Project description:MotivationComputation of steady-state flux solutions in large metabolic models is routinely performed using flux balance analysis based on a simple LP (Linear Programming) formulation. A minimal requirement for thermodynamic feasibility of the flux solution is the absence of internal loops, which are enforced using 'loopless constraints'. The resulting loopless flux problem is a substantially harder MILP (Mixed Integer Linear Programming) problem, which is computationally expensive for large metabolic models.ResultsWe developed a pre-processing algorithm that significantly reduces the size of the original loopless problem into an easier and equivalent MILP problem. The pre-processing step employs a fast matrix sparsification algorithm-Fast- sparse null-space pursuit (SNP)-inspired by recent results on SNP. By finding a reduced feasible 'loop-law' matrix subject to known directionalities, Fast-SNP considerably improves the computational efficiency in several metabolic models running different loopless optimization problems. Furthermore, analysis of the topology encoded in the reduced loop matrix enabled identification of key directional constraints for the potential permanent elimination of infeasible loops in the underlying model. Overall, Fast-SNP is an effective and simple algorithm for efficient formulation of loop-law constraints, making loopless flux optimization feasible and numerically tractable at large scale.Availability and implementationSource code for MATLAB including examples is freely available for download at http://www.aibn.uq.edu.au/cssb-resources under Software. Optimization uses Gurobi, CPLEX or GLPK (the latter is included with the algorithm).Contactlars.nielsen@uq.edu.auSupplementary information: Supplementary data are available at Bioinformatics online.

| S-EPMC5167067 | biostudies-literature

Multiple Matrix Gaussian Graphs Estimation.

Project description:Matrix-valued data, where the sampling unit is a matrix consisting of rows and columns of measurements, are emerging in numerous scientific and business applications. Matrix Gaussian graphical model is a useful tool to characterize the conditional dependence structure of rows and columns. In this article, we employ nonconvex penalization to tackle the estimation of multiple graphs from matrix-valued data under a matrix normal distribution. We propose a highly efficient nonconvex optimization algorithm that can scale up for graphs with hundreds of nodes. We establish the asymptotic properties of the estimator, which requires less stringent conditions and has a sharper probability error bound than existing results. We demonstrate the efficacy of our proposed method through both simulations and real functional magnetic resonance imaging analyses.

| S-EPMC6261498 | biostudies-literature

A fast MR fingerprinting simulator for direct error estimation and sequence optimization.

Project description:Magnetic resonance fingerprinting (MRF) is a novel quantitative MR technique that simultaneously provides multiple tissue property maps. When optimizing MRF scans, modeling undersampling errors and field imperfections in cost functions for direct measurement of quantitative errors will make the optimization results more practical and robust. However, optimizing such cost function is computationally expensive and impractical for MRF optimization with tens of thousands of iterations. Here, we introduce a fast MRF simulator to simulate aliased images from actual scan scenarios including undersampling and system imperfections, which substantially reduces computational time and allows for direct error estimation of the quantitative maps and efficient sequence optimization. We evaluate the performance and computational speed of the proposed approach by simulations and in vivo experiments. The simulations from the proposed method closely approximate the signals and MRF maps from in vivo scans, with 158 times shorter processing time than the conventional simulation method using Non-uniform Fourier transform. We also demonstrate the power of applying the fast MRF simulator in MRF sequence optimization. The optimized sequences are validated with in vivo scans to assess the image quality and accuracy. The optimized sequences produce artifact-free T1 and T2 maps in 2D and 3D scans with equivalent mapping accuracy as the human-designed sequence but at shorter scan times. Incorporating the proposed simulator in the MRF optimization framework makes direct estimation of undersampling errors during the optimization process feasible, and provide optimized MRF sequences that are robust against undersampling artifacts and field inhomogeneity.

| S-EPMC10002151 | biostudies-literature

Prediction of train wheel diameter based on Gaussian process regression optimized using a fast simulated annealing algorithm.

Project description:An algorithm to predict train wheel diameter based on Gaussian process regression (GPR) optimized using a fast simulated annealing algorithm (FSA-GPR) is proposed in this study to address the problem of dynamic decrease in wheel diameter with increase in mileage, which affects the measurement accuracy of train speed and location, as well as the hyper-parameter problem of the GPR in the traditional conjugate gradient algorithm. The algorithm proposed as well as other popular algorithms in the field, such as the traditional GPR algorithm, and GPR algorithms optimized using the artificial bee colony algorithm (ABC-GPR) or genetic algorithm (GA-GPR), were used to predict the wheel diameter of a DF11 train in a section of a railway during a period of major repairs. The results predicted by FSA-GPR was compared with other three algorithms as well as the real measured data from RMSE, MAE, R2 and Residual value. And the comparisons showed that the predictions obtained from the GPR optimized using FSA algorithm were more accurate than those based on the others. Therefore, this algorithm can be incorporated into the vehicle-mounted speed measurement module to automatically update the value of wheel diameter, thereby substantially reducing the manual work entailed therein and improving the effectiveness of measuring the speed and position of the train.

| S-EPMC6936821 | biostudies-literature

An ant colony optimization algorithm for phylogenetic estimation under the minimum evolution principle.

Project description:BackgroundDistance matrix methods constitute a major family of phylogenetic estimation methods, and the minimum evolution (ME) principle (aiming at recovering the phylogeny with shortest length) is one of the most commonly used optimality criteria for estimating phylogenetic trees. The major difficulty for its application is that the number of possible phylogenies grows exponentially with the number of taxa analyzed and the minimum evolution principle is known to belong to the NRho- hard class of problems.ResultsIn this paper, we introduce an Ant Colony Optimization (ACO) algorithm to estimate phylogenies under the minimum evolution principle. ACO is an optimization technique inspired from the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems.ConclusionWe show that the ACO algorithm is potentially competitive in comparison with state-of-the-art algorithms for the minimum evolution principle. This is the first application of an ACO algorithm to the phylogenetic estimation problem.

| S-EPMC2211314 | biostudies-literature

A Fast Incremental Gaussian Mixture Model.

Project description:This work builds upon previous efforts in online incremental learning, namely the Incremental Gaussian Mixture Network (IGMN). The IGMN is capable of learning from data streams in a single-pass by improving its model after analyzing each data point and discarding it thereafter. Nevertheless, it suffers from the scalability point-of-view, due to its asymptotic time complexity of O(NKD3) for N data points, K Gaussian components and D dimensions, rendering it inadequate for high-dimensional data. In this work, we manage to reduce this complexity to O(NKD2) by deriving formulas for working directly with precision matrices instead of covariance matrices. The final result is a much faster and scalable algorithm which can be applied to high dimensional tasks. This is confirmed by applying the modified algorithm to high-dimensional classification datasets.

| S-EPMC4596621 | biostudies-literature

A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming.

Project description:Maximum likelihood estimation of mixture proportions has a long history, and continues to play an important role in modern statistics, including in development of nonparametric empirical Bayes methods. Maximum likelihood of mixture proportions has traditionally been solved using the expectation maximization (EM) algorithm, but recent work by Koenker & Mizera shows that modern convex optimization techniques-in particular, interior point methods-are substantially faster and more accurate than EM. Here, we develop a new solution based on sequential quadratic programming (SQP). It is substantially faster than the interior point method, and just as accurate. Our approach combines several ideas: first, it solves a reformulation of the original problem; second, it uses an SQP approach to make the best use of the expensive gradient and Hessian computations; third, the SQP iterations are implemented using an active set method to exploit the sparse nature of the quadratic subproblems; fourth, it uses accurate low-rank approximations for more efficient gradient and Hessian computations. We illustrate the benefits of the SQP approach in experiments on synthetic data sets and a large genetic association data set. In large data sets ( n ≈ 106 observations, m ≈ 103 mixture components), our implementation achieves at least 100-fold reduction in runtime compared with a state-of-the-art interior point solver. Our methods are implemented in Julia and in an R package available on CRAN (https://CRAN.R-project.org/package=mixsqp).

| S-EPMC7986967 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data