:og:description: Hill climbing (HC) is a score-based algorithm which starts with a DAG with no edges and adds, deletes or reverses edges in a greedy manner until an optimum is reached. :og:image:alt: Benchpress logo :og:sitename: Benchpress causal discovery platform :og:title: HC (bnlearn) .. meta:: :title: HC (bnlearn) :description: Hill climbing (HC) is a score-based algorithm which starts with a DAG with no edges and adds, deletes or reverses edges in a greedy manner until an optimum is reached. .. _bnlearn_hc: HC (bnlearn) ************* .. list-table:: * - Module name - `bnlearn_hc `__ * - Package - `bnlearn `__ * - Version - 4.8.3 * - Language - `R `__ * - Docs - `here `__ * - Paper - :footcite:t:`scutari2019learning`, :footcite:t:`norvig2002modern` * - Graph type - `DAG `__ * - MCMC - No * - Edge constraints - :ref:`Yes ` * - Data type - C, D, M * - Data missingness - * - Intervention type - * - Docker - `bpimages/bnlearn:4.8.3 `__ Hill-Climbing ----------------- Hill climbing (HC) is a score-based algorithm which starts with a DAG with no edges and adds, deletes or reverses edges in a greedy manner until an optimum is reached. .. rubric:: Some fields described * ``edgeConstraints`` Name of the JSON file containing background knowledge .. rubric:: Example JSON .. code-block:: json [ { "id": "hc-bde", "score": "bde", "iss": [ 0.001, 0.01, 0.1 ], "issmu": null, "issw": null, "l": 5, "k": 1, "prior": "uniform", "beta": 1, "restart": 0, "perturb": 1, "timeout": null, "edgeConstraints": "edgeConstraints.json" }, { "id": "hc-bge", "score": "bge", "iss": 1, "issmu": [ 0.0001, 0.001, 0.01, 0.05 ], "issw": null, "l": 5, "k": 1, "prior": "uniform", "beta": 1, "restart": 0, "perturb": 1, "timeout": null, "edgeConstraints": "edgeConstraints.json" } ] .. footbibliography::