fitness evaluation
Recently Published Documents


TOTAL DOCUMENTS

279
(FIVE YEARS 88)

H-INDEX

18
(FIVE YEARS 3)

2022 ◽  
Vol 31 (1) ◽  
pp. 1-52
Author(s):  
Man Zhang ◽  
Andrea Arcuri

REST web services are widely popular in industry, and search techniques have been successfully used to automatically generate system-level test cases for those systems. In this article, we propose a novel mutation operator which is designed specifically for test generation at system-level, with a particular focus on REST APIs. In REST API testing, and often in system testing in general, an individual can have a long and complex chromosome. Furthermore, there are two specific issues: (1) fitness evaluation in system testing is highly costly compared with the number of objectives (e.g., testing targets) to optimize for; and (2) a large part of the genotype might have no impact on the phenotype of the individuals (e.g., input data that has no impact on the execution flow in the tested program). Due to these issues, it might be not suitable to apply a typical low mutation rate like 1/ n (where n is the number of genes in an individual), which would lead to mutating only one gene on average. Therefore, in this article, we propose an adaptive weight-based hypermutation, which is aware of the different characteristics of the mutated genes. We developed adaptive strategies that enable the selection and mutation of genes adaptively based on their fitness impact and mutation history throughout the search. To assess our novel proposed mutation operator, we implemented it in the EvoMaster tool, integrated in the MIO algorithm, and further conducted an empirical study with three artificial REST APIs and four real-world REST APIs. Results show that our novel mutation operator demonstrates noticeable improvements over the default MIO. It provides a significant improvement in performance for six out of the seven case studies, where the relative improvement is up to +12.09% for target coverage, +12.69% for line coverage, and +32.51% for branch coverage.


2022 ◽  
pp. 27-35
Author(s):  
Shelly K. Schmoller ◽  
Nathaniel P. Brooks ◽  
Daniel K. Resnick

Biosensors ◽  
2021 ◽  
Vol 12 (1) ◽  
pp. 15
Author(s):  
Wenhan Liu ◽  
Jiewei Ji ◽  
Sheng Chang ◽  
Hao Wang ◽  
Jin He ◽  
...  

Multi-branch Networks (MBNs) have been successfully applied to myocardial infarction (MI) diagnosis using 12-lead electrocardiograms. However, most existing MBNs share a fixed architecture. The absence of architecture optimization has become a significant obstacle to a more accurate diagnosis for these MBNs. In this paper, an evolving neural network named EvoMBN is proposed for MI diagnosis. It utilizes a genetic algorithm (GA) to automatically learn the optimal MBN architectures. A novel fixed-length encoding method is proposed to represent each architecture. In addition, the crossover, mutation, selection, and fitness evaluation of the GA are defined to ensure the architecture can be optimized through evolutional iterations. A novel Lead Squeeze and Excitation (LSE) block is designed to summarize features from all the branch networks. It consists of a fully-connected layer and an LSE mechanism that assigns weights to different leads. Five-fold inter-patient cross validation experiments on MI detection and localization are performed using the PTB diagnostic database. Moreover, the model architecture learned from the PTB database is transferred to the PTB-XL database without any changes. Compared with existing studies, our EvoMBN shows superior generalization and the efficiency of its flexible architecture is suitable for auxiliary MI diagnosis in real-world.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Wang Yan ◽  
Zang Jian-Cheng ◽  
Li Bi-Tao

The morbidity of obesity and related metabolic syndrome is on the rise, which may be related to the decrease of physical activity. Therefore, keeping energy balance is the basic premise to prevent multiple metabolic syndromes, and the research on the composition and application of energy consumption has become a hot spot. The combination of expectation-maximization algorithm and MapReduce computing model realizes the migration of traditional algorithm to “cloud computing” platform. The physical fitness evaluation algorithm based on collaborative filtering is constructed, and a gait tactile recognition algorithm is proposed by feature selection based on the MEMS sensor. Finally, the algorithm is tested, and a conclusion is drawn. This algorithm is effective in monitoring and recognizing human gait. With the increase of weightlessness characteristics, the sensitivity of detection remains unchanged, and the specificity will increase. In a word, it is scientific and effective. Thus, the reference for establishing the index system of tactile biomechanical parameters of adolescent gait and studying the low-cost and portable energy measurement method of multiparameter indexes is provided.


