The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Unsupervised Learning
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
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
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
(1988) · Cited by 16,582
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Sequential Monte Carlo Methods in Practice
(2001) · Springer eBooks · doi:10.1007/978-1-4757-3437-9 · Cited by 7,366
Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
Kruskal, J. B. (1964) · Psychometrika · doi:10.1007/bf02289565 · Cited by 7,317
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Proceedings of the 25th international conference on Machine learning - ICML '08
(2008) · doi:10.1145/1390156 · Cited by 6,680
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
New extension of the Kalman filter to nonlinear systems
Julier, S. J., & Uhlmann, J. K. (1997) · SPIE Proceedings · doi:10.1117/12.280797 · Cited by 5,331
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Probability Theory: The Logic of Science
Jaynes, E. T. (2003) · doi:10.1017/cbo9780511790423 · Cited by 4,045
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Self-citationGood error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Probabilistic Principal Component Analysis
Tipping, M. E., & Bishop, C. M. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00196 · Cited by 3,679
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Advances in Neural Information Processing Systems 27 (NIPS 2014)
Zhong, M., Goddard, N., & Sutton, C. A. (2014) · Cited by 2,636
The Analysis of Proximities: Multidimensional Scaling with an Unknown Distance Function. I.
Shepard, R. N. (1962) · Psychometrika · doi:10.1007/bf02289630 · Cited by 2,550
(1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9 · Cited by 2,418
Monte Carlo Filter and Smoother for Non-Gaussian Nonlinear State Space Models
Kitagawa, G. (1996) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1996.10474692 · Cited by 2,404
Markov Chain Sampling Methods for Dirichlet Process Mixture Models
Neal, R. M. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474879 · Cited by 2,288
Bayesian Density Estimation and Inference Using Mixtures
Escobar, M. D., & West, M. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476550 · Cited by 2,255
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16
Storkey, A. (2004) · neural information processing systems · Cited by 2,085
Mixtures of Dirichlet Processes with Applications to Bayesian Nonparametric Problems
Antoniak, C. E. (1974) · The Annals of Statistics · doi:10.1214/aos/1176342871 · Cited by 1,972
The computational complexity of probabilistic inference using bayesian belief networks
Cooper, G. F. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90060-d · Cited by 1,937
Mixtures of Probabilistic Principal Component Analyzers
Tipping, M. E., & Bishop, C. M. (1999) · Neural Computation · doi:10.1162/089976699300016728 · Cited by 1,873
AN APPROACH TO TIME SERIES SMOOTHING AND FORECASTING USING THE EM ALGORITHM
Shumway, R. H., & Stoffer, D. S. (1982) · Journal of Time Series Analysis · doi:10.1111/j.1467-9892.1982.tb00349.x · Cited by 1,470
Journal of Computational and Graphical Statistics
Levine, R. A., Sampson, E., & Lee, T. C. M. (2014) · WIREs Computational Statistics · doi:10.1002/wics.1307 · Cited by 1,424
GTM: The Generative Topographic Mapping
Bishop, C. M., Svensén, M., & Williams, C. K. I. (1998) · Neural Computation · doi:10.1162/089976698300017953 · Cited by 1,388
Regularization Theory and Neural Networks Architectures
Girosi, F., Jones, M., & Poggio, T. (1995) · Neural Computation · doi:10.1162/neco.1995.7.2.219 · Cited by 1,349
Hastie, T., & Stuetzle, W. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478797 · Cited by 1,249
Complexity of Finding Embeddings in a k-Tree
Arnborg, S., Corneil, D. G., & Proskurowski, A. (1987) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0608024 · Cited by 1,206
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
Self-citationThe "Wake-Sleep" Algorithm for Unsupervised Neural Networks
Hinton, G. E., Dayan, P., Frey, B. J., & Neal, R. M. (1995) · Science · doi:10.1126/science.7761831 · Cited by 1,070
Mackay, D. J. C. (1995) · Network Computation in Neural Systems · doi:10.1088/0954-898x/6/3/011 · Cited by 915
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
A Unifying Review of Linear Gaussian Models
Roweis, S., & Ghahramani, Z. (1999) · Neural Computation · doi:10.1162/089976699300016674 · Cited by 869
Self-citationFriedman, N., & Koller, D. (2003) · Machine Learning · doi:10.1023/a:1020249912095 · Cited by 811
Semi-Supervised Learning on Riemannian Manifolds
Belkin, M., & Niyogi, P. (2004) · Machine Learning · doi:10.1023/b:mach.0000033120.25363.1e · Cited by 781
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
Weiss, Y., & Freeman, W. T. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910585 · Cited by 581
Connectionist learning of belief networks
Neal, R. M. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90065-6 · Cited by 513
Beal, M. J., & Ghahramani, Z. (2003) · Bayesian Statistics 7 · doi:10.1093/oso/9780198526155.003.0025 · Cited by 458
Self-citationCorrectness of Local Probability Propagation in Graphical Models with Loops
Weiss, Y. (2000) · Neural Computation · doi:10.1162/089976600300015880 · Cited by 452
Ferguson, T. S. (1983) · Recent Advances in Statistics · doi:10.1016/b978-0-12-589320-6.50018-6 · Cited by 383
Modeling the manifolds of images of handwritten digits
Hinton, G. E., Dayan, P., & Revow, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.554192 · Cited by 330
Variational methods for the Dirichlet process
Blei, D. M., & Jordan, M. I. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015439 · Cited by 179
Learning higher-order structures in natural images
Karklin, Y., & Lewicki, M. S. (2003) · Network Computation in Neural Systems · doi:10.1088/0954-898x/14/3/306 · Cited by 113
Cited by
Shen, C. (2018) · Water Resources Research · doi:10.1029/2018wr022643 · Cited by 1,133
Integrative Taxonomy: A Multisource Approach to Exploring Biodiversity
Schlick-Steiner, B. C., Steiner, F. M., Seifert, B., Stauffer, C., Christian, E., & Crozier, R. H. (2010) · Annual Review of Entomology · doi:10.1146/annurev-ento-112408-085432 · Cited by 1,080
Hierarchical Models in the Brain
Friston, K. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000211 · Cited by 952
Supervised Machine Learning for Population Genetics: A New Paradigm
Schrider, D. R., & Kern, A. D. (2018) · Trends in Genetics · doi:10.1016/j.tig.2017.12.005 · Cited by 453
Emerging Memristive Artificial Synapses and Neurons for Energy‐Efficient Neuromorphic Computing
Choi, S., Yang, J., & Wang, G. (2020) · Advanced Materials · doi:10.1002/adma.202004659 · Cited by 424
Metadata
- Authors
- Ghahramani, Z.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 72-112
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4242807147
- Cited by
- 346
- References
- 51
- FWCI
- 0.65
- Type
- conference paper
- 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
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.