Optimizationof neural network architecture using genetic programming improvesdetection and modeling of gene-gene interactions in studies of humandiseases
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
BACKGROUND: Appropriate definition of neural network architecture prior to data analysis is crucial for successful data mining. This can be challenging when the underlying model of the data is unknown. The goal of this study was to determine whether optimizing neural network architecture using genetic programming as a machine learning strategy would improve the ability of neural networks to model and detect nonlinear interactions among genes in studies of common human diseases. RESULTS: Using simulated data, we show that a genetic programming optimized neural network approach is able to model gene-gene interactions as well as a traditional back propagation neural network. Furthermore, the genetic programming optimized neural network is better than the traditional back propagation neural network approach in terms of predictive ability and power to detect gene-gene interactions when non-functional polymorphisms are present. CONCLUSION: This study suggests that a machine learning strategy for optimizing neural network architecture may be preferable to traditional trial-and-error approaches for the identification and characterization of gene-gene interactions in common, complex human diseases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340 · cited 1×
“The best solutions are selected for crossover and reproduction using a fitness-proportionate selection technique, called roulette wheel selection, based on the classification error of the training data [26].”
MethodAdaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
Sexton, R. S., Dorsey, R. E., & Johnson, J. D. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00114-3 · Cited by 235 · cited 1×
“For example, we would like to know whether using a local search algorithm, such as back propagation or simulated annealing [35], to refine the weights of a GPNN model is useful.”
Method
Cited by
Machine learning in bioinformatics
Larrañaga, P., Calvo, B., Santana, R., Bielza, C., Galdiano, J., Inza, I., Lozano, J. A., Armañanzas, R., Santafé, G., Pérez, A., et al. (2006) · Briefings in Bioinformatics · doi:10.1093/bib/bbk007 · Cited by 867
The Ubiquitous Nature of Epistasis in Determining Susceptibility to Common Human Diseases
Moore, J. H. (2003) · Human Heredity · doi:10.1159/000073735 · Cited by 717
Self-citationMoore, J. H., Gilbert, J. C., Tsai, C.-T., Chiang, F.-T., Holden, T., Barney, N., & White, B. C. (2006) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2005.11.036 · Cited by 608
Self-citationBioinformatics challenges for genome-wide association studies
Moore, J. H., Asselbergs, F. W., & Williams, S. M. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp713 · Cited by 534
Self-citationReview and meta-analysis of antidepressant pharmacogenetic findings in major depressive disorder
Kato, M., & Serretti, A. (2010) · Molecular Psychiatry · doi:10.1038/mp.2008.116 · Cited by 450
Metadata
- Authors
- Ritchie, M. D., White, B. C., Parker, J. S., Hahn, L. W., & Moore, J. H.
- Venue
- BMC Bioinformatics
- Published
- 2003-07-07
- Volume
- 4
- Issue
- 1
- Pages
- 28-28
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2009969871
- Cited by
- 224
- References
- 3
- FWCI
- 7.37
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.