IP Library Granted Patent US 12,694,416
Granted Patent B2
US 12,694,416 · App. 18/642,834 · Granted Jul 28, 2026

Systems and methods for business analytics model scoring and selection

Inventors: Loren Roger Marti (Green Cove Springs, FL); Richard Wagner (Columbus, OH); Elena Shatilova (Columbus, OH)
Assignee: Prevedere Inc.
G06Q30/0202
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,694,416
App. No.
18/642,834
Granted
Jul 28, 2026
Kind
B2
Abstract

The present invention relates to systems and methods for model scoring and selection. Six or more metrics that are relevant to the model are initially selected, and weights are assigned to each metric. A first subset of the metrics are selected, including metrics for model fit and model error for primary regression. A second subset of metrics including at least two penalty functions are then selected for percentage of incidence. The scores from the primary regression and penalty calculations are aggregated into a final score. Multiple models can be scored and utilized to select a “best” model via an iterative culling of low scoring models and “breeding” of the high scoring models.

Claims (36)

1 . A computerized method for selecting a model, useful in association with a business analytics system, the method comprising:

receiving, at a computer system, an initial set of models, wherein the models comprise a series of variables representable as a binary string;

scoring, in the computer system, each of the initial set of models, wherein the scoring includes predicting model error using an iterative regression model of millions of forecast simulations;

ranking, in the computer system, the initial set of models by their scores;

removing, in the computer system, a subset of the initial set of models with a ranking below a threshold to yield a remaining set of models;

randomly selecting, in the computer system, a subset of the variables;

exchanging, in the computer system, the binary strings associated with the randomly selected subset of variables between the remaining set of models to generate a new set of models;

scoring, in the computer system, each of the new set of models;

determining if the new set of models is acceptable;

when the new set of models is not acceptable then ranking the new set of models by their scores, removing a subset of the new set of models with a ranking below a threshold to yield a new remaining set of models, and

repeating the prior four steps in the computer system;

when the new set of models is acceptable, selecting, in the computer system, a model from the new set of models with the highest score.

2 . The method of claim 1 , further comprising selecting a random variable, and at least one of removing or altering the selected random variable when exchanging the binary strings.

3 . The method of claim 1 , wherein the determining if the new set of models is acceptable includes comparing the scores of the new set of models against scores from prior scoring iteration.

4 . The method of claim 3 , wherein the determining if the new set of models is acceptable is when the scores of the new set of models have changed less that a threshold as compared against the scores from the prior scoring iteration.

5 . The method of claim 1 , wherein the determining if the new set of models is acceptable is when the scores of the new set of models are all above a threshold.

6 . The method of claim 1 , wherein the scoring of the initial set of models and new set of models includes at least a primary regression analysis and a penalty function.

7 . The method of claim 1 , wherein the subset of models removed are models with a score below a required threshold.

8 . The method of claim 1 , wherein the subset of models removed are half of the set of models with the lowest ranking.

9 . The method of claim 1 , further comprising storing the scoring of each model in a shared database such that each model is only scored once.

10 . The method of claim 1 , further comprising removing variables from the series of variables with a p-value above a threshold.

11 . A computerized system for selecting a model comprising:

a model generator for providing an initial set of models, wherein the models comprise a series of variables representable as a binary string;

a model scoring server for scoring each of the initial set of models, wherein the scoring includes predicting model error using an iterative regression model of millions of forecast simulations;

a model quality assessment server for ranking the initial set of models by their scores, removing a subset of the initial set of models with a ranking below a threshold to yield a remaining set of models, randomly selecting a subset of the variables, and exchanging the binary strings associated with the randomly selected subset of variables between the remaining set of models to generate a new set of models;

the model scoring server for scoring each of the new set of models; and

the model quality assessment server for determining if the new set of models is acceptable, and when the new set of models is not acceptable then ranking the new set of models by their scores, removing a subset of the new set of models with a ranking below a threshold to yield a new remaining set of models, and in conjunction with the model scoring server, iterating the scoring, ranking, and determining steps, and when the new set of models is acceptable, selecting a model from the new set of models with the highest score.

12 . The system of claim 11 , wherein the model quality assessment server is further configured for selecting a random variable, and at least one of removing or altering the selected random variable when exchanging the binary strings.

13 . The system of claim 11 , wherein the determining if the new set of models is acceptable includes comparing the scores of the new set of models against scores from prior scoring iteration.

14 . The system of claim 13 , wherein the determining if the new set of models is acceptable is when the scores of the new set of models have changed less that a threshold as compared against the scores from the prior scoring iteration.

