The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
The Statistical Analysis of General Processing Tree Models with the EM Algorithm
Abstract
Multinomial processing tree models assume that an observed behavior category can arise from one or more processing sequences represented as branches in a tree. These models form a subclass of parametric, multinomial models, and they provide a substantively motivated alternative to loglinear models. We consider the usual case where branch probabilities are products of nonnegative integer powers in the parameters, 0≤θ s≤1, and their complements, 1 - θ s. A version of the EM algorithm is constructed that has very strong properties. First, the E-step and the M-step are both analytic and computationally easy; therefore, a fast PC program can be constructed for obtaining MLEs for large numbers of parameters. Second, a closed form expression for the observed Fisher information matrix is obtained for the entire class. Third, it is proved that the algorithm necessarily converges to a local maximum, and this is a stronger result than for the exponential family as a whole. Fourth, we show how the algorithm can handle quite general hypothesis tests concerning restrictions on the model parameters. Fifth, we extend the algorithm to handle the Read and Cressie power divergence family of goodness-of-fit statistics. The paper includes an example to illustrate some of these results.
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
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
Statistical Analysis With Missing Data
Lahiff, M., Little, R. J. A., & Rubin, D. B. (1989) · Journal of the American Statistical Association · doi:10.2307/2289883 · Cited by 17,265
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Mayer, T. F., Lazarsfeld, P. F., & Henry, N. W. (1969) · American Sociological Review · doi:10.2307/2092222 · Cited by 2,384
Finding the Observed Information Matrix When Using the EM Algorithm
Louis, T. A. (1982) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1982.tb01203.x · Cited by 2,229
Statistical Analysis with Missing Data
Bo., N., Little, R. J. A., & Rubin, D. B. (1988) · Population (French Edition) · doi:10.2307/1533221 · Cited by 2,095
Johnson, M. K., & Raye, C. L. (1981) · Psychological Review · doi:10.1037//0033-295x.88.1.67 · Cited by 1,506
Weir, B. S. (1990) · Cited by 1,401
EFRON, B., & HINKLEY, D. V. (1978) · Biometrika · doi:10.1093/biomet/65.3.457 · Cited by 952
Research works printed but not linked: 10
- 10.1016/0022-2496(91)90029-S · doi:10.1016/0022-2496(91)90029-s
- Hu, 1990, Source monitoring program (Version 1.0)
- 10.1037/0033-295X.88.1.67 · doi:10.1037/0033-295x.88.1.67 · Paper page
- 10.1007/978-1-4613-9728-1_18 · doi:10.1007/978-1-4613-9728-1_18
- 10.1037/0033-295X.97.4.548 · doi:10.1037/0033-295x.97.4.548 · Paper page
- Batchelder, Mathematical psychology: New developments
- Bernstein, 1925, Zusammenfassende Betrachtungen über die erblichen Blutenstructuren des Menschen, Z. Abstamm. Vererbgsl., 37, 237
- Hu, 1991, General program for processing tree models (Version 1.0)
- 10.1037/0033-295X.95.3.318 · doi:10.1037/0033-295x.95.3.318 · Paper page
- Erdfelder, 1991, Bericht über den 37. Kongreß der Deutschen Gesellschaft für Psychologie in Kiel 1990, Band 2, 172
Cited by
(2013) · Cited by 1,351
Theoretical and empirical review of multinomial process tree modeling
Batchelder, W. H., & Riefer, D. M. (1999) · Psychonomic Bulletin & Review · doi:10.3758/bf03210812 · Cited by 619
Self-citationA Multinomial Model of Event-Based Prospective Memory.
Smith, R. E., & Bayen, U. J. (2004) · Journal of Experimental Psychology: Learning, Memory, and Cognition · doi:10.1037/0278-7393.30.4.756 · Cited by 404
multiTree: A computer program for the analysis of multinomial processing tree models
Moshagen, M. (2010) · Behavior Research Methods · doi:10.3758/brm.42.1.42 · Cited by 375
Source discrimination, item detection, and multinomial models of source monitoring.
Bayen, U. J., Murnane, K. S., & Erdfelder, E. (1996) · Journal of Experimental Psychology Learning Memory and Cognition · doi:10.1037//0278-7393.22.1.197 · Cited by 337
Metadata
- Authors
- Hu, X., & Batchelder, W. H.
- Venue
- Psychometrika
- Publisher
- Cambridge University Press (CUP)
- Published
- 1994-03
- Volume
- 59
- Issue
- 1
- Pages
- 21-47
- ISSN
- 0033-3123 (ISSN-L)
- 1860-0980
- OpenAlex
- W2081677860
- Cited by
- 288
- References
- 34
- FWCI
- 11.71
- 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: The Statistical Analysis of General Processing Tree Models with the EM Algorithm. https://app.cochat.ai/papers/10.1007/bf02294263
- The paper
- Hu, X., & Batchelder, W. H. (1994). The Statistical Analysis of General Processing Tree Models with the EM Algorithm. Psychometrika. https://doi.org/10.1007/bf02294263
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.