The DOI matches its Crossref record; 89 of the 89 references it cites were found in a registry or an index.
Operations for Learning with Graphical Models
Open accessAbstract
This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian networks, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, andthe manipulation of probability models from the exponential family. Two standard algorithm schemas for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximizationalgorithm. Using these operations and schemas, some popular algorithms can be synthesized from their graphical specification. This includes versions of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing how some popular algorithms fall within the framework presented. The main original contributions here are the decompositiontechniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.
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
(1992) · Cited by 23,431
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
(2005) · Statistics for Biology and Health · doi:10.1007/0-387-27255-0_9 · Cited by 20,133
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
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
McCullagh, P., & Nelder, J. A. (1989) · doi:10.1007/978-1-4899-3242-6 · Cited by 16,836
(1988) · Cited by 16,582
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Statistical Decision Theory and Bayesian Analysis
Berger, J. O. (1985) · Springer Series in Statistics · doi:10.1007/978-1-4757-4286-2 · Cited by 7,722
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Estimating Continuous Distributions in Bayesian Classifiers
John, G. H., & Langley, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4964 · Cited by 2,885
Link prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
A Bayesian computer vision system for modeling human interactions
Oliver, N. M., Rosario, B., & Pentland, A. P. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868684 · Cited by 1,578
Inferring Cellular Networks Using Probabilistic Graphical Models
Friedman, N. (2004) · Science · doi:10.1126/science.1094068 · Cited by 1,202
Steyvers, M., & Griffiths, T. (2015) · Handbook of Latent Semantic Analysis · doi:10.4324/9780203936399.ch21 · Cited by 1,011
Hands-On Bayesian Neural Networks—A Tutorial for Deep Learning Users
Jospin, L. V., Laga, H., Boussaid, F., Buntine, W., & Bennamoun, M. (2022) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2022.3155327 · Cited by 879
Self-citationLearning Bayesian networks from data: An information-theory based approach
Cheng, J., Greiner, R., Kelly, J., Bell, D., & Liu, W. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00191-1 · Cited by 803
Bayesian Networks for Data Mining
Heckerman, D. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009730122752 · Cited by 630
Probabilistic author-topic models for information discovery
Steyvers, M., Smyth, P., Rosen-Zvi, M., & Griffiths, T. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014087 · Cited by 572
A general framework for adaptive processing of data structures
Frasconi, P., Gori, M., & Sperduti, A. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.712151 · Cited by 471
A guide to the literature on learning probabilistic networks from data
Buntine, W. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.494161 · Cited by 468
Self-citationScientific collaboration and endorsement: Network analysis of coauthorship and citation networks
Ding, Y. (2011) · Journal of Informetrics · doi:10.1016/j.joi.2010.10.008 · Cited by 438
A characterization of Markov equivalence classes for acyclic digraphs
Andersson, S. A., Madigan, D., & Perlman, M. D. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833662 · Cited by 425
Artificial intelligence: foundations of computational agents
(2010) · Choice Reviews Online · doi:10.5860/choice.48-2130 · Cited by 415
Full-Text or Abstract? Examining Topic Coherence Scores Using Latent Dirichlet Allocation
Syed, S., & Spruit, M. (2017) · 2017 IEEE International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa.2017.61 · Cited by 400
Adaptive Probabilistic Networks with Hidden Variables
Binder, J., Koller, D., Russell, S., & Kanazawa, K. (1997) · Machine Learning · doi:10.1023/a:1007421730016 · Cited by 377
Causal independence for probability assessment and inference using Bayesian networks
Heckerman, D., & Breese, J. S. (1996) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.541341 · Cited by 358
Cozman, F. G. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00029-1 · Cited by 339
Learning With Bayesian Networks
Heckerman, D. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50079-7 · Cited by 335
Mean Field Theory for Sigmoid Belief Networks
Saul, L. K., Jaakkola, T., & Jordan, M. I. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.251 · Cited by 327
Learning Bayesian networks: approaches and issues
Daly, R., Shen, Q., & Aitken, S. (2011) · The Knowledge Engineering Review · doi:10.1017/s0269888910000251 · Cited by 319
Markov Logic: An Interface Layer for Artificial Intelligence
Domingos, P., & Lowd, D. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00206ed1v01y200907aim007 · Cited by 314
Efficient Approximations for the Marginal Likelihood of Bayesian Networks with Hidden Variables
Maxwell Chickering, D., & Heckerman, D. (1997) · Machine Learning · doi:10.1023/a:1007469629108 · Cited by 292
Probabilistic Independence Networks for Hidden Markov Probability Models
Smyth, P., Heckerman, D., & Jordan, M. I. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.227 · Cited by 257
A probabilistic framework for modeling and real-time monitoring human fatigue
Ji, Q., Lan, P., & Looney, C. (2006) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2005.855922 · Cited by 245
ILP turns 20: Biography and future challenges
Muggleton, S., De Raedt, L., Poole, D., Bratko, I., Flach, P., Inoue, K., & Srinivasan, A. (2012) · Machine Learning · doi:10.1007/s10994-011-5259-2 · Cited by 126
Graphical Models of Residue Coupling in Protein Families
Thomas, J., Ramakrishnan, N., & Bailey-Kellogg, C. (2008) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.70225 · Cited by 77
Identifying biological concepts from a protein-related corpus with a probabilistic topic model
Zheng, B., McLean, D. C., & Lu, X. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-58 · Cited by 68
Quantitative pharmacophore models with inductive logic programming
Srinivasan, A., Page, D., Camacho, R., & King, R. (2006) · Machine Learning · doi:10.1007/s10994-006-8262-2 · Cited by 15
Metadata
- Authors
- Buntine, W. L.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 1994-12-01
- Volume
- 2
- Pages
- 159-225
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W1669437150
- Cited by
- 530
- References
- 89
- FWCI
- 21.39
- Type
- journal article
- Language
- en
- Open access
- diamond
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.