The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
The max-min hill-climbing Bayesian network structure learning algorithm
Open accessAbstract
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and search-and-score techniques in a principled and effective way. It first reconstructs the skeleton of a Bayesian network and then performs a Bayesian-scoring greedy hill-climbing search to orient the edges. In our extensive empirical evaluation MMHC outperforms on average and in terms of various metrics several prototypical and state-of-the-art algorithms, namely the PC, Sparse Candidate, Three Phase Dependency Analysis, Optimal Reinsertion, Greedy Equivalence Search, and Greedy Search. These are the first empirical results simultaneously comparing most of the major Bayesian network algorithms against each other. MMHC offers certain theoretical advantages, specifically over the Sparse Candidate algorithm, corroborated by our experiments. MMHC and detailed results of our study are publicly available at http://www.dsl-lab.org/supplements/mmhc_paper/mmhc_index.html.
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
(1988) · Cited by 16,582
Causality: Models, Reasoning, and Inference
Pearl, J. (2009) · doi:10.1017/cbo9780511803161 · Cited by 11,653
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
CAUSALITY: MODELS, REASONING AND INFERENCE
Hitchcock, C. (2001) · The Philosophical Review · doi:10.1215/00318108-110-4-639 · Cited by 4,741
Spellman, P. T., Sherlock, G., Zhang, M. Q., Iyer, V. R., Anders, K., Eisen, M. B., Brown, P. O., Botstein, D., & Futcher, B. (1998) · Molecular Biology of the Cell · doi:10.1091/mbc.9.12.3273 · Cited by 4,722
Causation, 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
A Bayesian method for the induction of probabilistic networks from data
Cooper, G. F., & Herskovits, E. (1992) · Machine Learning · doi:10.1007/bf00994110 · Cited by 4,204
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
Probabilistic Reasoning in Intelligent Systems
(1988) · Elsevier eBooks · doi:10.1016/c2009-0-27609-4 · Cited by 3,321
Using Bayesian Networks to Analyze Expression Data
Friedman, N., Linial, M., Nachman, I., & Pe'er, D. (2000) · Journal of Computational Biology · doi:10.1089/106652700750050961 · Cited by 3,266
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1023/a:1022623210503 · Cited by 3,231
Learning Bayesian networks: The combination of knowledge and statistical data
Heckerman, D., Geiger, D., & Chickering, D. M. (1995) · Machine Learning · doi:10.1007/bf00994016 · Cited by 2,017
Probabilistic Networks and Expert Systems
(1999) · Information Science and Statistics · doi:10.1007/b97670 · Cited by 1,727
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100245 · Cited by 1,424
Smith, J. Q., Bernardo, J. M., Berger, J. O., Dawid, A. P., & Smith, A. F. M. (1993) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982740 · Cited by 1,097
Causality models, reasoning and inference
Pearl, J. (2000) · Cited by 1,040
Learning Bayesian networks is NP-complete
Chickering, D. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2404-4_12 · Cited by 1,001
Equivalence and Synthesis of Causal Models
Verma, T., & Pearl, J. (2022) · Probabilistic and Causal Inference · doi:10.1145/3501714.3501732 · Cited by 964
The theory of signal detectability
Peterson, W., Birdsall, T., & Fox, W. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057460 · Cited by 867
Learning 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
Beinlich, I. A., Suermondt, H. J., Chavez, R. M., & Cooper, G. F. (1989) · Lecture Notes in Medical Informatics · doi:10.1007/978-3-642-93437-7_28 · Cited by 724
(1991) · Cited by 563
(2012) · The Social History of Crime and Punishment in America: An Encyclopedia · doi:10.4135/9781452218427.n608 · Cited by 557
The Bayesian Structural EM Algorithm
Friedman, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7373 · Cited by 511
Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm
Friedman, N., Nachman, I., & Pe’er, D. (1999) · arXiv (Cornell University) · doi:10.13140/2.1.1125.2169 · Cited by 501
Exact Bayesian Structure Discovery in Bayesian Networks
Koivisto, M., & Sood, K. (2004) · Journal of Machine Learning Research · Cited by 500
Beal, M. J., & Ghahramani, Z. (2003) · Bayesian Statistics 7 · doi:10.1093/oso/9780198526155.003.0025 · Cited by 458
Algorithms for Large Scale Markov Blanket Discovery
Tsamardinos, I., Aliferis, C., & Statnikov, A. (2003) · Cited by 438
Self-citationAdvanced mean field methods: theory and practice
Opper, M., & Saad, D. (2001) · Cited by 385
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 Networks: Semantics and Expressiveness
(1990) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-88650-7.50011-1 · Cited by 357
Time and sample efficient discovery of Markov blankets and direct causal relations
Tsamardinos, I., Aliferis, C. F., & Statnikov, A. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956838 · Cited by 343
Self-citationRissanen, J. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01694.x · Cited by 339
Computation, Causation, and Discovery
(1999) · AAAI Press eBooks · doi:10.7551/mitpress/2006.001.0001 · Cited by 337
Learning equivalence classes of Bayesian network structures
Chickering, D. M. (1996) · Uncertainty in Artificial Intelligence · Cited by 325
Scalable Techniques for Mining Causal Structures
Silverstein, C., Brin, S., Motwani, R., & Ullman, J. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009891813863 · Cited by 319
HITON: a novel Markov Blanket algorithm for optimal variable selection.
Aliferis, C., Tsamardinos, I., & Statnikov, A. (2003) · Europe PMC (PubMed Central) · Cited by 315
Self-citationBayesian Network Induction via Local Neighborhoods
Margaritis, D., & Thrun, S. (1999) · Cited by 313
A Transformational Characterization of Equivalent Bayesian Network Structures
Chickering, D. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4938 · Cited by 296
The Mind's Arrows: Bayes Nets and Graphical Causal Models in Psychology
Glymour, C. (2001) · Cited by 281
The Mind's Arrows: Bayes Nets and Graphical Causal Models in Psychology
Glymour, C. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4638.001.0001 · Cited by 277
Towards Principled Feature Selection: Relevancy, Filters and Wrappers
Tsamardinos, I., & Aliferis, C. (2003) · Cited by 238
Self-citationLearning Bayesian Networks: Search Methods and Experimental Results
Chickering, M., Geiger, D., & Heckerman, D. E. (1995) · Cited by 211
Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets
Moore, A., & Lee, M. S. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.453 · Cited by 202
Strong Completeness and Faithfulness in Bayesian Networks
Meek, C. (2013) · arXiv · doi:10.48550/arxiv.1302.4973 · Cited by 194
Acid, S., & de Campos, L. M. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1061 · Cited by 168
Learning Bayesian networks with discrete variables from data
Spirtes, P., & Meek, C. (1995) · Cited by 162
Learning Bayesian Networks from Data: An Efficient Approach Based on Information Theory
Cheng, J., Bell, D., & Liu, W. (1999) · Cited by 153
Graphical Models: Selecting causal and statistical models
Meek, C. (2023) · Figshare · doi:10.1184/r1/22696393 · Cited by 135
Chapman, W. W., Fizman, M., Chapman, B. E., & Haug, P. J. (2001) · Journal of Biomedical Informatics · doi:10.1006/jbin.2001.1000 · Cited by 116
An Algorithm for the Construction of Bayesian Network Structures from Data
Singh, M., & Valtorta, M. (1993) · Uncertainty in Artificial Intelligence · doi:10.1016/b978-1-4832-1451-1.50036-6 · Cited by 107
Graphical Models and Variational Methods
Ghahramani, Z., & Beal, M. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/1100.003.0015 · Cited by 104
Acid, S., de Campos, L. M., Fernández-Luna, J. M., Rodríguez, S., Rodríguez, J. M. R., & Salcedo, J. L. (2004) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2003.11.002 · Cited by 90
On the Dirichlet Prior and Bayesian Regularization
Steck, H., & Jaakkola, T. (2002) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 84
Spirtes, P., Glymour, C., & Scheines, R. (2018) · KiltHub Repository · doi:10.1184/r1/6491090 · Cited by 79
Blocking Gibbs Sampling for Linkage Analysis in Large Pedigrees with Many Loops
Jensen, C. S., & Kong, A. (1999) · The American Journal of Human Genetics · doi:10.1086/302524 · Cited by 79
A hybrid methodology for learning belief networks: BENEDICT
Acid, S., & de Campos, L. M. (2001) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(01)00041-x · Cited by 57
Tractable learning of large Bayes net structures from sparse data
Goldenberg, A., & Moore, A. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015406 · Cited by 47
Andreassen, S., Jensen, F. V., Andersen, S. K., Falck, B., Kjærulff, U. B., Woldbye, M., Sørensen, A. R., Rosenfalck, A., & Jensen, F. (1989) · VBN Forskningsportal (Aalborg Universitet) · Cited by 46
A novel algorithm for scalable and accurate Bayesian network learning.
Brown, L. E., Tsamardinos, I., & Aliferis, C. (2004) · PubMed · Cited by 41
Self-citation
Cited by
Learning Bayesian Networks with the bnlearnR Package
Scutari, M. (2010) · Journal of Statistical Software · doi:10.18637/jss.v035.i03 · Cited by 1,733
RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method
Ahmadianfar, I., Heidari, A. A., Gandomi, A. H., Chu, X., & Chen, H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115079 · Cited by 1,115
Inferring causation from time series in Earth system sciences
Runge, J., Bathiany, S., Bollt, E., Camps-Valls, G., Coumou, D., Deyle, E., Glymour, C., Kretschmer, M., Mahecha, M. D., Muñoz-Marí, J., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-10105-3 · Cited by 984
Estimating high-dimensional directed acyclic graphs with the PC-algorithm
Kalisch, M., & Bühlmann, P. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0510436 · Cited by 591
Big data for cyber physical systems in industry 4.0: a survey
Xu, L. D., & Duan, L. (2019) · Enterprise Information Systems · doi:10.1080/17517575.2018.1442934 · Cited by 526
Metadata
- Authors
- Tsamardinos, I., Brown, L. E., & Aliferis, C. F.
- Venue
- Machine Learning
- Published
- 2006-03-28
- Volume
- 65
- Issue
- 1
- Pages
- 31-78
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2165190832
- Cited by
- 1,822
- References
- 65
- FWCI
- 33.68
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.