Learn R Programming

pcalg (version 2.7-12)

shd: 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)

Value

The value of the SHD (numeric).

Arguments

g1

Graph object

g2

Graph object

Author

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

Run this code
## generate two graphs
g1 <- randomDAG(10, prob = 0.2)
g2 <- randomDAG(10, prob = 0.2)
## compute SHD
(shd.val <- shd(g1,g2))

Run the code above in your browser using DataLab