Description Usage Arguments Value Examples
Tree algorithms returns nested, redundant rule sets. This function simplify the rules keeping the shortest condition set required to univocally identify the partition.
1 | simplify_rules(rules)
|
rules |
A vector of rules or a list of rule components. |
A vector or a list, based on the input, with the smallest set of rules that identifies a partition.
1 2 3 4 5 6 7 8 | tree <- ctree(Sepal.Length ~ Species + Sepal.Width, iris)
rules <- tidy_tree()
simplify_rules(rules$rule)
## Works also with a list of conditions
#' rules <- tidy_tree(rule_as_text = FALSE)
simplify_rules(rules$rule)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.