Patent Document ID: 8868473
Application ID: 13279447
Patent Status: 1

Claim One:
1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising: determining a Boolean function that recursively defines split conditions in each node of a binary classification tree as a disjunction of i) a first conjunction of split conditions for the node and one of the node's child nodes and ii) a second conjunction of split conditions for the node and the other of the node's child nodes; representing the binary classification tree as a Rvachev classification tree function by replacing each disjunction in the Boolean function as an Rvachev disjunction and each conjunction in the Boolean function as a Rvachev conjunction; deriving a split parameter update rule for a tree function based, at least in part, on a derivative of the Rvachev classification tree function; applying the split parameter update rule to a plurality of training data samples to determine split parameters for a tree function, where the tree function comprises a sum of products of respective attributes and respective split parameters associated with the respective attributes; and receiving an input data sample for classification as belonging to one of two possible classes, wherein the input data sample includes a set of attribute values; evaluating the set of attribute values with the tree function; and classifying the input data sample as belonging to one of the two classes based, at least in part, on an output of the tree function.