bnlearn_hc
HC
Package |
|
Version |
4.8.3 |
Language |
|
Docs |
|
Paper |
|
Graph type |
|
Docker |
|
Module folder |
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.
Example 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
},
{
"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
}
]