IP Library › Granted Patent US 12,265,918
Granted Patent B2
US 12,265,918 · App. 18/503,312 · Granted Apr 1, 2025

Systems and methods for enriching modeling tools and infrastructure with semantics

Inventors: Douglas C. Merrill (Burbank, CA); Armen Donigian (Burbank, CA); Eran Dvir (Burbank, CA); Sean Javad Kamkar (Burbank, CA); Evan George Kriminger (Burbank, CA); Vishwaesh Rajiv (Burbank, CA); Michael Edward Ruberry (Burbank, CA); Ozan Sayin (Burbank, CA); Yachen Yan (Burbank, CA); Derek Wilcox (Burbank, CA); John Candido (Burbank, CA); Benjamin Anthony Solecki (Burbank, CA); Jiahuan He (Burbank, CA); Jerome Louis Budzik (Burbank, CA); John J. Beahan, Jr. (Burbank, CA); John Wickens Lamb Merrill (Burbank, CA); Esfandiar Alizadeh (Burbank, CA); Liubo Li (Burbank, CA); Carlos Alberta Huertas Villegas (Burbank, CA); Feng Li (Burbank, CA); Randolph Paul Sinnott, Jr. (Burbank, CA)
Assignee: ZestFinance, Inc.
G06N5/022G06F16/908G06F18/2115G06F40/44G06N5/045G06N20/00G06Q10/0633
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,265,918
App. No.
18/503,312
Filed
Nov 7, 2023
Granted
Apr 1, 2025
Kind
B2
Art Unit
2649
USPC
706/45
Abstract

Systems and methods for generating and processing modeling workflows are disclosed. In some examples, a reference distribution of scores generated by a model is determined. The reference distribution of scores is recorded in a structured database. One or more unexpected scores are detected during execution of the model. To detect the one or more unexpected scores, a production distribution of scores is compared with the reference distribution of scores recorded in the structured database. The production distribution of scores is generated by the model for a production input data set. An alert is then provided to an external system, when an alert condition is determined to be satisfied based on the comparison. The alert indicates detection of the one or more unexpected scores.

Claims (28)

1. A method implemented by a modeling system and comprising:

detecting one or more unexpected scores during validation of a model before deploying the model in a production environment, comprising:

comparing a validation distribution of scores with a reference distribution of scores, wherein the validation distribution of scores is generated by the model for a validation input data set and the reference distribution of scores is generated by the model for a test input data set;

determining whether an alert condition is satisfied based on a shift of a plurality of median model score values in the validation distribution of scores, wherein the shift is identified based on the comparison; and

providing an alert when the alert condition is determined to be satisfied, wherein the alert indicates detection of the one or more unexpected scores.

2. The method of claim 1 , wherein the reference distribution of scores comprises, for each of a plurality of score values, a vector comprising a distribution value indicating a portion of the scores in the reference distribution of scores that have one of the score values.

3. The method of claim 1 , further comprising generating a population stability index (PSI), or performing a Kolmogorov-Smirnov test, using the validation distribution of scores and the reference distribution of scores to determine whether to provide the alert.

4. The method of claim 1 , further comprising storing in a structured database model documentation generated based on metadata collected during processing of a workflow associated with the model, wherein the model documentation comprises one or more of fair lending documentation, a model comparison, a sensitivity analysis, feature importance data, unexpected input data information, unexpected score information, or an adverse action reason code mapping.

5. A modeling system, comprising memory having instructions stored thereon and one or more processors coupled to the memory and configured to execute the stored instructions to:

detect an unexpected score during execution of a model in a production environment, comprising:

compare a production distribution of first scores, which are generated by the model during the execution of the model in the production environment during a first time period, with a reference distribution of second scores, which are generated by the model during the execution of the model in the production environment during a second time period prior to the first time period;

determine whether to provide an alert based on a shift of a plurality of median model score values in the production distribution of first scores, wherein the shift is identified based on the comparison; and

selectively provide the alert to an external system based on the determination, wherein the alert indicates detection of the unexpected score.

6. The modeling system of claim 5 , wherein the reference distribution comprises, for each of a plurality of score values, a vector comprising a distribution value indicating a portion of the second scores that have one of the score values.

7. The modeling system of claim 5 , wherein the one or more processors are further configured to execute the stored instructions to generate a population stability index (PSI), or performing a Kolmogorov-Smirnov test, using the production distribution and the reference distribution to determine whether to provide the alert to the external system.

8. The modeling system of claim 5 , wherein the one or more processors are further configured to execute the stored instructions to store in a structured database model documentation generated based on metadata collected during processing of a workflow associated with the model.

9. The modeling system of claim 8 , wherein the model documentation comprises one or more of fair lending documentation, a model comparison, a sensitivity analysis, feature importance data, unexpected input data information, unexpected score information, or an adverse action reason code mapping.

10. A non-transitory computer readable medium having stored thereon instructions comprising executable code that, when executed by one or more processors, causes the one or more processors to:

for each of a plurality of score, generate a reference distribution of score values, wherein the reference distribution of score values comprises, for each of the score values, a vector comprising a distribution value indicating a percentage of the plurality of reference input data sets having the score value; and