2021 ◽  
pp. 1-26
Author(s):  
Wenbin Pei ◽  
Bing Xue ◽  
Lin Shang ◽  
Mengjie Zhang

Abstract High-dimensional unbalanced classification is challenging because of the joint effects of high dimensionality and class imbalance. Genetic programming (GP) has the potential benefits for use in high-dimensional classification due to its built-in capability to select informative features. However, once data is not evenly distributed, GP tends to develop biased classifiers which achieve a high accuracy on the majority class but a low accuracy on the minority class. Unfortunately, the minority class is often at least as important as the majority class. It is of importance to investigate how GP can be effectively utilized for high-dimensional unbalanced classification. In this paper, to address the performance bias issue of GP, a new two-criterion fitness function is developed, which considers two criteria, i.e. the approximation of area under the curve (AUC) and the classification clarity (i.e. how well a program can separate two classes). The obtained values on the two criteria are combined in pairs, instead of summing them together. Furthermore, this paper designs a three-criterion tournament selection to effectively identify and select good programs to be used by genetic operators for generating better offspring during the evolutionary learning process. The experimental results show that the proposed method achieves better classification performance than other compared methods.


PLoS ONE ◽  
2021 ◽  
Vol 16 (12) ◽  
pp. e0259933
Author(s):  
Zsófia Nyerges-Bohák ◽  
Krisztina Nagy ◽  
László Rózsa ◽  
Péter Póti ◽  
Levente Kovács

Changes in heart rate and heart rate variabilty (HRV) were investigated in untrained (UT; starting their first racing season) and detrained (DT; with 1–3 years of race experience) racehorses before and after 14-week conventional training. HRV was measured at rest over 1 h between 9:00 and 10:00 AM on the usual rest day of the horses. The smallest worthwhile change (SWC) rate was calculated for all HRV parameters. UT horses had significantly higher heart rate compared to DT (P<0.001). There were no gender- or training-related differences in heart rate. The root-mean-square of successive differences (rMSSD) in the consecutive inter-beat-intervals obtained after the 14-week training period was lower compared to pre-training rMSSD (P<0.001). The rMSSD was not influenced by breed, age or gender. In DT horses, there was a significant decrease in the high frequency (HF) component of HRV (P≤0.05) as the result of the 14-week training. These results may reflect saturation of high-frequency oscillations of inter-beat intervals rather than the reduction in parasympathetic influence on the heart. The HF did not differ significantly between the two measurements in UT horses; however, 16.6% of the animals showed a decrease in HF below SWC (P≤0.05). This supports the likelihood of parasympathetic saturation. Although no significant decrease in heart rate was found for the post-training, 30.0% of DT and 58.3% of UT horses still showed a decrease in heart rate below the SWC. Also by individual examination, it was also visible that despite significant post-training decrease in rMSSD, 1 (4.6%) DT and 2 (6.7%) UT horses reached SWC increase in rMMSD. In the case of these horses, the possibility of maladaptation should be considered. The present results indicate that similar to as found in human athletes, cardiac ANS status of racehorses also changes during the physiological adaptation to training. To explore more precise links between HRV and training effectiveness in horses, a more frequent recording would be necessary. Detailed analysis of HRV parameters based on SWC will be able to highlight the importance of fitness evaluation at individual level.


2021 ◽  
Author(s):  
◽  
Alan David Kinzett

