closest.transitive.greedy: Find transitively closed graph most similar to the given one

In nem: (Dynamic) Nested Effects Models and Deterministic Effects Propagation Networks to reconstruct phenotypic hierarchies

Description

First, from the original graph Φ spurious edges are pruned via prune.graph. Then the new graph Φ' is transitively closed. Afterwards, the algorithms successively introduces new edges minimizing the distance to the original graph (defined as ∑_{ij} |Φ_{ij} - Φ'_{ij}|) most. After each edge addition the graph is transitively closed again.

Usage

closest.transitive.greedy(Phi, verbose=TRUE)

Arguments

Phi	adjacency matrix
verbose	do you want to see progress statements printed or not? Default: TRUE

Value

adjacency matrix

Author(s)

Holger Froehlich

See Also

prune.graph, transitive.closure, transitive.reduction

nem documentation built on Oct. 31, 2019, 2:12 a.m.