The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Search-Intensive Concept Induction
Abstract
This paper describes REGAL, a distributed genetic algorithm-based system, designed for learning first-order logic concept descriptions from examples. The system is a hybrid of the Pittsburgh and the Michigan approaches, as the population constitutes a redundant set of partial concept descriptions, each evolved separately. In order to increase effectiveness, REGAL is specifically tailored to the concept learning task; hence, REGAL is task-dependent, but, on the other hand, domain-independent. The system proved particularly robust with respect to parameter setting across a variety of different application domains. REGAL is based on a selection operator, called Universal Suffrage operator, provably allowing the population to asymptotically converge, on the average, to an equilibrium state in which several species coexist. The system is presented in both a serial and a parallel version, and a new distributed computational model is proposed and discussed. The system has been tested on a simple artificial domain for the sake of illustration, and on several complex real-world and artificial domains in order to show its power and to analyze its behavior under various conditions. The results obtained so far suggest that genetic search may be a valuable alternative to logic-based approaches to learning concepts, when no (or little) a priori knowledge is available and a very large hypothesis space has to be explored.
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
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Explanation-Based Generalization: A Unifying View
Mitchell, T. M., Keller, R. M., & Kedar-Cabelli, S. T. (1986) · Machine Learning · doi:10.1023/a:1022691120807 · Cited by 1,382
Cited by
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Potter, M. A., & Jong, K. A. D. (2000) · Evolutionary Computation · doi:10.1162/106365600568086 · Cited by 1,196
The use of computational intelligence in intrusion detection systems: A review
Wu, S. X., & Banzhaf, W. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2009.06.019 · Cited by 696
New Methods for Competitive Coevolution
Rosin, C. D., & Belew, R. K. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.1.1 · Cited by 578
Genetic fuzzy systems: taxonomy, current research trends and prospects
Herrera, F. (2008) · Evolutionary Intelligence · doi:10.1007/s12065-007-0001-5 · Cited by 569
A Survey of Evolutionary Algorithms for Data Mining and Knowledge Discovery
Freitas, A. A. (2003) · Natural Computing Series · doi:10.1007/978-3-642-18965-4_33 · Cited by 422
Metadata
- Authors
- Giordana, A., & Neri, F.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press
- Published
- 1995-12
- Volume
- 3
- Issue
- 4
- Pages
- 375-416
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W1970608725
- Cited by
- 188
- References
- 2
- FWCI
- 10.53
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Search-Intensive Concept Induction. https://app.cochat.ai/papers/10.1162/evco.1995.3.4.375
- The paper
- Giordana, A., & Neri, F. (1995). Search-Intensive Concept Induction. Evolutionary Computation. https://doi.org/10.1162/evco.1995.3.4.375
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.