The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Adaptive Probabilistic Networks with Hidden Variables
Open accessOverview
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
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
(1988) · Cited by 16,582
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Backpropagation through time: what it does and how to do it
Werbos, P. J. (1990) · Proceedings of the IEEE · doi:10.1109/5.58337 · Cited by 4,879
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742 · cited 1×
“done—see Heckerman (1995, Section 6), Friedman, Geiger and Goldszmidt (1997) , and the references therein.”
BackgroundCausation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
Cited by
Friedman, N., Geiger, D., & Goldszmidt, M. (1997) · Machine Learning · doi:10.1023/a:1007465528199 · Cited by 4,742
“Moreover, to evaluate the optimal choice of parameters for a candidate network structure, we must perform nonlinear optimization using either EM (Lauritzen, 1995) or gradient descent (Binder et al., 1997).”
MethodThe max-min hill-climbing Bayesian network structure learning algorithm
Tsamardinos, I., Brown, L. E., & Aliferis, C. F. (2006) · Machine Learning · doi:10.1007/s10994-006-6889-7 · Cited by 1,822
Learning the Structure of Dynamic Probabilistic Networks
Friedman, N., Murphy, K., & Russell, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7374 · Cited by 561
Self-citationThe Bayesian Structural EM Algorithm
Friedman, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7373 · Cited by 511
Policy search for motor primitives in robotics
Kober, J., & Peters, J. (2011) · Machine Learning · doi:10.1007/s10994-010-5223-6 · Cited by 427
Mechanistic models versus machine learning, a fight worth fighting for the biological community?
Baker, R. E., Peña, J.-M., Jayamohan, J., & Jérusalem, A. (2018) · Biology Letters · doi:10.1098/rsbl.2017.0660 · Cited by 378
Storyline approach to the construction of regional climate change information
Shepherd, T. G. (2019) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2019.0013 · Cited by 331
Saisan, P., Doretto, G., Wu, Y. N., & Soatto, S. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990925 · Cited by 328
Learning Bayesian networks: approaches and issues
Daly, R., Shen, Q., & Aitken, S. (2011) · The Knowledge Engineering Review · doi:10.1017/s0269888910000251 · Cited by 319
Layered representations for learning and inferring office activity from multiple sensory channels
Oliver, N., Garg, A., & Horvitz, E. (2004) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2004.02.004 · Cited by 316
de Campos, L. M. (2006) · doi:10.5555/1248547.1248624 · Cited by 308
Learning agents for uncertain environments (extended abstract)
Russell, S. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279964 · Cited by 297
Self-citationVideo-based event recognition: activity representation and probabilistic recognition methods
Hongeng, S., Nevatia, R., & Bremond, F. (2004) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2004.02.005 · Cited by 287
Identifying significant edges in graphical models of molecular networks
Scutari, M., & Nagarajan, R. (2013) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2012.12.006 · Cited by 271
Discovering study-specific gene regulatory networks
Bo, V., Curtis, T., Lysenko, A., Saqi, M., Swift, S., & Tucker, A. (2014) · PLoS ONE · doi:10.1371/journal.pone.0106524 · Cited by 10
“We select the networks: Alarm [34], Insurance [35] and Child [36] with 37, 27 and 20 nodes respectively.”
Method
Metadata
- Authors
- Binder, J., Koller, D., Russell, S., & Kanazawa, K.
- Venue
- Machine Learning
- Published
- 1997-11
- Volume
- 29
- Issue
- 2-3
- Pages
- 213-244
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1801737117
- Cited by
- 377
- References
- 56
- FWCI
- 10.46
- 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.