The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A comparison of linear genetic programming and neural networks in medical data mining
Abstract
We introduce a new form of linear genetic programming (GP). Two methods of acceleration of our GP approach are discussed: 1) an efficient algorithm that eliminates intron code and 2) a demetic approach to virtually parallelize the system on a single processor. Acceleration of runtime is especially important when operating with complex data sets, because they are occurring in real-world applications. We compare GP performance on medical classification problems from a benchmark database with results obtained by neural networks. Our results show that GP performs comparably in classification and generalization.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Wright, S. (1943) · Genetics · doi:10.1093/genetics/28.2.114 · Cited by 5,479
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917
Artificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Schwefel, H. (1995) · Cited by 2,203
Watson, J. D. (1970) · Cold Spring Harbor Laboratory Institutional Repository (Cold Spring Harbor Laboratory) · Cited by 2,062
Kimura, M., & Weiss, G. H. (1964) · Genetics · doi:10.1093/genetics/49.4.561 · Cited by 1,709
Banzhaf, W., Francone, F. D., Keller, R. E., & Nordin, P. C. (1998) · Cited by 1,678
Self-citationApplication of artificial neural networks to clinical medicine
Baxt, W. G. (1995) · The Lancet · doi:10.1016/s0140-6736(95)91804-3 · Cited by 677
Cited by
A Survey on the Application of Genetic Programming to Classification
Espejo, P. G., Ventura, S., & Herrera, F. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2009.2033566 · Cited by 642
Hybrid genetic algorithm and a fuzzy logic classifier for heart disease diagnosis
Reddy, G. T., Reddy, M. P. K., Lakshmanna, K., Rajput, D. S., Kaluri, R., & Srivastava, G. (2020) · Evolutionary Intelligence · doi:10.1007/s12065-019-00327-1 · Cited by 404
RetractedSystematic Poisoning Attacks on and Defenses for Machine Learning in Healthcare
Mozaffari-Kermani, M., Sur-Kolay, S., Raghunathan, A., & Jha, N. K. (2015) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2014.2344095 · Cited by 383
A Comparison of Several Linear Genetic Programming Techniques
moltean@nessie.cs.ubbcluj.ro., E. M. A., Oltean, M., Groşan, C., & Electronic mail address: cgrosan@nessie.cs.ubbcluj.ro. Department of Computer Science, F. O. M. A. C. S. (2024) · Complex Systems · doi:10.25088/complexsystems.14.4.285 · Cited by 279
Metaheuristic Algorithms in Modeling and Optimization
Gandomi, A. H., Yang, X.-S., Talatahari, S., & Alavi, A. H. (2013) · Metaheuristic Applications in Structures and Infrastructures · doi:10.1016/b978-0-12-398364-0.00001-2 · Cited by 268
A robust data mining approach for formulation of geotechnical engineering systems
Hossein Alavi, A., & Hossein Gandomi, A. (2011) · Engineering Computations · doi:10.1108/02644401111118132 · Cited by 266
Evolution Through Large Models
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., & Stanley, K. O. (2024) · Genetic and Evolutionary Computation · doi:10.1007/978-981-99-3814-8_11 · Cited by 74
Evolution through Large Models
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., & Stanley, K. O. (2022) · arXiv · doi:10.48550/arxiv.2206.08896 · Cited by 74
Metadata
- Authors
- Brameier, M., & Banzhaf, W.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2001
- Volume
- 5
- Issue
- 1
- Pages
- 17-26
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2107899042
- Cited by
- 505
- References
- 22
- FWCI
- 18.78
- Type
- journal article
- Language
- en
- Open access
- closed
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.