The technology disclosed relates to methods for partitioning sets of features for a Bayesian classifier, finding a data partition that makes the classification process faster and more accurate, while discovering and taking into account feature dependence among sets of features in the data set. It relates to computing class entropy scores for a class label across all tuples that share the feature-subset and arranging the tuples in order of non-decreasing entropy scores for the class label, and constructing a data partition that offers the highest improvement in predictive accuracy for the data set. Also disclosed is a method for partitioning a complete set of records of features in a batch computation, computing increasing predictive power; and also relates to starting with singleton partitions, and using an iterative process to construct a data partition that offers the highest improvement in predictive accuracy for the data set.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method of building a partition list of feature subsets having probabilistic interdependence among features in the feature subsets, the method including: accessing an input set including an input tuple comprising feature-values assigned to features; identifying, from the input tuple, input subtuples comprising unique feature subsets; accessing a tuple instance count data structure stored in memory that provides counts of tuples in a data set; computing class entropy scores for the identified input subtuples that have at least a threshold support count of instances in the tuple instance count data structure; building the partition list including: ordering at least some of the scored input subtuples by non-decreasing class entropy score; and traversing the ordered input subtuples, including: adding a feature subset of a current ordered input subtuple to the partition list, and pruning, from subsequent ordered input subtuples, input subtuples including features that overlap with features of the feature subset corresponding to the current ordered input subtuple; and storing the partition list in a memory, whereby it becomes available to use with a classifier. 2. The method of claim 1, further including the threshold support count being in a range of 2 to 10, inclusive, thereby requiring at least 2 to 10 instances of feature-values in the input subtuples to be present in the tuple instance count data structure. 3. The method of claim 1, wherein: the tuple instance count data structure includes tuple instances, class values and counts; and the input tuple includes a class label that accepts an assigned class value. 4. The method of claim 1, wherein the tuple instance count data structure is subject to a minimum threshold support count and returns non-zero counts for tuple instances that have a count in the data set that meets the minimum support threshold. 5. A method of building a partition list of feature subsets having probabilistic interdependence among features in the feature subsets, the method including: accessing a tuple instance count data structure stored in memory; accessing a class value; computing predictive power for the class value of tuple instances using counts in the tuple instance count data structure for supported tuples among tuple instances that have at least a threshold support of count instances; building the partition list including: ordering at least some of the tuple instances for which the predictive power for the class value has been computed by non-increasing predictive power; and traversing the ordered tuple instances, including: adding a feature subset of a current ordered input subtuple to the partition list, and pruning, from subsequent consideration, other input subtuples that include any features in the current ordered input subtuple; and storing the partition list in a memory, whereby it becomes available to use with a classifier. 6. The method of claim 5, further including the supported tuples satisfying the threshold support count being in a range of 2 to 10, inclusive, thereby requiring at least 2 to 10 instances of feature-values in the supported tuples to be present in the tuple instance count data structure. 7. The method of claim 5, wherein: the tuple instance count data structure includes tuple instances, class values and counts. 8. A method of building a partition list of feature subsets having probabilistic interdependence among features in the feature subsets, the method including: accessing a tuple instance count data structure stored in memory; accessing an input set including an input tuple comprising feature-values assigned to features; building the partition list including: adding singleton input features present in the input set to the partition list as pending feature subsets; computing reduction in class entropy scores that would result from merging pairs of pending feature subsets using the tuple instance count data structure, limiting consideration of mergers resulting in merged feature subsets to the mergers that have at least a threshold support count of instances in the tuple instance count data structure; selecting a selected pair of pending feature subsets that yields a reduction in class entropy score resulting from merger, wherein the reduction in class entropy score meets a predetermined class entropy reduction threshold; and merging the selected pair of feature subsets into a merged pending feature subset in the partition list; and storing the partition list in the memory, whereby it becomes available to use with a classifier. 9. The method of claim 8, further including selecting the pair of pending feature subsets for merging that yields a greatest reduction in class entropy among pairs of pending feature subsets available for merger. 10. The method of claim 8, further including the threshold support count for the merged feature subsets being in a range of 2 to 10, inclusive, thereby requiring at least 2 to 10 instances of feature-values in the merged feature subsets to be present in the tuple instance count data structure. 11. The method of claim 8, wherein: the tuple instance count data structure includes tuple instances, class values and counts; and the input tuple includes a class label that accepts an assigned class value. 12. A method of building a partition list of feature subsets having probabilistic interdependence among features in the feature subsets, the method including: accessing a tuple instance count data structure stored in memory; accessing a class value; building the partition list including: adding singleton feature subsets to the partition list as pending feature subsets; computing an increase in class predictive power for the class value that would result from merging pairs of pending feature subsets using the tuple instance count data structure, limiting consideration of mergers to the mergers resulting in merged feature subsets that have at least a threshold support count of instances of the class value for the pairs of pending feature subsets; selecting a selected pair of feature subsets which yields an increase in predictive power for the class value that meets a predetermined predictive power increase threshold; merging the selected pair of feature subsets into a merged single feature subset in the partition list; and storing the partition list in the memory, whereby it becomes available to use with a classifier. 13. The method of claim 12, further including selecting the pair of feature subsets for merging that yields a greatest increase in predictive power for the class value among pairs of pending feature subsets available for merger. 14. The method of claim 12, further including the threshold support count for the merged feature subsets being in a range of 2 to 10, inclusive, thereby requiring at least 2 to 10 instances of feature-values in the merged single feature subsets to be present in the tuple instance count data structure. 15. The method of claim 12, wherein: the tuple instance count data structure includes tuple instances, class values and counts.