2018
DOI: 10.1007/978-3-319-78759-6_4
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Different Sampling Algorithms for Phenotype Prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
9
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
1

Relationship

6
1

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 16 publications
1
9
0
Order By: Relevance
“…ð Þ<E tol f g , is composed by the sets of high predictive networks with similar predictive accuracy; that is, those sets of genes g that classify the samples with a prediction error O g ð Þ lower than E tol . [6][7][8] As in any other inverse problem, the cost function topography in phenotype prediction problems is composed of several flat curvilinear valleys 20,21 where the genetic signatures are located, all of them with a similar predictive accuracy of the training set. Nevertheless, in the phenotype prediction problem, the size of the high discriminatory genetic signatures varies, that is, high discriminatory genetic networks of different complexity exist, and the optimization of O g ð Þ is not always performed in the same space dimension.…”
Section: Ai Genomics and The Phenotype Prediction Problemmentioning
confidence: 99%
See 3 more Smart Citations
“…ð Þ<E tol f g , is composed by the sets of high predictive networks with similar predictive accuracy; that is, those sets of genes g that classify the samples with a prediction error O g ð Þ lower than E tol . [6][7][8] As in any other inverse problem, the cost function topography in phenotype prediction problems is composed of several flat curvilinear valleys 20,21 where the genetic signatures are located, all of them with a similar predictive accuracy of the training set. Nevertheless, in the phenotype prediction problem, the size of the high discriminatory genetic signatures varies, that is, high discriminatory genetic networks of different complexity exist, and the optimization of O g ð Þ is not always performed in the same space dimension.…”
Section: Ai Genomics and The Phenotype Prediction Problemmentioning
confidence: 99%
“…[75][76][77] The important working hypothesis is that by sampling the uncertainty space of the phenotype prediction problems, we are able to understand the altered genetic pathways of the disease in order to use this knowledge in precision medicine for diagnosis, prognosis, and treatment optimization. Different interesting methods were proposed by Cernea et al 8 and successfully applied in the analysis of Triple Negative Breast Cancer metastasis, comparing the results obtained with Bayesian networks. 78 Bayesian networks are utilized to model the genetic signatures' distribution related to the phenotype prediction, P g=c obs À Á , according to Bayes' rule: [79][80][81] P g=c obs À Á , P g ð ÞP c obs =g À Á…”
Section: Ai Genomics and The Phenotype Prediction Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…The defective pathways are sampled via two different algorithms: Fisher’s ratio [4] and holdout [5] samplers. These algorithms have been used to unravel the altered pathways involved in the metastasis in triple negative breast cancer outperforming Bayesian networks [6]—and recently in Parkinson disease [7] —to provide new insights about the defective pathways which are involved. The problem addressed in this paper does not consist in just solving the classification problem involved in phenotype prediction, but in finding the genetic pathways that are involved in the genesis and development of this disease, which is hampered by the high degree of under-determinacy of these kind of problems.…”
Section: Introductionmentioning
confidence: 99%