The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Identifiability of parameters in latent structure models with many observed variables
Open accessAbstract
While hidden class models of various types arise in many statistical applications, it is often difficult to establish the identifiability of their parameters. Focusing on models in which there is some structure of independence of some of the observed variables conditioned on hidden ones, we demonstrate a general approach for establishing identifiability utilizing algebraic arguments. A theorem of J. Kruskal for a simple latent-class model with finite state space lies at the core of our results, though we apply it to a diverse set of models. These include mixtures of both finite and nonparametric product distributions, hidden Markov models and random graph mixture models, and lead to a number of new results and improvements to old ones. In the parametric setting, this approach indicates that for such models, the classical definition of identifiability is typically too strong. Instead generic identifiability holds, which implies that the set of nonidentifiable parameters has measure zero, so that parameter inference is still meaningful. In particular, this sheds light on the properties of finite mixtures of Bernoulli products, which have been used for decades despite being known to have nonidentifiable parameters. In the nonparametric setting, we again obtain identifiability only when certain restrictions are placed on the distributions that are mixed, but we explicitly describe the conditions.
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
Cites
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736 · cited 1×
“Finite mixtures of products of finite measure are widely used to model data, for instance in biological taxonomy, medical diagnosis, or classification of text documents [21, 35].”
MethodExploratory latent structure analysis using both identifiable and unidentifiable models
GOODMAN, L. A. (1974) · Biometrika · doi:10.1093/biomet/61.2.215 · Cited by 1,637
Kruskal, J. B. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90069-6 · Cited by 1,619
Inference in Hidden Markov Models
Cappé, O., Moulines, E., & Rydén, T. (2005) · Springer Series in Statistics · doi:10.1007/0-387-28982-8 · Cited by 1,398
Estimation and Prediction for Stochastic Blockstructures
Nowicki, K., & Snijders, T. A. B. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753208735 · Cited by 1,148
Inference in Hidden Markov Models
Capp, O., Moulines, É., & Rydèn, T. (2010) · Springer eBooks · Cited by 1,112
Mixture Models: Theory, Geometry and Applications
Lindsay, B. G. (1995) · NSF-CBMS Regional Conference Series in Probability and Statistics · doi:10.1214/cbms/1462106013 · Cited by 1,084
Identification in Parametric Models
Rothenberg, T. J. (1971) · Econometrica · doi:10.2307/1913267 · Cited by 1,038
Ephraim, Y., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003838 · Cited by 798
Algebraic Statistics for Computational Biology
(2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610684 · Cited by 475
A mixture model for random graphs
Daudin, J.-J., Picard, F., & Robin, S. (2008) · Statistics and Computing · doi:10.1007/s11222-007-9046-7 · Cited by 475
Statistical Inference in Dynamic Economic Models
Allen, R. G. D., & Koopmans, T. C. (1950) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1401040 · Cited by 454
Maximum-likelihood estimation for hidden Markov models
Leroux, B. G. (1992) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(92)90141-c · Cited by 421
On the Identifiability of Finite Mixtures
Yakowitz, S. J., & Spragins, J. D. (1968) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177698520 · Cited by 401
The Identification of Structural Characteristics
Koopmans, T. C., & Reiersol, O. (1950) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729837 · Cited by 313
Nonparametric estimation of component distributions in a multivariate mixture
Hall, P., & Zhou, X.-H. (2003) · The Annals of Statistics · doi:10.1214/aos/1046294462 · Cited by 213
Probabilistic Functions of Finite State Markov Chains
Petrie, T. (1969) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697807 · Cited by 158
Kruskal, J. B. (1976) · Psychometrika · doi:10.1007/bf02293554 · Cited by 112
An EM-Like Algorithm for Semi- and Nonparametric Estimation in Multivariate Mixtures
Benaglia, T., Chauveau, D., & Hunter, D. R. (2009) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2009.07175 · Cited by 108
Fast online graph clustering via Erdős–Rényi mixture
Zanghi, H., Ambroise, C., & Miele, V. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.06.019 · Cited by 103
On the Identifiability Problem for Functions of Finite Markov Chains
Gilbert, E. J. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706199 · Cited by 97
Cluster Inference by Using Transitivity Indices in Empirical Graphs
Frank, O., & Harary, F. (1982) · Journal of the American Statistical Association · doi:10.1080/01621459.1982.10477895 · Cited by 88
The Identifiability of Tree Topology for Phylogenetic Models, Including Covarion and Mixture Models
Allman, E. S., & Rhodes, J. A. (2006) · Journal of Computational Biology · doi:10.1089/cmb.2006.13.1101 · Cited by 82
Self-citationNonparametric inference in multivariate mixtures
Hall, P. M., Neeman, A., Pakyari, R., & Elmore, R. (2005) · Biometrika · doi:10.1093/biomet/92.3.667 · Cited by 70
Almost Nonparametric Inference for Repeated Measures in Mixture Models
Hettmansperger, T. P., & Thomas, H. (2000) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/1467-9868.00266 · Cited by 53
Semiparametric Mixture Models and Repeated Measures: The Multinomial Cut Point Model
Cruz-Medina, I. R., Hettmansperger, T. P., & Thomas, H. (2004) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.1111/j.1467-9876.2004.05203.x · Cited by 30
Cited by
Tensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
“In these contexts, it is often also possible to establish strong identifiability results, without giving an explicit estimators, by invoking the non-constructive identifiability argument of Kruskal (1977)—see the article by Allman et al. (2009) for several examples.”
BackgroundCausal Inference by using Invariant Prediction: Identification and Confidence Intervals
Peters, J., Bühlmann, P., & Meinshausen, N. (2016) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12167 · Cited by 643
Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
Matias, C., & Miele, V. (2017) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12200 · Cited by 326
Self-citationA hybrid symbolic-numerical method for determining model structure
Choquet, R., & Cole, D. J. (2012) · Mathematical Biosciences · doi:10.1016/j.mbs.2012.02.002 · Cited by 37
Metadata
- Authors
- Allman, E. S., Matias, C., & Rhodes, J. A.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2009-12-01
- Volume
- 37
- Issue
- 6A
- Pages
- 3099-3132
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W1970935148
- Cited by
- 458
- References
- 28
- FWCI
- 14.10
- Type
- journal article
- Language
- en
- Open access
- bronze
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.