
Last chance! 50% off unlimited learning
Sale ends in
vineOrder(type, data, method = "greedy", ...)
"CVine"
and "DVine"
."random"
,
"greedy"
.data
matrix.The "random"
method returns a random permutation of the variables.
The "greedy"
method returns an order of the variables that intends to
capture as much dependence as possible in the first tree of the vine. The
method finds the order of the variables that defines a tree that maximizes
a given dependence measure used as edge weights. For C-vines, it is determined
iteratively checking each variable as root node. For D-vines, it is equivalent
to solve the traveling salesman problem (TSP), see (Brechmann, 2010)
for details. The TSP is solved using the cheapest insertion algorithm
implemented by the solve_TSP
function of the
[object Object]
data <- matrix(runif(5 * 100), ncol = 5, nrow = 500)
vineOrder("CVine", data, method = "random")
vineOrder("DVine", data, method = "greedy",
according = "spearman")
Run the code above in your browser using DataLab