shd: Structural Hamming Distance

In tzimiskes/causality: Examine The Causal Structure of Data

Description

shd calculates the structural hamming distance (SHD) between two patterns

Usage

shd(x, y)

Arguments

x	A causality.graph
y	A causality.graph x

Details

shd takes in patterns and calculates the structural hamming distance between them as defined in Tsamardinos et al(2006). DAGs will also work, as they will be converted into patterns. Inputing PDAGs will work if the PDAGs admit DAG extensions. If (at least) one of them does not, an error is thrown.

Value

Length one numeric between 0 and n^2, where n is the number of nodes. A distance of 0 implies that the patterns are the same

Author(s)

Alexander Rix

References

Tsamardinos I, Brown LE, Aliferis CF (2006). "The Max-Min Hill-Climbing Bayesian Network Structure Learning Algorithm". Machine Learning, 65(1), 31-78.

See Also

Other graph comparison statistics: arrowhead_precision, arrowhead_recall, adjacency_precision, and adjacency_recall

Examples

TODO(arix)

tzimiskes/causality documentation built on Sept. 15, 2019, 8:41 p.m.