Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence 2019
DOI: 10.24963/ijcai.2019/931
|View full text |Cite
|
Sign up to set email alerts
|

OpenMarkov, an Open-Source Tool for Probabilistic Graphical Models

Abstract: OpenMarkov is a Java open-source tool for creating and evaluating probabilistic graphical models, including Bayesian networks, influence diagrams, and some Markov models. With more than 100,000 lines of code, it offers some features for interactive learning, explanation of reasoning, and cost-effectiveness analysis, which are not available in any other tool. OpenMarkov has been used at universities, research centers, and large companies in more than 30 countries on four continents. Several models, some of the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 6 publications
0
4
0
1
Order By: Relevance
“…Further, these algorithms usually perform as black boxes, and it is difficult to determine to what degree those links are really supported by the data. Recently, Bermejo et al proposed an interactive learning technique which is implemented in OpenMarkov software. This technique suggests a list of changes to improve the accuracy of the network but also allows an expert to intervene and select only those that make sense according to their domain knowledge. To extract the BN, we used the search and score method based on the K2 algorithm, , which is a greedy search technique with the following scoring metric where Đ is the data set of N samples each consisting of n variables; P ß( S ) ( Đ ) is the marginal likelihood of a specific network structure S given a data set of samples; N ij is the number of samples in the data set that have the j th value combination for the parents of the i th variable; and likewise N ijk is the number of samples with the i th variable in its k th states and its parents in their j th configuration.…”
Section: Machine Learning Methodsmentioning
confidence: 99%
“…Further, these algorithms usually perform as black boxes, and it is difficult to determine to what degree those links are really supported by the data. Recently, Bermejo et al proposed an interactive learning technique which is implemented in OpenMarkov software. This technique suggests a list of changes to improve the accuracy of the network but also allows an expert to intervene and select only those that make sense according to their domain knowledge. To extract the BN, we used the search and score method based on the K2 algorithm, , which is a greedy search technique with the following scoring metric where Đ is the data set of N samples each consisting of n variables; P ß( S ) ( Đ ) is the marginal likelihood of a specific network structure S given a data set of samples; N ij is the number of samples in the data set that have the j th value combination for the parents of the i th variable; and likewise N ijk is the number of samples with the i th variable in its k th states and its parents in their j th configuration.…”
Section: Machine Learning Methodsmentioning
confidence: 99%
“…Se realizó un análisis estadístico mediante los programas IBM SPSS Statistics 22 y OpenMarkov (Arias et al, 2019), así como una herramienta de código abierto y desarrollada por el Centro de Investigación sobre Sistemas Inteligentes de la UNED. En primer lugar, se efectuó un estudio descriptivo de las puntuaciones medias y un estudio correlacional en el que se analizó la fuerza de la relación entre las cinco primeras preguntas del cuestionario y la competencia digital y los tipos de formación realizada.…”
Section: Procedimiento De Recogida Y Análisis De Datosunclassified
“…The table EU can be calculated with OpenMarkov (Arias and Díez, 2008;Arias et al, 2019;Díez et al, 2022), an open-source tool for probabilistic graphical models available at www.openmarkov.org. For these computations OpenMarkov only needs as input the ID model, including the graph (nodes and edges) and the numerical parameters.…”
Section: Computation Of the Expected Utility Tablementioning
confidence: 99%