Learning the Markov Order of Paths in Graphs-Reference-Cited by-同舟云学术

Learning the Markov Order of Paths in Graphs

Published:2022-04-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Web Conference 2022
language:
Short-container-title:

Author:

Petrovic Luka V.¹,Scholtes Ingo²

Affiliation:

1. Data Analytics Group, Department of Informatics, University of Zurich, Switzerland

2. Chair of Machine Learning for Complex Networks, Julius-Maximilians-Universität Würzburg, Germany and Data Analytics Group, Department of Informatics, University of Zurich, Switzerland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3485447.3512091

Reference52 articles.

1. A New Look at the Statistical Model Identification

2. Theodore W Anderson and Leo A Goodman. 1957. Statistical inference about Markov chains. The Annals of Mathematical Statistics(1957) 89–110. Theodore W Anderson and Leo A Goodman. 1957. Statistical inference about Markov chains. The Annals of Mathematical Statistics(1957) 89–110.

3. Anonymous. [n.d.]. Python implementation of Bayesian Multi-Order Networks. https://doi.org/10.5281/zenodo.4809434 10.5281/zenodo.4809434 Anonymous. [n.d.]. Python implementation of Bayesian Multi-Order Networks. https://doi.org/10.5281/zenodo.4809434

4. A workload characterization study of the 1998 World Cup Web site

5. Markov chain order estimation based on the chi-square divergence

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bayesian inference of transition matrices from incomplete graph data with a topological prior;EPJ Data Science;2023-10-11

2. Quantifying the ‘end of history’ through a Bayesian Markov-chain approach;Royal Society Open Science;2022-11