The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Opposition-Based Learning: A New Scheme for Machine Intelligence
Abstract
Opposition-based learning as a new scheme for machine intelligence is introduced. Estimates and counter-estimates, weights and opposite weights, and actions versus counter-actions are the foundation of this new approach. Examples are provided. Possibilities for extensions of existing learning algorithms are discussed. Preliminary results are provided
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
An Introduction to Genetic Algorithms
Mitchell, M. (1996) · doi:10.7551/mitpress/3927.001.0001 · Cited by 11,340
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Reinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,414
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
Fundamentals of neural networks: architectures, algorithms, and applications
Fausett, L. V. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,025
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
Neural Network Learning: Theoretical Foundations
Anthony, M., & Bartlett, P. L. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624216 · Cited by 598
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
Opposition-Based Differential Evolution
Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. A. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.894200 · Cited by 1,630
Self-citationA comprehensive survey: Whale Optimization Algorithm and its applications
Gharehchopogh, F. S., & Gholizadeh, H. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.03.004 · Cited by 758
Lion Optimization Algorithm (LOA): A nature-inspired metaheuristic algorithm
Yazdani, M., & Jolai, F. (2016) · Journal of Computational Design and Engineering · doi:10.1016/j.jcde.2015.06.003 · Cited by 626
Metadata
- Authors
- Tizhoosh, H. R.
- Venue
- International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06)
- Publisher
- IEEE
- Published
- 2006-05-25
- Volume
- 1
- Pages
- 695-701
- OpenAlex
- W2162745921
- Cited by
- 2,131
- References
- 10
- FWCI
- 15.37
- Type
- conference paper
- 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.