Methods, apparatus, systems and articles of manufacture are disclosed to improve decision tree execution. An example method includes retrieving, with a processor, a decision tree logic expression in a sum-of-products (SOP) form, the decision tree logic expression consuming a first duration to evaluate a dataset, eliminating, with the processor, redundant variables of the decision tree logic expression by transforming the decision tree logic expression into a product-of-sums (POS) form, and evaluating, with the processor, the data set with the decision tree logic expression in the POS form, the decision tree logic expression in the POS form consuming a second duration to evaluate the data set that is less than the first duration.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method to reduce decision tree evaluation time, comprising: retrieving, with a processor, a decision tree logic expression in a sum-of-products (SOP) form, the decision tree logic expression consuming a first duration to evaluate a dataset; eliminating, with the processor, redundant variables of the decision tree logic expression by transforming the decision tree logic expression into a product-of-sums (POS) form; and evaluating, with the processor, the data set with the decision tree logic expression in the POS form, the decision tree logic expression in the POS form consuming a second duration to evaluate the data set that is less than the first duration. 2. A method as defined in claim 1, wherein the decision tree logic expression in the POS form includes a plurality of sub-expressions logically ANDed with each other. 3. A method as defined in claim 2, further including identifying a first variable that is common to at least two of the plurality of sub-expressions. 4. A method as defined in claim 3, further including generating a simplified version of the transformed decision tree logic expression that factors out the first variable common to the at least two of the plurality of sub-expressions. 5. A method as defined in claim 1, further including identifying surrogate variables associated with the transformed decision tree logic expression, the surrogate variables including a non-Boolean value. 6. A method as defined in claim 5, further including replacing the non-Boolean value with a correction value when the non-Boolean value cannot be evaluated with an inequality test. 7. A method as defined in claim 6, wherein the inequality test includes at least one of a greater-than inequality test, a less-than inequality test, or an equal test. 8. A method as defined in claim 6, wherein the inequality test is associated with a threshold value. 9. A method as defined in claim 6, wherein the non-Boolean value is at least one of NULL or missing. 10. A method as defined in claim 6, further including reducing an evaluation computation burden on the processor by assigning the correction value as a binary value. 11. An apparatus to reduce decision tree evaluation time, comprising: a decision tree interface to retrieve a decision tree logic expression in a sum-of-products (SOP) form, the decision tree logic expression consuming a first duration to evaluate a data set; a tree transformation engine to eliminate redundant variables of the decision tree logic expression by transforming the decision tree logic expression into a product-of-sums (POS) form; and a segmentation optimizer to evaluate the data set with the decision tree logic expression in the POS form, the decision tree logic expression in the POS form consuming a second duration to evaluate the data set that is less than the first duration. 12. An apparatus as defined in claim 11, wherein the decision tree logic expression in the POS form includes a plurality of sub-expressions logically ANDed with each other. 13. An apparatus as defined in claim 12, further including a tree factorization engine to identify a first variable that is common to at least two of the plurality of sub-expressions. 14. An apparatus as defined in claim 13, wherein the tree factorization engine is to generate a simplified version of the transformed decision tree logic expression that factors out the first variable common to the at least two of the plurality of sub-expressions. 15. An apparatus as defined in claim 11, further including a variable evaluator to identify surrogate variables associated with the transformed decision tree logic expression, the surrogate variables including a non-Boolean value. 16. An apparatus as defined in claim 15, further including a not-a-number (NaN) computation engine to replace the non-Boolean value with a correction value when the non-Boolean value cannot be evaluated with an inequality test. 17. An apparatus as defined in claim 16, wherein the inequality test includes at least one of a greater-than inequality test, a less-than inequality test, or an equal test. 18. An apparatus as defined in claim 16, wherein the inequality test is associated with a threshold value. 19. An apparatus as defined in claim 16, wherein the non-Boolean value is at least one of NULL or missing. 20. An apparatus as defined in claim 16, wherein the NaN computation engine is to reduce an evaluation computation burden on a processor by assigning the correction value as a binary value. 21. A tangible computer readable storage medium comprising computer readable instructions that, when executed, cause a processor to at least: retrieve a decision tree logic expression in a sum-of-products (SOP) form, the decision tree logic expression consuming a first duration to evaluate a dataset; eliminate redundant variables of the decision tree logic expression by transforming the decision tree logic expression into a product-of-sums (POS) form; and evaluate the data set with the decision tree logic expression in the POS form, the decision tree logic expression in the POS form consuming a second duration to evaluate the data set that is less than the first duration. 22. A tangible computer readable storage medium as defined in claim 21, wherein the instructions, when executed, cause the processor to evaluate the decision tree logic expression in the POS form having a plurality of sub-expressions logically ANDed with each other. 23. A tangible computer readable storage medium as defined in claim 22, wherein the instructions, when executed, cause the processor to identify a first variable that is common to at least two of the plurality of sub-expressions. 24. A tangible computer readable storage medium as defined in claim 23, wherein the instructions, when executed, cause the processor to generate a simplified version of the transformed decision tree logic expression that factors out the first variable common to the at least two of the plurality of sub-expressions. 25. A tangible computer readable storage medium as defined in claim 21, wherein the instructions, when executed, cause the processor to identify surrogate variables associated with the transformed decision tree logic expression, the surrogate variables including a non-Boolean value. 26. A tangible computer readable storage medium as defined in claim 25, wherein the instructions, when executed, cause the processor to replace the non-Boolean value with a correction value when the non-Boolean value cannot be evaluated with an inequality test. 27. A tangible computer readable storage medium as defined in claim 26, wherein the instructions, when executed, cause the processor to reduce an evaluation computation burden on the processor by assigning the correction value as a binary value.