scholarly journals Bio-inspired optimization algorithms for machine learning in agriculture applications

2020 ◽  
pp. 53-60
Author(s):  
P.R. MahiDar ◽  
Deepika Ghai
2020 ◽  
pp. 1-17
Author(s):  
Francisco Javier Balea-Fernandez ◽  
Beatriz Martinez-Vega ◽  
Samuel Ortega ◽  
Himar Fabelo ◽  
Raquel Leon ◽  
...  

Background: Sociodemographic data indicate the progressive increase in life expectancy and the prevalence of Alzheimer’s disease (AD). AD is raised as one of the greatest public health problems. Its etiology is twofold: on the one hand, non-modifiable factors and on the other, modifiable. Objective: This study aims to develop a processing framework based on machine learning (ML) and optimization algorithms to study sociodemographic, clinical, and analytical variables, selecting the best combination among them for an accurate discrimination between controls and subjects with major neurocognitive disorder (MNCD). Methods: This research is based on an observational-analytical design. Two research groups were established: MNCD group (n = 46) and control group (n = 38). ML and optimization algorithms were employed to automatically diagnose MNCD. Results: Twelve out of 37 variables were identified in the validation set as the most relevant for MNCD diagnosis. Sensitivity of 100%and specificity of 71%were achieved using a Random Forest classifier. Conclusion: ML is a potential tool for automatic prediction of MNCD which can be applied to relatively small preclinical and clinical data sets. These results can be interpreted to support the influence of the environment on the development of AD.


Author(s):  
Mohammad Farsi ◽  
Nima Mohamadian ◽  
Hamzeh Ghorbani ◽  
David A. Wood ◽  
Shadfar Davoodi ◽  
...  

2021 ◽  
pp. 2100225
Author(s):  
Tolou Pourashraf ◽  
Saeid Shokri ◽  
Mohammad Yousefi ◽  
Abbas Ahmadi ◽  
Parviz Aberoomand Azar

Author(s):  
Pedro J. S. Cardoso ◽  
Jânio Monteiro ◽  
Cristiano Cabrita ◽  
Jorge Semião ◽  
Dario Medina Cruz ◽  
...  

Energy consumption and, consequently, the associated costs (e.g., environmental and monetary) concern most individuals, companies, and institutions. Platforms for the monitoring, predicting, and optimizing energy consumption are an important asset that can contribute to the awareness about the ongoing usage levels, but also to an effective reduction of these levels. A solution is to leave the decisions to smart system, supported for instance in machine learning and optimization algorithms. This chapter involves those aspects and the related fields with emphasis in the prediction of energy consumption to optimize its usage policies.


2019 ◽  
Vol 141 (9) ◽  
Author(s):  
Daniel M. Probst ◽  
Mandhapati Raju ◽  
Peter K. Senecal ◽  
Janardhan Kodavasal ◽  
Pinaki Pal ◽  
...  

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.


2020 ◽  
Vol 108 (11) ◽  
pp. 2067-2082
Author(s):  
Huan Li ◽  
Cong Fang ◽  
Zhouchen Lin

Sign in / Sign up

Export Citation Format

Share Document