Patent Document ID: 7529718
Application ID: 10367053
Patent Flag: 1

Claim One:
1. A computer-based Segmentation/Recursive Partitioning process (S/RP process) for clarifying a relationship to a human user, wherein the relationship is between a response and one or more predictors in a real-world data set, comprising: generating a nodal tree, the response and each predictor having a value for each data object of a group of real-world data objects, the group of data objects is the root node of the tree; processing the real-world data set, wherein the real-world data is genetics data, chemistry data, clinical trials data, geological data, market research data, data to determine credit scores, demographic data, industrial quality improvement data, pharmacogenomics data, pharmaceutical high-throughput screening data, computational chemistry data or nosocomial infection data; using one or more FSAs (Fast Segmenting Algorithms), wherein each FSA uses one or more measures of intra-segment homogeneity, wherein each FSA has one or more fast cells, wherein each FSA achieves increased speed by computing an overall measure of segment homogeneity for each of only some of the possible segmentations of the data set, wherein the operation of each FSA is characterized by a computational segmenting table, wherein each FSA is a computer-based segmenting method for finding one or more k-way splits on n data points in sequential order, comprising: calculating a subset of the candidate score values for each of one or more cells of the computational segmenting table, wherein one or more cells of the table is a fast cell, wherein only a proper subset of the set of all candidate scores is calculated in each fast cell, and each of one or more of the candidate scores calculated in each fast cell is calculated using a horizontal calculation; electing a score value F j (m) for each cell in the table using zero or more candidate score values in each cell, so that the score value F j (m) for each cell of the table is reliably or reasonably described by one or more of five cell score election categories, wherein the five cell score election categories are: (1) a definite optimal score value, (2) an approximate definite optimal score value, (3) a probable optimal score value, (4) an approximate probable optimal score value, or (5) a statistically meaningful score value that corresponds to a statistically meaningful split; determining an overall score function value for a k-way split of the n sequential data points, wherein the overall score function value is F k (n), wherein F k (n) is determined by using one or more values of F j (m) from the table, so that F k (n) is reliably or reasonably described by one or more of five overall score election categories, wherein the five overall score election categories are: (1) a definite optimal overall score value, (2) an approximate definite optimal overall score value, (3) a probable optimal overall score value, (4) an approximate probable optimal overall score value, or (5) a statistically meaningful overall score value that corresponds to a statistically meaningful split; and determining a k-way split of the n data points using F k (n), the table and a traceback procedure to find one or more endpoints of the split; and displaying the nodal tree on a monitor or equivalent device for use by the human user or storing the nodal tree on a computer readable medium for use by the human user.