SplittingNode-class

TerminalNode-class

TerminalModelNode-class

A list representing the inner node of a binary tree.

classes

SplittingNode Class

A computational toolbox for recursive partitioning.
  The core of the package is ctree(), an implementation of
  conditional inference trees which embed tree-structured 
  regression models into a well defined theory of conditional
  inference procedures. This non-parametric class of regression
  trees is applicable to all kinds of regression problems, including
  nominal, ordinal, numeric, censored as well as multivariate response
  variables and arbitrary measurement scales of the covariates. Similar
  in spirit, the function mob() implements an algorithm for recursive
  partitioning based on parametric models (e.g. linear models, GLMs or
  survival regression) based on parameter instability tests. Furthermore,
  cforest() provides an implementation of Breiman's random forests
  based on conditional inference trees. Extensible functionality for
  visualizing tree-structured regression models is available.

Torsten Hothorn

party

A Laboratory for Recursive Part(y)itioning

SplittingNode Class function

Class <code>"list"</code>, from data part.
Class <code>"vector"</code>, by class <code>"list"</code>. See
<code><a href="/link/BinaryTree-class?package=party&version=0.9-1" rd-options="" data-mini-rdoc="party::BinaryTree-class">BinaryTree-class</a></code> for more details.

SplittingNode Class: Class "SplittingNode"

Description

Arguments

Extends