Density Estimation with Genetic Programming for Inverse Problem Solving

Platel, Michael Defoin; Vérel, Sebástien; Clergue, Manuel; Chami, Malik

doi:10.1007/978-3-540-71605-1_5

Cited by 4 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the multi-branch GP approach, each individual is composed of several branches and each branch is responsible for evolving a part of the solution [143,190]. The final solution is integrating all these partial solutions through a special node which represents the root node [28,190]. The number of children of the special node is equal to the number of maps to be aligned.…”

Section: Gp Multi-branch Regression For Multiple Alignmentmentioning

confidence: 99%

Genetic Programming for Biomarker Detection in Classification of Mass Spectrometry Data

Ahmed¹

View full text Add to dashboard Cite

<p>Mass spectrometry (MS) is currently the most commonly used technology in biochemical research for proteomic analysis. The primary goal of proteomic profiling using mass spectrometry is the classification of samples from different experimental states. To classify the MS samples, the identification of protein or peptides (biomarker detection) that are expressed differently between the classes, is required. However, due to the high dimensionality of the data and the small number of samples, classification of MS data is extremely challenging. Another important aspect of biomarker detection is the verification of the detected biomarker that acts as an intermediate step before passing these biomarkers to the experimental validation stage. Biomarker detection aims at altering the input space of the learning algorithm for improving classification of proteomic or metabolomic data. This task is performed through feature manipulation. Feature manipulation consists of three aspects: feature ranking, feature selection, and feature construction. Genetic programming (GP) is an evolutionary computation algorithm that has the intrinsic capability for the three aspects of feature manipulation. The ability of GP for feature manipulation in proteomic biomarker discovery has not been fully investigated. This thesis, therefore, proposes an embedded methodology for these three aspects of feature manipulation in high dimensional MS data using GP. The thesis also presents a method for biomarker verification, using GP. The thesis investigates the use of GP for both single-objective and multi-objective feature selection and construction. In feature ranking, the thesis proposes a GP-based method for ranking subsets of features by using GP as an ensemble approach. The proposed algorithm uses GP capability to combine the advantages of different feature ranking metrics and evolve a new ranking scheme for the subset of the features selected from the top ranked features. The capability of GP as a classifier is also investigated by this method. The results show that GP can select a smaller number of features and provide a better ranking of the selected features, which can improve the classification performance of five classifiers. In feature construction, this thesis proposes a novel multiple feature construction method, which uses a single GP tree to generate a new set of high-level features from the original set of selected features. The results show that the proposed new algorithm outperforms two feature selection algorithms. In feature selection, the thesis introduces the first GP multi-objective method for biomarker detection, which simultaneously increase the classification accuracy and reduce the number of detected features. The proposed multi-objective method can obtain better subsets of features than the single-objective algorithm and two traditional multi-objective approaches for feature selection. This thesis also develops the first multi-objective multiple feature construction algorithm for MS data. The proposed method aims at both maximising the classification performance and minimizing the cardinality of the constructed new high-level features. The results show that GP can dis- cover the complex relationships between the features and can significantly improve classification performance and reduce the cardinality. For biomarker verification, the thesis proposes the first GP biomarker verification method through measuring the peptide detectability. The method solves the imbalance problem in the data and shows improvement over the benchmark algorithms. Also, the algorithm outperforms a well-known peptide detection method. The thesis also introduces a new GP method for alignment of MS data as a preprocessing stage, which will further help in improving the biomarker detection process.</p>

show abstract

Section: Gp Multi-branch Regression For Multiple Alignmentmentioning

confidence: 99%

Genetic Programming for Biomarker Detection in Classification of Mass Spectrometry Data

Ahmed¹

View full text Add to dashboard Cite

show abstract

Genetic Programming Theory and Practice VIII

Riolo¹,

McConaghy²,

Vladislavleva³

2011

Genetic and Evolutionary Computation

View full text Add to dashboard Cite

Symbolic Density Models of One-in-a-Billion Statistical Tails via Importance Sampling and Genetic Programming

McConaghy¹

2010

Genetic Programming Theory and Practice VIII

View full text Add to dashboard Cite

This paper explores the application of symbolic regression for building models of probability distributions in which the accuracy at the distributions' tails is critical. The problem is of importance to cutting-edge industrial integrated circuit design, such as designing SRAM memory components (bitcells, sense amps) where each component has extremely low probability of failure. A naive approach is infeasible because it would require billions of Monte Carlo circuit simulations. This paper demonstrates a flow that efficiently generates samples at the tails using importance sampling, then builds genetic programming symbolic regression models in a space that captures the tails -the normal quantile space. These symbolic density models allow the circuit designers to analyze the tradeoff between high-sigma yields and circuit performance. The flow is validated on two modern industrial problems: a bitcell circuit on a 45nm TSMC process, and a sense amp circuit on a 28nm TSMC process.

show abstract

Density Estimation with Genetic Programming for Inverse Problem Solving

Cited by 4 publications

References 11 publications

Genetic Programming for Biomarker Detection in Classification of Mass Spectrometry Data

Genetic Programming for Biomarker Detection in Classification of Mass Spectrometry Data

Genetic Programming Theory and Practice VIII

Symbolic Density Models of One-in-a-Billion Statistical Tails via Importance Sampling and Genetic Programming

Contact Info

Product

Resources

About