detect an unexpected score during execution of the model, comprising, for each score of one or more production input data sets used by the model:

compare a production distribution of score values for the score with the reference distribution of score values for the score wherein the production distribution of score values comprises a plurality of median model scores values;

identify a shift of at least one of the median model score values based on the comparison; and

provide an alert to an external system, wherein the alert indicates detection of the unexpected score.

11. The non-transitory computer readable medium of claim 10 , wherein the production distribution of score values is a distribution of scores within a first subset of the production input data sets and the reference distribution of scores is another distribution of scores within a second subset of the production input data sets.

12. The non-transitory computer readable medium of claim 10 , wherein the reference distribution of score values is within each of a plurality of data sets used to validate or train the model.

13. The non-transitory computer readable medium of claim 10 , wherein the executable code, when executed by the one or more processors, further causes the one or more processors to generate a population stability index (PSI), or performing a Kolmogorov-Smirnov test, using the production distribution of score values and the reference distribution of score values to determine whether to provide the alert to the external system.

14. The non-transitory computer readable medium of claim 10 , wherein the executable code, when executed by the one or more processors, further causes the one or more processors to store in a structured database model documentation generated based on metadata collected during processing of a workflow associated with the model.

15. The non-transitory computer readable medium of claim 14 , wherein the model documentation comprises one or more of fair lending documentation, a model comparison, a sensitivity analysis, feature importance data, unexpected input data information, unexpected score information, or an adverse action reason code mapping.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 7, 2023
From: MERRILL, DOUGLAS C.; DVIR, ERAN; KAMKAR, SEAN JAVAD; KRIMINGER, EVAN GEORGE; RAJIV, VISHWAESH; RUBERRY, MICHAEL EDWARD; SAYIN, OZAN; WILCOX, DEREK; CANDIDO, JOHN; SOLECKI, BENJAMIN ANTHONY; HE, JIAHUAN; BUDZIK, JEROME LOUIS; BEAHAN, JOHN J., JR.; MERRILL, JOHN WICKENS LAMB; LI, FENG; SINNOTT, RANDOLPH PAUL, JR.; YAN, YACHEN; ALIZADEH, ESFANDIAR; DONIGIAN, ARMEN; LI, LIUBO; VILLEGAS, CARLOS ALBERTO HUERTAS; HARTMAN, MICHAEL
To: ZESTFINANCE, INC.
Reel/Frame 065482/0499 →
Continuity (3)
Continuation 16394651 · Apr 25, 2019
Provisional Application 62666991 · May 4, 2018
Related Publication 20240070487A1 · Feb 29, 2024
References Cited (318)
US 525413A · Gates · 1894 [cited by applicant]
US 5745654A · Titan · 1998 [cited by applicant]
US 5999938A · Bliss et al. · 1999 [cited by applicant]
US 6034314A · Koike · 2000 [cited by applicant]
US 6877656B1 · Jaros et al. · 2005 [cited by applicant]
US 7035811B2 · Gorenstein · 2006 [cited by applicant]
US 7280980B1 · Hoadley et al. · 2007 [cited by applicant]
US 7467116B2 · Wang · 2008 [cited by applicant]
US 7499919B2 · Meyerzon et al. · 2009 [cited by applicant]
US 7542993B2 · Satterfield et al. · 2009 [cited by applicant]
US 7610257B1 · Abrahams · 2009 [cited by applicant]
US 7711635B2 · Steele et al. · 2010 [cited by applicant]
US 7765151B1 · Williams et al. · 2010 [cited by applicant]
US 7813945B2 · Bonissone et al. · 2010 [cited by applicant]
US 7873535B2 · Umblijs et al. · 2011 [cited by applicant]
US 7873570B2 · Cagan et al. · 2011 [cited by applicant]
US 7921359B2 · Friebel · 2011 [cited by applicant]
US 7941363B2 · Tanaka et al. · 2011 [cited by applicant]
US 7941425B2 · Sahu et al. · 2011 [cited by applicant]
US 7970676B2 · Feinstein · 2011 [cited by applicant]
US 7987177B2 · Beyer et al. · 2011 [cited by applicant]
US 7996392B2 · Liao et al. · 2011 [cited by applicant]
US 8078524B2 · Crawford et al. · 2011 [cited by applicant]
US 8086523B1 · Palmer · 2011 [cited by applicant]
US 8166000B2 · Labrie et al. · 2012 [cited by applicant]
US 8200511B2 · Zizzamia et al. · 2012 [cited by applicant]
US 8219500B2 · Galbreath et al. · 2012 [cited by applicant]
US 8280805B1 · Abrahams · 2012 [cited by applicant]
US 8335741B2 · Kornegay et al. · 2012 [cited by applicant]
US 8442886B1 · Haggerty et al. · 2013 [cited by applicant]
US 8452699B2 · Crooks · 2013 [cited by applicant]
US 8515842B2 · Papadimitriou · 2013 [cited by applicant]
US 8554756B2 · Gemmell et al. · 2013 [cited by applicant]
US 8560436B2 · Lau et al. · 2013 [cited by applicant]
US 8600966B2 · Kravcik · 2013 [cited by applicant]
US 8626645B1 · Lazerson · 2014 [cited by applicant]
US 8645417B2 · Groeneveld et al. · 2014 [cited by applicant]
US 8660943B1 · Chirehdast · 2014 [cited by applicant]
US 8694401B2 · Stewart · 2014 [cited by applicant]
US 8744946B2 · Shelton · 2014 [cited by applicant]
US 8799150B2 · Annappindi · 2014 [cited by applicant]
US 9047392B2 · Wilkes et al. · 2015 [cited by applicant]
US 9268850B2 · El-Charif et al. · 2016 [cited by applicant]
US 9405835B2 · Wheeler et al. · 2016 [cited by applicant]
US 9501749B1 · Narsky · 2016 [cited by applicant]
US 9639805B1 · Feller · 2017 [cited by applicant]
US 9686863B2 · Chung et al. · 2017 [cited by applicant]
US 10121115B2 · Chrapko · 2018 [cited by applicant]
US 10581887B1 · Dinerstein · 2020 [cited by applicant]
US 10684598B1 · Alanqar et al. · 2020 [cited by applicant]
US 10719301B1 · Dasgupta et al. · 2020 [cited by applicant]
US 10824959B1 · Chatterjee · 2020 [cited by applicant]
US 10977558B2 · Herbster · 2021 [cited by applicant]
US 11296971B1 · Jain · 2022 [cited by applicant]
US 20020038277A1 · Yuan · 2002 [cited by applicant]
US 20020091650A1 · Ellis · 2002 [cited by applicant]
US 20020138414A1 · Pitman · 2002 [cited by applicant]
US 20020178113A1 · Clifford et al. · 2002 [cited by applicant]
US 20030009369A1 · Gorenstein · 2003 [cited by applicant]
US 20030033242A1 · Lynch et al. · 2003 [cited by applicant]
US 20030033587A1 · Ferguson et al. · 2003 [cited by applicant]
US 20030046223A1 · Crawford et al. · 2003 [cited by applicant]
US 20030101080A1 · Zizzamia et al. · 2003 [cited by applicant]
US 20030147558A1 · Loui et al. · 2003 [cited by applicant]
US 20030176931A1 · Pednault · 2003 [cited by applicant]
US 20040068509A1 · Garden et al. · 2004 [cited by applicant]
US 20040107161A1 · Tanaka et al. · 2004 [cited by applicant]
US 20040199456A1 · Flint et al. · 2004 [cited by applicant]
US 20050055296A1 · Hattersley et al. · 2005 [cited by applicant]
US 20050114279A1 · Scarborough et al. · 2005 [cited by applicant]
US 20050234762A1 · Pinto · 2005 [cited by applicant]
US 20050278246A1 · Friedman et al. · 2005 [cited by applicant]
US 20060047613A1 · Labreuche · 2006 [cited by applicant]
US 20060083214A1 · Grim, III · 2006 [cited by applicant]
US 20060106570A1 · Feldman · 2006 [cited by applicant]
US 20060112039A1 · Wang · 2006 [cited by applicant]
US 20060167654A1 · Keinan et al. · 2006 [cited by applicant]
US 20060200396A1 · Satterfield et al. · 2006 [cited by applicant]
US 20060218067A1 · Steele · 2006 [cited by applicant]
US 20070005313A1 · Sevastyanov · 2007 [cited by applicant]
US 20070011175A1 · Langseth · 2007 [cited by applicant]
US 20070016542A1 · Rosauer et al. · 2007 [cited by applicant]
US 20070050286A1 · Abrahams · 2007 [cited by applicant]
US 20070055619A1 · Abrahams et al. · 2007 [cited by applicant]
US 20070067284A1 · Meyerzon et al. · 2007 [cited by applicant]
US 20070106550A1 · Umblijs et al. · 2007 [cited by applicant]
US 20070112668A1 · Celano et al. · 2007 [cited by applicant]
US 20070124236A1 · Grichnik et al. · 2007 [cited by applicant]
US 20070288338A1 · Hoadley et al. · 2007 [cited by applicant]
US 20080133402A1 · Kurian et al. · 2008 [cited by applicant]
US 20080208820A1 · Usey et al. · 2008 [cited by applicant]
US 20080222061A1 · Soetjahja · 2008 [cited by applicant]
US 20080306893A1 · Saidi et al. · 2008 [cited by applicant]
US 20080307006A1 · Lee · 2008 [cited by applicant]
US 20090006283A1 · Labrie et al. · 2009 [cited by applicant]
US 20090006356A1 · Liao et al. · 2009 [cited by applicant]
US 20090015433A1 · James · 2009 [cited by applicant]
US 20090024517A1 · Crooks · 2009 [cited by applicant]
US 20090030888A1 · Sahu et al. · 2009 [cited by applicant]
US 20090037308A1 · Feinstein · 2009 [cited by applicant]
US 20090192980A1 · Beyer et al. · 2009 [cited by applicant]
US 20090216748A1 · Kravcik · 2009 [cited by applicant]
US 20090254572A1 · Redlich et al. · 2009 [cited by applicant]
US 20090299911A1 · Abrahams · 2009 [cited by applicant]
US 20090319521A1 · Groeneveld et al. · 2009 [cited by applicant]
US 20100005018A1 · Tidwell · 2010 [cited by applicant]
US 20100010878A1 · Pinto et al. · 2010 [cited by applicant]
US 20100010935A1 · Shelton · 2010 [cited by applicant]
US 20100082476A1 · Bowman · 2010 [cited by applicant]
US 20100257459A1 · Galbreath et al. · 2010 [cited by applicant]
US 20100325067A1 · Cagan et al. · 2010 [cited by applicant]
US 20110071969A1 · Doctor et al. · 2011 [cited by applicant]
US 20110078073A1 · Annappindi · 2011 [cited by applicant]
US 20110112957A1 · Ingram et al. · 2011 [cited by applicant]
US 20110161263A1 · Lee · 2011 [cited by applicant]
US 20110173116A1 · Yan · 2011 [cited by applicant]
US 20110178902A1 · Imrey · 2011 [cited by applicant]
US 20110184941A1 · El-Charif et al. · 2011 [cited by applicant]
US 20110320423A1 · Gemmell et al. · 2011 [cited by applicant]
US 20120053951A1 · Kowalchuk et al. · 2012 [cited by applicant]
US 20120059819A1 · Wheeler et al. · 2012 [cited by applicant]
US 20120066106A1 · Papadimitriou · 2012 [cited by applicant]
US 20120066116A1 · Kornegay et al. · 2012 [cited by applicant]
US 20120072029A1 · Persaud et al. · 2012 [cited by applicant]
US 20120082476A1 · Ito et al. · 2012 [cited by applicant]
US 20120239613A1 · Danciu · 2012 [cited by applicant]
US 20130091050A1 · Merrill · 2013 [cited by applicant]
US 20130103569A1 · Gopinathan · 2013 [cited by applicant]
US 20130138553A1 · Nikankin et al. · 2013 [cited by applicant]
US 20130185189A1 · Stewart · 2013 [cited by applicant]
US 20140012794A1 · Dillon et al. · 2014 [cited by applicant]
US 20140014047A1 · Garcia et al. · 2014 [cited by applicant]
US 20140025872A1 · Flynn · 2014 [cited by applicant]
US 20140052604A9 · Stewart · 2014 [cited by applicant]
US 20140081832A1 · Merrill et al. · 2014 [cited by applicant]
US 20140108665A1 · Arora · 2014 [cited by applicant]
US 20140122355A1 · Hardtke et al. · 2014 [cited by applicant]
US 20140149177A1 · Frank et al. · 2014 [cited by applicant]
US 20140172886A1 · Wilkes et al. · 2014 [cited by applicant]
US 20140180790A1 · Boal · 2014 [cited by applicant]
US 20140181267A1 · Wadkins · 2014 [cited by applicant]
US 20140310661A1 · Frederickson et al. · 2014 [cited by applicant]
US 20140310681A1 · Poozhiyil · 2014 [cited by applicant]
US 20150019912A1 · Darling et al. · 2015 [cited by applicant]
US 20150056229A1 · Nandy et al. · 2015 [cited by applicant]
US 20150081602A1 · Talley et al. · 2015 [cited by applicant]
US 20150161098A1 · Granshaw · 2015 [cited by applicant]
US 20150213361A1 · Gamon · 2015 [cited by applicant]
US 20150317337A1 · Edgar · 2015 [cited by examiner]
US 20150347485A1 · Cai · 2015 [cited by applicant]
US 20150379428A1 · Dirac et al. · 2015 [cited by applicant]
US 20160042292A1 · Caplan · 2016 [cited by applicant]
US 20160088723A1 · Chung et al. · 2016 [cited by applicant]
US 20160110353A1 · Merrill et al. · 2016 [cited by applicant]
US 20160132787A1 · Drevo et al. · 2016 [cited by applicant]
US 20160300252A1 · Frank et al. · 2016 [cited by applicant]
US 20160371238A1 · Heavenrich · 2016 [cited by applicant]
US 20170061326A1 · Talathi et al. · 2017 [cited by applicant]
US 20170109657A1 · Marcu · 2017 [cited by examiner]
US 20170124464A1 · Crabtree et al. · 2017 [cited by applicant]
US 20170140518A1 · Liang et al. · 2017 [cited by applicant]
US 20170220633A1 · Porath · 2017 [cited by applicant]
US 20170222960A1 · Agarwal et al. · 2017 [cited by applicant]
US 20170316311A1 · Pilly · 2017 [cited by applicant]
US 20170330058A1 · Silberman et al. · 2017 [cited by applicant]
US 20180018578A1 · Yoshizumi · 2018 [cited by applicant]
US 20180025273A1 · Jordan · 2018 [cited by applicant]
US 20180060738A1 · Achin · 2018 [cited by applicant]
US 20180068219A1 · Turner et al. · 2018 [cited by applicant]
US 20180268262A1 · Osada · 2018 [cited by applicant]
US 20180293712A1 · Vogels et al. · 2018 [cited by applicant]
US 20180322406A1 · Merrill et al. · 2018 [cited by applicant]
US 20180349986A1 · Fidanza · 2018 [cited by applicant]
US 20190042887A1 · Nguyen · 2019 [cited by applicant]
US 20190043070A1 · Merrill et al. · 2019 [cited by applicant]
US 20190114704A1 · Way · 2019 [cited by applicant]
US 20190228006A1 · Tormasov et al. · 2019 [cited by applicant]
US 20190244122A1 · Li · 2019 [cited by applicant]
US 20190279111A1 · Merrill et al. · 2019 [cited by applicant]
US 20190287025A1 · Perez · 2019 [cited by applicant]
US 20190303404A1 · Amer · 2019 [cited by applicant]
US 20190311298A1 · Kopp et al. · 2019 [cited by applicant]
US 20190318202A1 · Zhao · 2019 [cited by applicant]
US 20190318421A1 · Lyonnet · 2019 [cited by applicant]
US 20190325514A1 · Hong · 2019 [cited by applicant]
US 20190340518A1 · Merrill · 2019 [cited by applicant]
US 20190340684A1 · Belanger et al. · 2019 [cited by applicant]
US 20190354806A1 · Chhabra · 2019 [cited by applicant]
US 20190354853A1 · Zoldi · 2019 [cited by applicant]
US 20190378210A1 · Merrill et al. · 2019 [cited by applicant]
US 20200005136A1 · Spryn · 2020 [cited by applicant]
US 20200012917A1 · Pham et al. · 2020 [cited by applicant]
US 20200082299A1 · Vasconcelos · 2020 [cited by applicant]
US 20200160177A1 · Durand · 2020 [cited by applicant]
US 20200175586A1 · Mckenna · 2020 [cited by applicant]
US 20200183047A1 · Denli et al. · 2020 [cited by applicant]
US 20200231466A1 · Lu · 2020 [cited by applicant]
US 20200242492A1 · Goel · 2020 [cited by applicant]
US 20200257927A1 · Nomi · 2020 [cited by applicant]
US 20200257961A1 · Hua et al. · 2020 [cited by applicant]
US 20210019603A1 · Friedman · 2021 [cited by applicant]
US 20210133631A1 · Prendki · 2021 [cited by applicant]
US 20210209688A1 · Krishnamurthy · 2021 [cited by applicant]
US 20210224605A1 · Zhang · 2021 [cited by applicant]
US 20210256392A1 · Zhengzhang · 2021 [cited by applicant]
US 20210281491A1 · Yelahanka Raghuprasad · 2021 [cited by applicant]
US 20210406815A1 · Mimassi · 2021 [cited by applicant]
US 20220019741A1 · Roy · 2022 [cited by applicant]
US 20220122171A1 · Hubard · 2022 [cited by applicant]
US 20220188519A1 · Briody · 2022 [cited by applicant]
US 20220188568A1 · Singh · 2022 [cited by applicant]
US 20220191332A1 · Ahmadi · 2022 [cited by applicant]
WO 2014014047A1 · 2014 [cited by applicant]
WO 2014055238A1 · 2014 [cited by applicant]
WO 2014121019A1 · 2014 [cited by applicant]
WO 2014184381A2 · 2014 [cited by applicant]
WO 2015056229A1 · 2015 [cited by applicant]
WO 2015081160A1 · 2015 [cited by applicant]
WO 2019028179A1 · 2019 [cited by applicant]
Karakoulas, G., 2004. Empirical validation of retail credit-scoring models. Rma Journal, 87, pp. 56-60. [cited by examiner]
Dong Yue et al, “Threaded ensembles of autoencoders for stream learning : Neural Networks for Stream Learning”, Computational Intelligence, vol. 34, No. 1, doi:10.1111/coin.12146, ISSN 0824-7935, (Feb. 1, 2018), pp. 261… [cited by applicant]
European Extended Search Report issued in EP19796824.1, dated Jun. 13, 2022, 9 pages. [cited by applicant]
International Preliminary Report on Patentability in International Appln. No. PCT/US2019/029148, dated Nov. 19, 2020, 6 pages. [cited by applicant]
Li, Hongxiang, et al. “A novel method for credit scoring based on feature transformation and ensemble model.” PeerJ Computer Science 7 (2021): e579. 19 pages. [cited by applicant]
Office Action (Final Rejection) dated Dec. 7, 2022 for U.S. Appl. No. 16/688,789 (pp. 1-24). [cited by applicant]
Office Action (Non-Final Rejection) dated Oct. 28, 2022 for U.S. Appl. No. 17/389,789 (pp. 1-19). [cited by applicant]
Office Action (Non-Final Rejection) dated Dec. 8, 2022 for U.S. Appl. No. 17/147,025 (pp. 1-20). [cited by applicant]
Wei Min et al, “Behavior Language Processing with Graph based Feature Generation for Fraud Detection in Online Lending Behavior Language Processing with Graph based Feature Generation for Fraud Detection in Online Lendi… [cited by applicant]
Office Action (Final Rejection) dated Aug. 16, 2022 for U.S. Appl. No. 15/977,105 (pp. 1-17). [cited by applicant]
Office Action (Non-Final Rejection) dated Aug. 1, 2022 for U.S. Appl. No. 16/052,293 (pp. 1-15). [cited by applicant]
Office Action (Non-Final Rejection) dated Sep. 15, 2022 for U.S. Appl. No. 17/535,511 (pp. 1-11). [cited by applicant]
Office Action (Non-Final Rejection) dated Sep. 22, 2022 for U.S. Appl. No. 17/223,698 (pp. 1-8). [cited by applicant]
Boris Sharchilev et al: “Finding Influential Training Samples for Gradient Boosted Decision Trees”, Arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Feb. 19, 2018 (Feb. 19, 20… [cited by applicant]
European Extended Search Report issued in EP19764112.9, dated Jun. 27, 2022, 11 pages. [cited by applicant]
European Extended Search Report issued in EP19764112.9, dated Mar. 24, 2022, 14 pages. [cited by applicant]
Kang et al., “A novel credit scoring framework for auto loan using an imbalanced-learning-based reject inference”. 2019 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr). May 4-… [cited by applicant]
Marco Ancona et al: “Towards better understanding of gradient-based attribution methods for Deep Neural Networks”, Arxiv.Org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Mar. 7, 201… [cited by applicant]
Mukund Sundararajan et al: “Axiomatic Attribution for Deep Networks”, Arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Mar. 4, 2017 (Mar. 4, 2017), XP080754192, 10 pages. [cited by applicant]
Office Action (Non-Final Rejection) dated May 24, 2022 for U.S. Appl. No. 16/688,789 (pp. 1-17). [cited by applicant]
Office Action (Non-Final Rejection) dated Jun. 24, 2022 for U.S. Appl. No. 17/385,452 (pp. 1-14). [cited by applicant]
Wikipedia entry on “Autoencoder”. https://en.wikipedia.org/wiki/Autoencoder Downloaded Jun. 15, 2022 (Year: 2022). [cited by applicant]
Office Action (Non-Final Rejection) dated Mar. 2, 2022 for U.S. Appl. No. 16/434,731 (pp. 1-6). [cited by applicant]
“Bit Array”, Wikipedia Search, May 5, 2021 at https://en.wikipedia.org/wiki/Bit_array. [cited by applicant]
Genetic algorithm, Wikipedia Search, May 5, 2021 at https://en.wikipedia.org/wiki/Gentic_algorithm. [cited by applicant]
International Search Report and the Written Opinion, Application No. PCT/US14/014047, dated May 5, 2014. [cited by applicant]
“Feature Selection” from Wikipedia and obtained in the Wayback machine at URL “https://en.wikipedia.org/wiki/Feature_selection” for Feb. 25, 2021. [cited by applicant]
“On the Convergence of Generalized Hill Climbing Algorithms” by A.W. Johnson et al. copyright 2002, Elsevier Science B.V., Discrete Applied Mathematics (Year: 2002). [cited by applicant]
“Feature Selection”, Wikipedia and obtained in the Wayback machine at URL http://en.wikipedia.org/wiki/Feature_selection, Sep. 1, 2011. [cited by applicant]
Bittencourt, H.R. et al., “Feature Selection by Using Classification and Regression Trees (CART)”, dated Aug. 23, 2004. [cited by applicant]
Chen, Jiahao, Fair lending needs explainable models for responsible recommendation Proceedings of the Second Workshop on Responsible Recommendation, 2018 (Year: 2018). [cited by applicant]
Data Bias and Algorithmic Discrimination University of Montreal, 2017 (Year: 2017). [cited by applicant]
Demaine, Erik D., et al., “Correlation clustering in general weighted graphs”, Theorectical Computer Science 361 2006)172-187. [cited by applicant]
Gates, Susan Wharton et al., 4/3 Automated Underwriting: Friend or Foe to Low-Mod Households and Neighborhoods? Building Assets, Building Credit, Symposium, Nov. 2003 (Year: 2003). [cited by applicant]
International Preliminary Report on Patentability dated Aug. 4, 2015 in corresponding PCT Application No. PCT/US2014/014047. [cited by applicant]
International Preliminary Report on Patentability issued in PCT/US2013/060208, dated Mar. 24, 2015, 8 pages. [cited by applicant]
International Search Report and Written Opinion for application No. PCT/US20/062271 dated Feb. 26, 2021. [cited by applicant]
International Search Report and Written Opinion issued in PCT/US2020/062235, dated Mar. 10, 2021, 8 pages. [cited by applicant]
International Search Report and Written Opinion issued in PCT/US2020/062271, dated Feb. 26, 2021, 8 pages. [cited by applicant]
International Search Report dated May 5, 2014 in corresponding PCT Application No. PCT/US2014/014047. [cited by applicant]
International Search Report issued in PCT/US2013/060208, dated Jan. 7, 2014, 2 pages. [cited by applicant]
Ivanov, Alexei, et al., “Kolmogorov-Smirnov test for feature selection in emotion recognition from speech”, IEEE International Conference on acoustics, speech and signal processing (ICASSP), 2012, pp. 5125-5128. [cited by applicant]
Mondarres, Ceena et al., Towards Explainable Deep Learning for Credit Lending: A Case Study Proc. Workshop Challenges Opportunities AI Financial Services: Impact Fairness Explainability Accuracy Privacy (NIPS), 2018 ( Y… [cited by applicant]
Office Action (Final Rejection) dated Nov. 18, 2021 for U.S. Appl. No. 16/052,293 (pp. 1-18). [cited by applicant]
Office Action (Final Rejection) dated Dec. 7, 2021 for U.S. Appl. No. 16/109,545 (pp. 1-17). [cited by applicant]
Office Action (Non-Final Rejection) dated Dec. 16, 2021 for U.S. Appl. No. 15/977,105 (pp. 1-19). [cited by applicant]
Office Action (Notice of Allowance and Fees Due (PTOL-85)) dated Nov. 19, 2021 for U.S. Appl. No. 16/292,844 (pp. 1-8). [cited by applicant]
Ribeiro, Marco Tulio et al., Why Should | Trust You?—Explaining Predictions of Any Classifier ACM, 2016 (Year: 2016). [cited by applicant]
Strobl, Carolin , et al., “Conditional Variable Importance for Random Forests”, BMC Bioinformatics 2008, 9:307, published Jul. 11, 2008. [cited by applicant]
Tuv, Eugene , et al., “Feature Selection with Ensembles, Artificial Variables, and Redundancy Elimination”, Journal of Machine Learning Research, pp. 1341-1366, Jul. 2009. [cited by applicant]
Wattenber, Martin et al., Attacking discrimination with smarter machine learning Google Research, 2016 (Year: 2016). [cited by applicant]
Zhang, et al., 2018. “Mitigating Unwanted Biases with Adversarial Learning,” In Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society (AIES '18). Association for Computing Machinery, New York, NY, USA, … [cited by applicant]
Zhao, Zheng , et al., “On Similarity Preserving Feature Selection”, IEEE Transactions on Knowledge and Data Engineering 25,2011, pp. 619-632. [cited by applicant]
Ward, et al., “An exploration of the influence of path choice in game-theoretic attribuution algorithms,” Journal of Machine Learning Research Under Review (2020), 21 pages. [cited by applicant]
International Search Report and Written Opinion for application No. PCT/US20/062235, dated Mar. 10, 2021. [cited by applicant]
“International Search Report and Written Opinion of the ISA, dated Sep. 16, 2019, for application No. PCT/US19/029148.” [cited by applicant]
“International Search Report and Written Opinion of the ISA, dated Aug. 23, 2019, for application No. PCT/US19/036049.” [cited by applicant]
Strumbelj, Eric , et al., “An Efficient Explanation of Individual Classifications using Game Theory”, Journal of Machine Learning Research 11 (2010) 1-18. [cited by applicant]
“International Search Report and Written Opinion of the ISA, dated Jul. 5, 2019, for application No. PCT/US19/021381.” [cited by applicant]
Breiman, Leo , et al., “Random Forests”, Machine Learning, 45, 5-32, 2001. [cited by applicant]
Kamkar, Sean Javad, “Mesh Adaption Strategies for Vortex-Dominated Flows”, Standard University, Feb. 2011. [cited by applicant]
Louppe, Gilles , et al., “Learning to Pivot with Adversarial Networks”, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA, https://papers.nips.cc/paper/6699-learning-to-pivot-with… [cited by applicant]
Lundberg, Scott M., et al., “A Unified Approach to Interpreting Model Predictions”, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA, Nov. 25, 2017. [cited by applicant]
Lundberg, Scott M., et al., “Consistent Individualized Feature Attribution for Tree Ensembles”, University of Washington, Mar. 7, 2019. [cited by applicant]
Modarres, Ceena , et al., “Towards Explainable Deep Learning for Credit Lending: A Case Study”, arXiv:1811.06471v2 [cs.LG], Nov. 30, 2018. [cited by applicant]
Richardson, L. F. , “The approximate arithmetical solution by finite differences of physical problems including differential equations, with an application to the stresses in a masonry dam”, Philosophical Transactions o… [cited by applicant]
Richardson, L. F. , “The deferred approach to the limit”, Philosophical Transactions of the Royal Society A. 226 (636-646): 299-349. doi:10.1098/rsta. 1927.0008, Oct. 14, 1926. [cited by applicant]
Tonk, Stijn , “Towards fairness in ML with adversarial networks”, https://blog.godatadriven.com/fairness-in-ml, Apr. 27, 2019. [cited by applicant]
International Search Report and Written Opinion of the ISA for application No. PCT/20/23370 dated Jun. 18, 2020. [cited by applicant]
“ZestFinance releases new software tool to reduce bias in AI-powered credit scoring models: New fairness filter can put 170,000 more minority families into homes”, Mar. 19, 2019, PR Newswire. [cited by applicant]
Nesiba, Reynold F., “The Color of Credit: Mortgage Discrimination, Research Methodology, and Fair-Lending Enforcement”, Journal of Economic Issues, 37 (3), 813-815, 2003. [cited by applicant]
Johnson, Kristen , et al., “Artificial Intelligence, Machine Learning, and Bias in Finance: Toward Responsible Innovation”, Fordham Law Review, Volume ** , Issue 2, Article 5, 2019, pp. 499-529. [cited by applicant]
Lippert, John , “ZestFinance Issues small, high-rate loans, uses big data to weed out deadbeats”, The Washington Post, Oct. 12, 2014. [cited by applicant]
Tonk, Stijn , “Towards fairness in ML with adversarial networks”, http://godatadriven.com/, Apr. 27, 2019. [cited by applicant]
Abadi, Martin , et al., “TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems”, Preliminary White Paper, Nov. 9, 2015. [cited by applicant]
Chen, Tianqi , et al., “XGBoost: A Scalable Tree Boosting System”, KDD '16, Aug. 13-17, 2016, San Francisco, CA, USA. [cited by applicant]
Cortes, Corinna , et al., “Support-Vector Networks”, AT&T Labs-Research, USA, Journal Machine Learning, vol. 20, Issue 3, Sep. 1995. [cited by applicant]
Friedman, Jerome H., “Greedy Function Approximation: A Gradient Boosting Machine”, IMS 1999 Reitz Lecture, Feb. 24, 1999. [cited by applicant]
Garcia-Pedradas, Nicolas , et al., “Nonlinear Boosting Projections for Ensemble Contruction”, Journal of Machine Learning Research 8 (2007) 1-33. [cited by applicant]
Geurts, Pierre , et al., “Extremely randomized trees”, Springer Science + Business Media, Inc., rec'd Jun. 14, 2005, pub. online Mar. 2, 2006. [cited by applicant]
Merrill, John W. L. , et al., “Generalized Integrated Gradients: A practical method for explaining diverse ensembles”, Journal of Machine Learning Research Under Review (2019). [cited by applicant]
Merrill, Douglas C, et al., “Systems and Methods for Decomposition of Non-Differentiable and Differentiable Models”, U.S. Appl. No. 16/434,731, file Jun. 7, 2019. [cited by applicant]
Merrill, Douglas C, et al., “Systems and Methods for Enriching Modeling Tools and Infrastructure with Semantics”, U.S. Appl. No. 16/394,651, filed Apr. 25, 2019. [cited by applicant]
Rumelhart, David E., et al., “Learning representations by back-propagating errors”, Nature vol. 323, Oct. 9, 1986. [cited by applicant]
Shapley, L. S. , “A Value For n-Person Games”, p. 295, The Rand Corporation, Mar. 18, 1952. [cited by applicant]
Wolpert, David H., “Stacked Generalization”, Original contribution: Stacked generalization. Neural Netw., 5(2):241{259, Feb. 1992. [cited by applicant]
Extended European Search Report in related EP Application No. EP23154444.6, mailed Mar. 16, 2023 (8 pages). [cited by applicant]
Bean, D.M. et al., “Knowledge graph prediction of unknown adverse drug reactions and validation in electronic health records,” Scientific reports, 2017, 7(1), pp. 1-11. [cited by applicant]
Zhao, Q. et al., “Construction and application research of knowledge graph in aviation risk field,” In MATEC Web of Conferences (vol. 151, p. 05003), EDP Sciences, 2018. [cited by applicant]
Min, W. et al., “Behavior language processing with graph based feature generation for fraud detection in online lending,” In Proceedings of workshop on misinformation and misbehavior mining on the web (Jan. 2018). [cited by applicant]
Gehrlein, William et al., A two-stage least cost credit scoring model, 1997, Annals of Operations Research, pp. 159-171. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US18/030966, mailed Jul. 20, 2018. [cited by applicant]
“International Search Report and the Written Opinion for Application No. PCT/US18/44874, mailed Oct. 10, 2018”, Oct. 10, 2018. [cited by applicant]
Saabas, Ando , “Diving into data, A blog on machine learning, data mining and visualization, Interpreting random forests”, http://blog.datadive.net/interpreting-random-forests/ (spec), Oct. 19, 2014. [cited by applicant]
Sundararajan, Mukund , et al., “Axiomatic Attribution for Deep Networks”, Proceeding of the 34th International Conference on Machine Learning, Sydney, Australia, PMLR 70, Jun. 13, 2017. [cited by applicant]
Saabas, Ando , “Diving into data, A blog on machine learning, data mining and visualization, Random forest interpretation with scikit-learn”, http://blog.datadive.net/random-forest-interpretation-with-scikit-learn/ (spe… [cited by applicant]
Saabas, Ando , “Diving into data, A blog on machine learning, data mining and visualization, Random forest interpretation—conditional feature contributions”, http://blog.datadive.net/random-forest-interpretation-conditi… [cited by applicant]
Wei Min, Zhengyang Tang, Min Zhu, Yuxi Dai, Yan Wei, and Ruinan Zhang. 2018. “Behavior Language Processing with Graph based Feature Generation for Fraud Detection in Online Learning”. In Proceedings of WSDM workshop on … [cited by applicant]
Communication pursuant to Article 94(3) EPC dated Jul. 8, 2024 issued in European Application No. 19796824.1. [cited by applicant]