The DOI matches its Crossref record.
Iterative Reclassification Procedure for Constructing an Asymptotically Optimal Rule of Allocation in Discriminant Analysis
Abstract
The construction of a suitable rule of allocation in the two-population discrimination problem is considered in the case where there are initially available from the populations II1, II2, n 1, n 2 observations and M unclassified observations. An iterative reclassification procedure based on the n 1 + n 3 + M observations is proposed and found asymptotically optimal when M → ∞ and n 1 and n 2 are moderately large. The case of finite M is evaluated by a Monte Carlo experiment which suggests that the proposed procedure, after only one iteration, gives a rule with smaller average risk than the usual rule based on just the n 1 + n 2 classified observations.
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
Cited by
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
“McClachlan (1975) has given a procedure for using unclassified observations in discriminant analysis to help estimate the discriminant function.”
MethodMcLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Self-citation(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence
Sohn, K., Berthelot, D., Li, C.-L., Zhang, Z., Carlini, N., Cubuk, E. D., Kurakin, A., Zhang, H., & Raffel, C. (2020) · arXiv · doi:10.48550/arxiv.2001.07685 · Cited by 2,892
“Pseudo-labeling leverages the idea of using the model itself to obtain artificial labels for unlabeled data [32, 47].”
BackgroundRealistic Evaluation of Deep Semi-Supervised Learning Algorithms
Oliver, A., Odena, A., Raffel, C., Cubuk, E. D., & Goodfellow, I. J. (2018) · arXiv · doi:10.48550/arxiv.1804.09170 · Cited by 772
Metadata
- Authors
- McLachlan, G. J.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 1975-06
- Volume
- 70
- Issue
- 350
- Pages
- 365-369
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W1975165783
- Cited by
- 167
- References
- 0
- FWCI
- 4.72
- 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: Iterative Reclassification Procedure for Constructing an Asymptotically Optimal Rule of Allocation in Discriminant Analysis. https://app.cochat.ai/papers/10.1080/01621459.1975.10479874
- The paper
- McLachlan, G. J. (1975). Iterative Reclassification Procedure for Constructing an Asymptotically Optimal Rule of Allocation in Discriminant Analysis. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.1975.10479874
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.