15 . The system of claim 11 , wherein the determining if the new set of models is acceptable is when the scores of the new set of models are all above a threshold.

16 . The system of claim 11 , wherein the scoring of the initial set of models and new set of models includes at least a primary regression analysis and a penalty function.

17 . The system of claim 11 , wherein the subset of models removed are models with a score below a required threshold.

18 . The system of claim 11 , wherein the subset of models removed are half of the set of models with the lowest ranking.

19 . The system of claim 11 , further comprising storing the scoring of each model in a shared database such that each model is only scored once.

20 . The system of claim 11 , further comprising removing variables from the series of variables with a p-value above a threshold.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 17, 2024
From: PREVEDERE, INC.
To: BOARD AMERICAS, INC.
Reel/Frame 069612/0047 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 14, 2024
From: MARTI, LOREN ROGER; WAGNER, RICHARD; SHATILOVA, ELENA
To: PREVEDERE INC.
Reel/Frame 068287/0421 →
Continuity (6)
Division 17060068 · Sep 30, 2020
Continuation In Part 16221416 · Dec 14, 2018
Continuation In Part 15154697 · May 13, 2016
Continuation In Part 13558333 · Jul 25, 2012
Provisional Application 62955282 · Dec 30, 2019
Related Publication 20240346531A1 · Oct 17, 2024
References Cited (142)
US 5432530A · Arita et al. · 1995 [cited by applicant]
US 5454371A · Fenster et al. · 1995 [cited by applicant]
US 5475851A · Kodosky et al. · 1995 [cited by applicant]
US 5727161A · Purcell, Jr. · 1998 [cited by applicant]
US 5793375A · Tanaka · 1998 [cited by applicant]
US 6054984A · Alexander · 2000 [cited by applicant]
US 6064984A · Ferguson et al. · 2000 [cited by applicant]
US 6133914A · Rogers et al. · 2000 [cited by applicant]
US 6163773A · Kishi · 2000 [cited by applicant]
US 6362842B1 · Tahara et al. · 2002 [cited by applicant]
US 6473084B1 · Phillips et al. · 2002 [cited by applicant]
US 6549864B1 · Portyrailo · 2003 [cited by applicant]
US 6614456B1 · Rzepkowski et al. · 2003 [cited by applicant]
US 6757217B2 · Eastwood et al. · 2004 [cited by applicant]
US 6801199B1 · Wallman · 2004 [cited by applicant]
US 6822662B1 · Cook et al. · 2004 [cited by applicant]
US 6901383B1 · Ricketts et al. · 2005 [cited by applicant]
US 7072863B1 · Phillips · 2006 [cited by applicant]
US 7134093B2 · Etgen et al. · 2006 [cited by applicant]
US 7348979B2 · Tso · 2008 [cited by applicant]
US 7363584B1 · Molesky · 2008 [cited by applicant]
US 7493277B1 · Uhl · 2009 [cited by examiner]
US 7496852B2 · Eichorn et al. · 2009 [cited by applicant]
US 7554521B1 · Migos et al. · 2009 [cited by applicant]
US 7698188B2 · Hollas et al. · 2010 [cited by applicant]
US 7788127B1 · Gilgur · 2010 [cited by applicant]
US 7800613B2 · Hanrahan et al. · 2010 [cited by applicant]
US 7818246B2 · Cushing et al. · 2010 [cited by applicant]
US 7904376B2 · Shapiro et al. · 2011 [cited by applicant]
US 7941742B1 · Hao et al. · 2011 [cited by applicant]
US 7991672B2 · Crowder · 2011 [cited by applicant]
US 7999809B2 · Beers et al. · 2011 [cited by applicant]
US 8019638B1 · Uhl · 2011 [cited by applicant]
US 8051000B2 · Kurczek et al. · 2011 [cited by applicant]
US 8306847B2 · Sperry · 2012 [cited by applicant]
US 8315938B1 · Forsythe · 2012 [cited by applicant]
US 8346682B2 · Steed et al. · 2013 [cited by applicant]
US 8381090B2 · Bruckner et al. · 2013 [cited by applicant]
US 8571909B2 · Miller · 2013 [cited by applicant]
US 8731983B2 · Gudla · 2014 [cited by applicant]
US 8732696B2 · Bukary · 2014 [cited by applicant]
US 8843427B1 · Lin · 2014 [cited by applicant]
US 8965895B2 · Chu · 2015 [cited by examiner]
US 10176533B2 · Wagner · 2019 [cited by applicant]
US 10740772B2 · Wagner et al. · 2020 [cited by applicant]
US 10896388B2 · Cooper et al. · 2021 [cited by applicant]
US 11995667B2 · Marti et al. · 2024 [cited by applicant]
US 20030126054A1 · Purcell, Jr. · 2003 [cited by applicant]
US 20030212618A1 · Keyes et al. · 2003 [cited by applicant]
US 20040030667A1 · Xu · 2004 [cited by examiner]
US 20040169638A1 · Kaplan · 2004 [cited by applicant]
US 20050021485A1 · Nodelman et al. · 2005 [cited by applicant]
US 20070005296A1 · Beresniewicz · 2007 [cited by applicant]
US 20070088648A1 · Mather et al. · 2007 [cited by applicant]
US 20070156565A1 · Singer et al. · 2007 [cited by applicant]
US 20070244741A1 · Blume · 2007 [cited by applicant]
US 20080086401A1 · Mather · 2008 [cited by applicant]
US 20080133313A1 · Bateni et al. · 2008 [cited by applicant]
US 20080147486A1 · Wu · 2008 [cited by applicant]
US 20080195930A1 · Tolle · 2008 [cited by applicant]
US 20090012653A1 · Cheng et al. · 2009 [cited by applicant]
US 20090083120A1 · Strichman · 2009 [cited by applicant]
US 20090187606A1 · Allweil et al. · 2009 [cited by applicant]
US 20090216684A1 · Helweg · 2009 [cited by applicant]
US 20100076819A1 · Wannier · 2010 [cited by applicant]
US 20100100469A1 · Buchanan et al. · 2010 [cited by applicant]
US 20100138275A1 · Bateni et al. · 2010 [cited by applicant]
US 20100185976A1 · Sadanandan · 2010 [cited by applicant]
US 20100306031A1 · McCauley · 2010 [cited by applicant]
US 20110007097A1 · Williams · 2011 [cited by applicant]
US 20110087985A1 · Buchanan et al. · 2011 [cited by applicant]
US 20110107265A1 · Buchanan et al. · 2011 [cited by applicant]
US 20110208701A1 · Jackson et al. · 2011 [cited by applicant]
US 20110231339A1 · Hansen · 2011 [cited by applicant]
US 20110246260A1 · Gilbert · 2011 [cited by applicant]
US 20110264487A1 · Koerner · 2011 [cited by examiner]
US 20110283188A1 · Farrenkopf et al. · 2011 [cited by applicant]
US 20110302112A1 · Shan · 2011 [cited by applicant]
US 20110313809A1 · Baek · 2011 [cited by applicant]
US 20120016269A1 · Moctezuma de la Barrera · 2012 [cited by applicant]
US 20120101912A1 · Sen · 2012 [cited by applicant]
US 20120150576A1 · Wagenblatt · 2012 [cited by applicant]
US 20120159384A1 · Zyskowski et al. · 2012 [cited by applicant]
US 20120188250A1 · Kaplan et al. · 2012 [cited by applicant]
US 20120245970A1 · Pulido De Los Reyes et al. · 2012 [cited by applicant]
US 20120316981A1 · Hoover · 2012 [cited by examiner]
US 20120317506A1 · Zhao et al. · 2012 [cited by applicant]
US 20120317509A1 · Ludwig et al. · 2012 [cited by applicant]
US 20130024170A1 · Dannecker et al. · 2013 [cited by applicant]
US 20130041792A1 · King et al. · 2013 [cited by applicant]
US 20130055132A1 · Foslien · 2013 [cited by applicant]
US 20130060603A1 · Wagner · 2013 [cited by applicant]
US 20130066678A1 · May · 2013 [cited by applicant]
US 20130086521A1 · Grossele et al. · 2013 [cited by applicant]
US 20130122482A1 · Sukkarieh · 2013 [cited by applicant]
US 20130179130A1 · Zhandov · 2013 [cited by applicant]
US 20130179739A1 · Ikegami · 2013 [cited by applicant]
US 20140032553A1 · Chu · 2014 [cited by examiner]
US 20140032611A1 · Chu et al. · 2014 [cited by applicant]
US 20140074557A1 · Rallapalli · 2014 [cited by applicant]
US 20140129269A1 · Rey · 2014 [cited by applicant]
US 20140149180A1 · Yaseen · 2014 [cited by applicant]
US 20140172654A1 · Wagner · 2014 [cited by applicant]
US 20140324537A1 · Gilbert · 2014 [cited by applicant]
US 20140351023A1 · Rallapalli · 2014 [cited by applicant]
US 20150134401A1 · Heuer · 2015 [cited by applicant]
US 20150248397A1 · Burstein · 2015 [cited by applicant]
US 20150262095A1 · Rajasekaran · 2015 [cited by examiner]
US 20150339572A1 · Achin · 2015 [cited by examiner]
US 20160048126A1 · Bhattacharjya et al. · 2016 [cited by applicant]
US 20160092799A1 · Khan · 2016 [cited by applicant]
US 20160110812A1 · Mun · 2016 [cited by applicant]
US 20160335550A1 · Achin et al. · 2016 [cited by applicant]
US 20170091692A1 · Guo · 2017 [cited by applicant]
US 20170124459A1 · Jayaraman · 2017 [cited by examiner]
US 20190188612A1 · Cooper et al. · 2019 [cited by applicant]
CA 2712407A1 · 2011 [cited by examiner]
WO WO03025689A2 · 2003 [cited by examiner]
WO WO2015183255 · 2015 [cited by applicant]
Francesco et al (Lassoing the HAR model: A Model Selection Perspective on Realized Volatility Dynamics), Universitat St. Gallen , Nov. 2012, pp. 1-47 (Year: 2012). [cited by examiner]
SAS/Graph 9.2 Reference—Second Edition, SAS, 2010. [cited by applicant]
Jelen, Bill, Rev Up To Excel 2010—Upgraders Guide to Excel 2010; Holy Marco! Books, 2010. [cited by applicant]
Moyle, Michael et al., A Flick in the Right Direction: A Case Stude of Gestural Input In Behavior and Information Technology, 2005. [cited by applicant]
Microsoft Excel 2010 Charts and Graphs—Class Workbook UCSD Biomedical Library Workshop, Unknown Date. [cited by applicant]
Basic Usage of AS/ETS Software to Forecast a Time Series NESUG16, Statistics, Data Analysis & Econometrics, 2003. [cited by applicant]
Cyclical Analysis and Exponential Forecasting Simetar, Simulation & Econometrics to Analyze Risk, 2004. [cited by applicant]
Lahiri, Kajal, Evaluating Probability Forecasts for GDP Declines 2007. [cited by applicant]
Tableau Software Combination Charts, Tableau Software, Inc., 2010. [cited by applicant]
Tableau Software Forecasting, Tableau Software, Inc., 2012. [cited by applicant]
Tableau Visual Guidebook, Tableau Software, Inc., 2010. [cited by applicant]
Macdonald, MRRHWQ, Excel 2003 For Starters—Chapter 9 Pogue Press, O'Reily, Feb. 9, 2009. [cited by applicant]
Stolte, Chris et al., Polaris: A System for Query, Analysis, and Visualization of Multidimensional Relational Databases IEEE Transactions on Visualization and Computer Graphics, vol. 8, No. 1. Jan.-Mar. 2002. [cited by applicant]
Cognos 8 Business Intelligence—Report Studio User Guide, Cognos Inc., 2006. [cited by applicant]
SAS/ETS User's Guide Version 8—vol. 1 SAS, Institute Inc., 1999. [cited by applicant]
Springer “Business performance forecasting of convenience store based on enhanced fuzzy neural network”, Oct. 2008; Neural Computing and Applications, vol. 17 Issue 5-6, pp. 569-578. (Year:2008). [cited by applicant]
USPTO, ISA/US, “Notification of Transmittal of the ISR and the Written Opinion of the International Searching Authority, or the Declaration,” in PCT Application No. PCT/US2016/067026, Mar. 27, 2017, 7 pages. [cited by applicant]
European Patent Office, EPO Application No. 16876720.0, “Supplementary Extended European Search Report and Opinion”, May 28, 2019, 7 pages. [cited by applicant]
ISA/US, “Notification of Transmittal of the ISR and the Written Opinion of the International Searching Authority, or the Declaration,” in PCT Application No. PCT/US2020/066991, Apr. 29, 2021, 10 pages. [cited by applicant]
Gunawardana et al. “A survey of accuracy evaluation metrics of recommendation tasks.” Journal of Machine Learning Research 10.12 (2009). Dec. 9, 2009 (Dec. 9, 2009) Retrieved on Apr. 10, 2021 (Apr. 10, 2021) from <https… [cited by applicant]
Canadian Intellectual Property Office, “Examination Search Report”, in CA Application No. 3,006,988, Jan. 30, 2023, 3 pages. [cited by applicant]
Chang “Better Evaluation Metrics Lead to Better Machine Translation”, Jan. 2011, Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, pp. 375-384 (Year:2011). [cited by applicant]
Xiang “A Multi-Indexed Logistic Model for Time Series”, Dec. 2016, School of Graduate Studies, East Tennessee State University (Year:2016). [cited by applicant]