The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Perceptron Trees: A Case Study in Hybrid Concept Representations
Abstract
This article presents a case study in examining the bias of two particular formalisms: decision trees and linear threshold units. The immediate result is a new hybrid representation, called a ‘perceptron tree’, and an associated learning algorithm called the ‘percepton tree error correction procedure’. The longer term result is a model for exploring issues related to understanding representational bias and constructing other useful hybrid representations.
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Cited by
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Murthy, S. K. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009744630224 · Cited by 991
Decision trees: An overview and their use in medicine
Podgorelec, V., Kokol, P., Stiglic, B., & Rozman, I. (2002) · Journal of Medical Systems · doi:10.1023/a:1016409317640 · Cited by 736
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Simplifying decision trees: A survey
BRESLOW, L. A., & AHA, D. W. (1997) · The Knowledge Engineering Review · doi:10.1017/s0269888997000015 · Cited by 337
Algorithm Selection for Combinatorial Search Problems: A Survey
Kotthoff, L. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-50137-6_7 · Cited by 270
Metadata
- Authors
- UTGOFF, P. E.
- Venue
- Connection Science
- Publisher
- Informa UK Limited
- Published
- 1989-01
- Volume
- 1
- Issue
- 4
- Pages
- 377-391
- ISSN
- 0954-0091 (ISSN-L)
- 1360-0494
- OpenAlex
- W18742335
- Cited by
- 179
- References
- 1
- FWCI
- 7.85
- 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: Perceptron Trees: A Case Study in Hybrid Concept Representations. https://app.cochat.ai/papers/10.1080/09540098908915648
- The paper
- UTGOFF, P. E. (1989). Perceptron Trees: A Case Study in Hybrid Concept Representations. Connection Science. https://doi.org/10.1080/09540098908915648
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.
