Package: jti 1.0.0
Mads Lindskou
jti: Junction Tree Inference
Minimal and memory efficient implementation of the junction tree algorithm using the Lauritzen-Spiegelhalter scheme; S. L. Lauritzen and D. J. Spiegelhalter (1988) <https://www.jstor.org/stable/2345762?seq=1>. The jti package is part of the paper <doi:10.18637/jss.v111.i02>.
Authors:
jti_1.0.0.tar.gz
jti_1.0.0.tar.gz(r-4.5-noble)jti_1.0.0.tar.gz(r-4.4-noble)
jti_1.0.0.tgz(r-4.4-emscripten)jti_1.0.0.tgz(r-4.3-emscripten)
jti.pdf |jti.html✨
jti/json (API)
NEWS
| # Install 'jti' in R: |
| install.packages('jti', repos = c('https://cran.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/mlindsk/jti/issues
Last updated 2 days agofrom:403983ea60. Checks:OK: 2. Indexed: no.
| Target | Result | Date |
|---|---|---|
| Doc / Vignettes | OK | Nov 25 2024 |
| R-4.5-linux-x86_64 | OK | Nov 25 2024 |
Exports:bnfit_to_cptscompilecpt_listdim_namesget_clique_rootget_clique_root_idxget_cliquesget_graphget_triang_graphhas_inconsistenciesinitializejtjt_leavesjt_nbinary_opsjt_parentsmpdmpepot_listpropagatequery_beliefquery_evidencesend_messagesset_evidencesim_data_from_bnsim_data_from_dmrftriangulate
Dependencies:clicpp11glueigraphlatticelifecyclemagrittrMatrixpkgconfigRcppRcppArmadillorlangspartavctrs
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| jti: Junction Tree Inference | jti-package jti |
| Asia | asia |
| Asia2 | asia2 |
| bnfit to cpts | bnfit_to_cpts |
| Compile information | compile compile.cpt_list |
| Conditional probability list | cpt_list cpt_list.data.frame cpt_list.list |
| Various getters | dim_names dim_names.charge dim_names.cpt_list dim_names.jt has_inconsistencies has_inconsistencies.charge has_inconsistencies.jt names.charge names.cpt_list names.jt |
| Return the cliques of a junction tree | get_cliques get_cliques.charge get_cliques.jt get_cliques.pot_list get_clique_root get_clique_root.jt get_clique_root_idx get_clique_root_idx.jt |
| Get graph | get_graph get_graph.charge get_graph.cpt_list |
| Get triangulated graph | get_triang_graph |
| Initialize | initialize initialize.charge |
| Junction Tree | jt jt.charge |
| Query Parents or Leaves in a Junction Tree | jt_leaves jt_leaves.jt jt_parents jt_parents.jt |
| Number of Binary Operations | jt_nbinary_ops jt_nbinary_ops.triangulation |
| Maximal Prime Decomposition | mpd mpd.cpt_list mpd.matrix |
| Most Probable Explanation | mpe mpe.jt |
| A plot method for junction trees | plot.charge |
| A plot method for junction trees | plot.jt |
| A check and extraction of clique potentials from a Markov random field to be used in the junction tree algorithm | pot_list pot_list.data.frame |
| A print method for compiled objects | print.charge |
| A print method for cpt lists | print.cpt_list |
| A print method for junction trees | print.jt |
| Propagation of junction trees | propagate propagate.jt |
| Query probabilities | query_belief query_belief.jt |
| Query Evidence | query_evidence query_evidence.jt |
| Send Messages in a Junction Tree | send_messages |
| Enter Evidence | set_evidence set_evidence.charge set_evidence.jt |
| Simulate data from a Bayesian network | sim_data_from_bn |
| Simulate data from a decomposable discrete markov random field | sim_data_from_dmrf |
| Triangulate a Bayesian network | triangulate triangulate.cpt_list |