<p>In tree-based genetic programming (GP) there is a tendency for the program trees to increase in size from one generation to the next. If this increase in program size is not accompanied by an improvement in fitness then this unproductive increase is known as bloat. It is standard practice to place some form of control on program size. This can be done by limiting the number of nodes or the depth of the program trees, or by adding a component to the fitness function that rewards smaller programs (parsimony pressure) or by simplifying individual programs using algebraic methods. This thesis proposes a novel program simplification method called numerical simplification that uses only the range of values the nodes take during fitness evaluation. The effect of online program simplification, both algebraic and numerical, on program size and resource usage is examined. This thesis also examines the distribution of program fragments within a genetic programming population and how this is changed by using simplification. It is shown that both simplification approaches result in reductions in average program size, memory used and computation time and that numerical simplification performs at least as well as algebraic simplification, and in some cases will outperform algebraic simplification. This reduction in program size and the resources required to process the GP run come without any significant reduction in accuracy. It is also shown that although the two online simplification methods destroy some existing program fragments, they generate new fragments during evolution, which compensates for any negative effects from the disruption of existing fragments. It is also shown that, after the first few generations, the rate new fragments are created, the rate fragments are lost from the population, and the number of distinct (different) fragments in the population remain within a very narrow range of values for the remainder of the run.</p>


2021 ◽  
Author(s):  
◽  
Alan David Kinzett

<p>In tree-based genetic programming (GP) there is a tendency for the program trees to increase in size from one generation to the next. If this increase in program size is not accompanied by an improvement in fitness then this unproductive increase is known as bloat. It is standard practice to place some form of control on program size. This can be done by limiting the number of nodes or the depth of the program trees, or by adding a component to the fitness function that rewards smaller programs (parsimony pressure) or by simplifying individual programs using algebraic methods. This thesis proposes a novel program simplification method called numerical simplification that uses only the range of values the nodes take during fitness evaluation. The effect of online program simplification, both algebraic and numerical, on program size and resource usage is examined. This thesis also examines the distribution of program fragments within a genetic programming population and how this is changed by using simplification. It is shown that both simplification approaches result in reductions in average program size, memory used and computation time and that numerical simplification performs at least as well as algebraic simplification, and in some cases will outperform algebraic simplification. This reduction in program size and the resources required to process the GP run come without any significant reduction in accuracy. It is also shown that although the two online simplification methods destroy some existing program fragments, they generate new fragments during evolution, which compensates for any negative effects from the disruption of existing fragments. It is also shown that, after the first few generations, the rate new fragments are created, the rate fragments are lost from the population, and the number of distinct (different) fragments in the population remain within a very narrow range of values for the remainder of the run.</p>


2021 ◽  
Author(s):  
◽  
Huayang Xie

<p>This thesis presents an analysis of the selection process in tree-based Genetic Programming (GP), covering the optimisation of both parent and offspring selection, and provides a detailed understanding of selection and guidance on how to improve GP search effectively and efficiently. The first part of the thesis providesmodels and visualisations to analyse selection behaviour in standard tournament selection, clarifies several issues in standard tournament selection, and presents a novel solution to automatically and dynamically optimise parent selection pressure. The fitness evaluation cost of parent selection is then addressed and some cost-saving algorithms introduced. In addition, the feasibility of using good predecessor programs to increase parent selection efficiency is analysed. The second part of the thesis analyses the impact of offspring selection pressure on the overall GP search performance. The fitness evaluation cost of offspring selection is then addressed, with investigation of some heuristics to efficiently locate good offspring by constraining crossover point selection structurally through the analysis of the characteristics of good crossover events. The main outcomes of the thesis are three new algorithms and four observations: 1) a clustering tournament selection method is developed to automatically and dynamically tune parent selection pressure; 2) a passive evaluation algorithm is introduced for reducing parent fitness evaluation cost for standard tournament selection using small tournament sizes; 3) a heuristic population clustering algorithm is developed to reduce parent fitness evaluation cost while taking advantage of clustering tournament selection and avoiding the tournament size limitation; 4) population size has little impact on parent selection pressure thus the tournament size configuration is independent of population size; and different sampling replacement strategies have little impact on the selection behaviour in standard tournament selection; 5) premature convergence occurs more often when stochastic elements are removed from both parent and offspring selection processes; 6) good crossover events have a strong preference for whole program trees, and (less strongly) single-node or small subtrees that are at the bottom of parent program trees; 7) the ability of standard GP crossover to generate good offspring is far below what was expected.</p>


Sign in / Sign up

Export Citation Format

Share Document