shd {pcalg} | R Documentation |
Compute Structural Hamming Distance (SHD)
Description
Compute the Structural Hamming Distance (SHD) between two graphs. In simple terms, this is the number of edge insertions, deletions or flips in order to transform one graph to another graph.
Usage
shd(g1,g2)
Arguments
g1 |
Graph object |
g2 |
Graph object |
Value
The value of the SHD (numeric).
Author(s)
Markus Kalisch kalisch@stat.math.ethz.ch and Martin Maechler
References
I. Tsamardinos, L.E. Brown and C.F. Aliferis (2006). The Max-Min Hill-Climbing Bayesian Network Structure Learning Algorithm. JMLR 65, 31–78.
Examples
## generate two graphs
g1 <- randomDAG(10, prob = 0.2)
g2 <- randomDAG(10, prob = 0.2)
## compute SHD
(shd.val <- shd(g1,g2))
[Package pcalg version 2.7-11 Index]