Patents by Inventor Jon K. Peck
Jon K. Peck has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11017415Abstract: A method, computer system, and a computer program product for performing a total unduplicated reach and frequency (TURF) analysis, is provided. The present invention may include distributing variables into a plurality of groups and calculating, based on a TURF analysis, a reach score for each variable in the plurality of groups. The present invention may include identifying at least one group of variables including the calculated reach score above a first threshold value and displaying a set of TURF analysis results to a user. The present invention may include determining, an available computational resource value for the TURF analysis and in response to determining that a count of variables in the identified at least one group of variables is below a second threshold value, wherein the second threshold value is based on the determined available computational resource value, performing a next TURF analysis on a single group of variables.Type: GrantFiled: October 11, 2019Date of Patent: May 25, 2021Assignee: International Business Machines CorporationInventor: Jon K. Peck
-
Publication number: 20200043024Abstract: A method, computer system, and a computer program product for performing a total unduplicated reach and frequency (TURF) analysis, is provided. The present invention may include distributing variables into a plurality of groups and calculating, based on a TURF analysis, a reach score for each variable in the plurality of groups. The present invention may include identifying at least one group of variables including the calculated reach score above a first threshold value and displaying a set of TURF analysis results to a user. The present invention may include determining, an available computational resource value for the TURF analysis and in response to determining that a count of variables in the identified at least one group of variables is below a second threshold value, wherein the second threshold value is based on the determined available computational resource value, performing a next TURF analysis on a single group of variables.Type: ApplicationFiled: October 11, 2019Publication date: February 6, 2020Inventor: Jon K. Peck
-
Patent number: 10482479Abstract: Embodiments of the present invention disclose a method, computer program product, and system for performing a total unduplicated reach and frequency analysis that analyzes a large set of variables practically. A plurality of variables are received. A subset of the plurality of variables is identified as variables of interest. Variables are partitioned randomly into groups. Each of the groups of variables contains fewer than a predetermined maximum number of variables for each group. The best combination of variables within each group is found through a total unduplicated reach and frequency analysis of each group. The winning variable or variables within each group are identified based on the highest reach score. The winners from each group analysis are then pooled into a group, and the process is repeated. The combination from the second stage with the best reach is then reported. Additional variable combinations ranked by reach may also be reported.Type: GrantFiled: July 20, 2015Date of Patent: November 19, 2019Assignee: International Business Machines CorporationInventor: Jon K. Peck
-
Patent number: 10410226Abstract: Embodiments of the present invention disclose a method, computer program product, and system for performing a total unduplicated reach and frequency analysis that analyzes a large set of variables practically. A plurality of variables are received. A subset of the plurality of variables is identified as variables of interest. Variables are partitioned randomly into groups. Each of the groups of variables contains fewer than a predetermined maximum number of variables for each group. The best combination of variables within each group is found through a total unduplicated reach and frequency analysis of each group. The winning variable or variables within each group are identified based on the highest reach score. The winners from each group analysis are then pooled into a group, and the process is repeated. The combination from the second stage with the best reach is then reported. Additional variable combinations ranked by reach may also be reported.Type: GrantFiled: May 6, 2016Date of Patent: September 10, 2019Assignee: International Business Machines CorporationInventor: Jon K. Peck
-
Publication number: 20170024750Abstract: Embodiments of the present invention disclose a method, computer program product, and system for performing a total unduplicated reach and frequency analysis that analyzes a large set of variables practically. A plurality of variables are received. A subset of the plurality of variables is identified as variables of interest. Variables are partitioned randomly into groups. Each of the groups of variables contains fewer than a predetermined maximum number of variables for each group. The best combination of variables within each group is found through a total unduplicated reach and frequency analysis of each group. The winning variable or variables within each group are identified based on the highest reach score. The winners from each group analysis are then pooled into a group, and the process is repeated. The combination from the second stage with the best reach is then reported. Additional variable combinations ranked by reach may also be reported.Type: ApplicationFiled: May 6, 2016Publication date: January 26, 2017Inventor: Jon K. Peck
-
Publication number: 20170024747Abstract: Embodiments of the present invention disclose a method, computer program product, and system for performing a total unduplicated reach and frequency analysis that analyzes a large set of variables practically. A plurality of variables are received. A subset of the plurality of variables is identified as variables of interest. Variables are partitioned randomly into groups. Each of the groups of variables contains fewer than a predetermined maximum number of variables for each group. The best combination of variables within each group is found through a total unduplicated reach and frequency analysis of each group. The winning variable or variables within each group are identified based on the highest reach score. The winners from each group analysis are then pooled into a group, and the process is repeated. The combination from the second stage with the best reach is then reported. Additional variable combinations ranked by reach may also be reported.Type: ApplicationFiled: July 20, 2015Publication date: January 26, 2017Inventor: Jon K. Peck
-
Patent number: 8977589Abstract: A computer-implemented method, a computer-implemented system, and a computer program product for data binning are disclosed. In a first aspect, the computer-implemented method comprises in response to a determination that a data value is greater than an estimated maximum data value, calculating a new bin position for the data value by adding multiples of a bin width to the estimated maximum data value until a bin where the data value belongs is found.Type: GrantFiled: December 19, 2012Date of Patent: March 10, 2015Assignee: International Business Machines CorporationInventors: Louis L. Kittock, Jon K. Peck, Vladimir E. Shklover
-
Patent number: 8965839Abstract: A computer-implemented method, a computer-implemented system, and a computer program product for data binning are disclosed. In a first aspect, the computer-implemented method comprises in response to a determination that a data value is greater than an estimated maximum data value, calculating a new bin position for the data value by adding multiples of a bin width to the estimated maximum data value until a bin where the data value belongs is found.Type: GrantFiled: March 21, 2014Date of Patent: February 24, 2015Assignee: International Business Machines CorporationInventors: Louis L. Kittock, Jon K. Peck, Vladimir E. Shklover
-
Publication number: 20140207775Abstract: A computer-implemented method, a computer-implemented system, and a computer program product for data binning are disclosed. In a first aspect, the computer-implemented method comprises in response to a determination that a data value is greater than an estimated maximum data value, calculating a new bin position for the data value by adding multiples of a bin width to the estimated maximum data value until a bin where the data value belongs is found.Type: ApplicationFiled: March 21, 2014Publication date: July 24, 2014Applicant: International Business Machines CorporationInventors: Louis L. KITTOCK, Jon K. PECK, Vladimir E. SHKLOVER
-
Publication number: 20140172851Abstract: A computer-implemented method, a computer-implemented system, and a computer program product for data binning are disclosed. In a first aspect, the computer-implemented method comprises in response to a determination that a data value is greater than an estimated maximum data value, calculating a new bin position for the data value by adding multiples of a bin width to the estimated maximum data value until a bin where the data value belongs is found.Type: ApplicationFiled: December 19, 2012Publication date: June 19, 2014Applicant: International Business Machines CorporationInventors: Louis L. Kittock, Jon K. Peck, Vladimir E. Shklover