Detecting Interesting Decision Rules in Tree Ensembles
1 Assignment
0 Petitions
Accused Products
Abstract
Mechanisms are provided for detecting interesting decision rules from a set of decision rules in a tree ensemble. Each tree in the tree ensemble is traversed in order to assign each individual data record from a set of data records to an identified leaf node in each tree. Predicted values are determined for the tree ensemble based on predictions provided by each leaf node to which each individual data record is assigned. Interesting sub-indices for decision rules from the set of decision rules are determined and, for each decision rule corresponding to the leaf nodes in the tree ensemble, the sub-indices are combined into interestingness index It. The decision rules are ranked corresponding to the leaf nodes in the tree ensemble according to the associated value of the interestingness index It and a subset of the decision rules corresponding to the leaf nodes in the tree ensemble are reported.
0 Citations
21 Claims
-
1-7. -7. (canceled)
-
8. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
-
traverse each tree in a tree ensemble in order to assign each individual data record from a set of data records in an evaluation data set to an identified leaf node in a set of leaf nodes in each tree; determine predicted values defined by the tree ensemble based on predictions provided by each leaf node to which each individual data record is assigned; determine interesting sub-indices for decision rules from a set of decision rules corresponding to the leaf nodes in the tree ensemble; for each decision rule corresponding to the leaf nodes in the tree ensemble, combine the sub-indices into interestingness index It; rank the decision rules corresponding to the leaf nodes in the tree ensemble according to the associated value of the interestingness index It; and report a subset of the decision rules corresponding to the leaf nodes in the tree ensemble in order to provide a notification of the interesting decision rules in the tree ensemble. - View Dependent Claims (9, 10, 11, 13, 14)
-
-
15. An apparatus comprising:
-
a processor, and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to; traverse each tree in a tree ensemble in order to assign each individual data record from a set of data records in an evaluation data set to an identified leaf node in a set of leaf nodes in each tree; determine predicted values defined by the tree ensemble based on predictions provided by each leaf node to which each individual data record is assigned; determine interesting sub-indices for decision rules from a set of decision rules corresponding to the leaf nodes in the tree ensemble; for each decision rule corresponding to the leaf nodes in the tree ensemble, combine the sub-indices into interestingness index It; rank the decision rules corresponding to the leaf nodes in the tree ensemble according to the associated value of the interestingness index It; and report a subset of the decision rules corresponding to the leaf nodes in the tree ensemble in order to provide a notification of the interesting decision rules in the tree ensemble. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
Specification