IP Library Granted Patent US 12,271,387
Granted Patent B1
US 12,271,387 · App. 18/798,168 · Granted Apr 8, 2025

Computer network architecture and method for predictive analysis using lookup tables as prediction models

Inventors: Phillip H. Rogers (San Francisco, CA); Jonathan B. Ward (San Francisco, CA); Rashmi Poudel (San Francisco, CA); Emily Barry (San Francisco, CA); Melinda Sue Gomez Tellez (San Francisco, CA); Prajwal Vijendra (San Francisco, CA); Azriel S. Ghadooshahy (San Francisco, CA); Emmet Sun (San Francisco, CA)
Assignee: Clarify Health Solutions, Inc.
G06F16/24578G06F16/2282
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,271,387
App. No.
18/798,168
Granted
Apr 8, 2025
Kind
B1
Abstract

Embodiments in the present disclosure relate to computer network architectures and methods for predictive analysis using lookup tables as prediction models. The predictive analysis, including the generation of the lookup tables, performed by a predictive system of the present disclosure is driven entirely by a query language, such as Structured Query Language, in various embodiments. The predictive analysis, including the generation of the lookup tables, is performed without machine learning or generative artificial intelligence, in various embodiments.

Claims (75)

1. A system, comprising:

one or more memory units comprising one or more instructions;

one or more processors communicatively coupled to the one or more memory units, the one or more processors configured, upon executing the one or more instructions, to:

for each of one or more lookup tables:

access a table that comprises a first set of data, wherein the first set of data comprises a plurality of first independent variables, wherein all of the plurality of the first independent variables are one-hot encoded;

rank the plurality of first independent variables, and sort the plurality of first independent variables into a first order based on the rank;

distribute the sorted first independent variables of the second table into a plurality of first bands of first varying resolution;

generate a first hash for each record of the first set of data at each level of the plurality of first bands;

generate a respective lookup table of the one or more lookup tables based on the first hashes;

access a table that comprises a second set of data, wherein the second set of data comprises a plurality of second independent variables, wherein all of the plurality of the second independent variables are one-hot encoded;

rank and sort the plurality of second independent variables into a second order that is the same as the first order of the sorted first independent variables;

distribute the sorted second independent variables into a plurality of second bands of a second varying resolution, wherein the distribution of the sorted second independent variables into the plurality of second bands of the second varying resolution is the same as the distribution of the sorted first independent variables into the plurality of first bands of the first varying resolution, wherein the plurality of second bands of the second varying resolution is the same as the plurality of first bands of the first varying resolution;

generate a second hash for each record of the second set of data at each level of the plurality of second bands, so as to create a model-ready table; and

join the respective lookup table to the model-ready table on matching hashes of the first and second hashes.

2. The system of claim 1 , wherein the one or more processors are further configured, upon executing the one or more instructions, to, for each of the one or more lookup tables, remove one or more first bands of the plurality of first bands and/or one or more second bands of the plurality of second bands based on a minimum match volume hyperparameter.

3. The system of claim 1 , wherein, for each of the one or more lookup tables, the respective lookup table comprises one or more predicted values for each of the first hashes.

4. The system of claim 3 , wherein the one or more processors are further configured, upon executing the one or more instructions, to:

receive a user prediction request from a user device;

generate a prediction report based on at least one lookup table of the one or more lookup tables; and

transmit the prediction report to the user device.

5. The system of claim 4 , wherein the user device is a member of a group comprising:

a computer;

a desktop PC;

a laptop PC;

a smart phone;

a tablet computer; and

a personal wearable computing device.

6. The system of claim 1 , wherein the one or more processors are further configured, upon executing the one or more instructions, to:

for each of the one or more lookup tables:

one-hot encode one or more of the first independent variables of the plurality of first independent variables of the first set of data, wherein the one-hot encoding results in all of the plurality of the first independent variables being one-hot encoded; and

one-hot encode one or more of the second independent variables of the plurality of second independent variables of the second set of data based on a mapping of the one-hot encoding of all of the plurality of first independent variables of the first set of data, wherein the one-hot encoding results in all of the plurality of the second independent variables being one-hot encoded.

7. The system of claim 1 , wherein, for each of the one or more lookup tables, each of the plurality of first independent variables is ranked based on a correlation between the respective first independent variable and a target metric.

8. The system of claim 1 , wherein, for each of the one or more lookup tables, the plurality of first bands comprise a top band that comprises a smallest portion of the sorted first independent variables in comparison to each of the other first bands of the plurality of first bands, wherein each of the other first bands of the plurality of first bands includes a larger portion of the sorted first independent variables in comparison to a previous first band of the plurality of first bands.

9. The system of claim 1 , wherein, for each of the one or more lookup tables, the plurality of first independent variables comprises one or more one-hot encoded categorical variables and one or more one-hot encoded numerical variables.

10. The system of claim 1 , wherein, for each of the one or more lookup tables, the respective lookup table of the one or more lookup tables is generated using one or more query language statements.

11. A method, comprising:

for each of one or more lookup tables:

accessing, by one or more processors of a computing system, a table that comprises a first set of data, wherein the first set of data comprises a plurality of first independent variables, wherein all of the plurality of the first independent variables are one-hot encoded;

ranking, by the one or more processors of the computing system, the plurality of first independent variables, and sorting, by the one or more processors of the computing system, the plurality of first independent variables into a first order based on the rank;

distributing, by the one or more processors of the computing system, the sorted first independent variables of the second table into a plurality of first bands of first varying resolution;

generating, by the one or more processors of the computing system, a first hash for each record of the first set of data at each level of the plurality of first bands;

generating, by the one or more processors of the computing system, a respective lookup table of the one or more lookup tables based on the first hashes;

accessing, by the one or more processors of the computing system, a table that comprises a second set of data, wherein the second set of data comprises a plurality of second independent variables, wherein all of the plurality of the second independent variables are one-hot encoded;

ranking and sorting, by the one or more processors of the computing system, the plurality of second independent variables into a second order that is the same as the first order of the sorted first independent variables;

distributing, by the one or more processors of the computing system, the sorted second independent variables into a plurality of second bands of a second varying resolution, wherein the distribution of the sorted second independent variables into the plurality of second bands of the second varying resolution is the same as the distribution of the sorted first independent variables into the plurality of first bands of the first varying resolution, wherein the plurality of second bands of the second varying resolution is the same as the plurality of first bands of the first varying resolution;

generating, by the one or more processors of the computing system, a second hash for each record of the second set of data at each level of the plurality of second bands, so as to create a model-ready table; and

joining, by the one or more processors of the computing system, the respective lookup table to the model-ready table on matching hashes of the first and second hashes.

12. The method of claim 11 , further comprising, for each of the one or more lookup tables, removing, by the one or more processors of the computing system, one or more first bands of the plurality of first bands and/or one or more second bands of the plurality of second bands based on a minimum match volume hyperparameter.

13. The method of claim 11 , wherein, for each of the one or more lookup tables, the respective lookup table comprises one or more predicted values for each of the first hashes.

14. The method of claim 13 , further comprising:

receiving, by the one or more processors of the computing system, a user prediction request from a user device;

generating, by the one or more processors of the computing system, a prediction report based on at least one lookup table of the one or more lookup tables; and

transmitting, by the one or more processors of the computing system, the prediction report to the user device.

15. The method of claim 11 , further comprising, for each of the one or more lookup tables:

one-hot encoding, by the one or more processors of the computing system, one or more of the first independent variables of the plurality of first independent variables of the first set of data, wherein the one-hot encoding results in all of the plurality of the first independent variables being one-hot encoded; and

one-hot encoding, by the one or more processors of the computing system, one or more of the second independent variables of the plurality of second independent variables of the second set of data based on a mapping of the one-hot encoding of all of the plurality of first independent variables of the first set of data, wherein the one-hot encoding results in all of the plurality of the second independent variables being one-hot encoded.

16. The method of claim 11 , wherein, for each of the one or more lookup tables, the ranking, by the one or more processors of the computing system, the plurality of first independent variables comprises ranking each of the plurality of first independent variables based on a correlation between the respective first independent variable and a target metric.

17. The method of claim 11 , wherein, for each of the one or more lookup tables, the generating, by the one or more processors of the computing system, the respective lookup table of the one or more lookup tables comprises generating, by the one or more processors of the computing system, the respective lookup table of the one or more lookup tables using one or more query language statements.

18. Tangible, non-transitory computer-readable media comprising program instructions that are configured, when executed, to cause a computing system to perform functions comprising:

for each of one or more lookup tables:

accessing a table that comprises a first set of data, wherein the first set of data comprises a plurality of first independent variables, wherein all of the plurality of the first independent variables are one-hot encoded;

ranking the plurality of first independent variables, and sorting the plurality of first independent variables into a first order based on the rank;

distributing the sorted first independent variables of the second table into a plurality of first bands of first varying resolution;

generating a first hash for each record of the first set of data at each level of the plurality of first bands;

generating a respective lookup table of the one or more lookup tables based on the first hashes;

accessing a table that comprises a second set of data, wherein the second set of data comprises a plurality of second independent variables, wherein all of the plurality of the second independent variables are one-hot encoded;

ranking and sorting the plurality of second independent variables into a second order that is the same as the first order of the sorted first independent variables;

distributing the sorted second independent variables into a plurality of second bands of a second varying resolution, wherein the distribution of the sorted second independent variables into the plurality of second bands of the second varying resolution is the same as the distribution of the sorted first independent variables into the plurality of first bands of the first varying resolution, wherein the plurality of second bands of the second varying resolution is the same as the plurality of first bands of the first varying resolution;

generating a second hash for each record of the second set of data at each level of the plurality of second bands, so as to create a model-ready table; and

joining the respective lookup table to the model-ready table on matching hashes of the first and second hashes.

19. The tangible, non-transitory computer-readable media of claim 18 , wherein, for each of the one or more lookup tables, the respective lookup table comprises one or more predicted values for each of the first hashes.

20. The tangible, non-transitory computer-readable media of claim 19 , wherein the program instructions are further configured, when executed, to cause a computing system to perform functions comprising:

receiving a user prediction request from a user device;

generating a prediction report based on at least one lookup table of the one or more lookup tables; and

transmitting the prediction report to the user device.

Assignments (2)
SECURITY INTEREST Recorded Jun 1, 2026
From: CLARIFY HEALTH SOLUTIONS, INC.; LOYAL HEALTH HOLDINGS, INC.; LOYAL HEALTH, LLC
To: SYMBIOTIC CAPITAL AGENCY LLC, AS COLLATERAL AGENT
Reel/Frame 074811/0625 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 2, 2024
From: ROGERS, PHILLIP H.; WARD, JONATHAN B.; POUDEL, RASHMI; BARRY, EMILY; GOMEZ TELLEZ, MELINDA SUE; VIJENDRA, PRAJWAL; GHADOOSHAHY, AZRIEL SION; SUN, EMMET
To: CLARIFY HEALTH SOLULTIONS, INC.
Reel/Frame 068770/0089 →
Continuity (1)
Continuation 18428964 · Jan 31, 2024
References Cited (249)
US 6381576B1 · Gilbert · 2002 [cited by applicant]
US 6687685B1 · Sadeghi · 2004 [cited by applicant]
US 7685000B1 · Petit · 2010 [cited by applicant]
US 7809585B1 · Ghouri · 2010 [cited by applicant]
US 7917377B2 · Rao · 2011 [cited by applicant]
US 8412537B1 · Fenton · 2013 [cited by applicant]
US 8489412B1 · Gliklich · 2013 [cited by applicant]
US 8508336B2 · Giobbi · 2013 [cited by applicant]
US 8732096B1 · Glukhov · 2014 [cited by applicant]
US 8805759B1 · Cha · 2014 [cited by applicant]
US 9002719B2 · Tofte · 2015 [cited by applicant]
US 9087294B2 · Kojaku · 2015 [cited by applicant]
US 9195732B2 · Anderson et al. · 2015 [cited by applicant]
US 9202253B2 · Macoviak · 2015 [cited by applicant]
US 9536052B2 · Amarasingham · 2017 [cited by applicant]
US 9607058B1 · Gupta · 2017 [cited by applicant]
US 9619841B2 · DiRienzo · 2017 [cited by applicant]
US 9953372B1 · Dziabiak · 2018 [cited by applicant]
US 9996666B1 · Wilson · 2018 [cited by applicant]
US 10102926B1 · Leonardi · 2018 [cited by applicant]
US 10127234B1 · Krishnan · 2018 [cited by applicant]
US 10262374B2 · Sultan · 2019 [cited by applicant]
US 10643749B1 · Warren · 2020 [cited by applicant]
US 10643751B1 · Drouin · 2020 [cited by applicant]
US 10650928B1 · Larson · 2020 [cited by applicant]
US 10726359B1 · Drouin · 2020 [cited by applicant]
US 10734101B2 · Rajan · 2020 [cited by applicant]
US 10783998B1 · Perlin · 2020 [cited by applicant]
US 10811139B1 · Wang · 2020 [cited by applicant]
US 10910107B1 · Larson · 2021 [cited by applicant]
US 10910113B1 · Drouin · 2021 [cited by applicant]
US 10923233B1 · Wang · 2021 [cited by applicant]
US 10990904B1 · Drouin · 2021 [cited by applicant]
US 10998104B1 · Warner · 2021 [cited by applicant]
US 11017761B2 · Peng · 2021 [cited by applicant]
US 11157808B2 · Wetta · 2021 [cited by applicant]
US 11238469B1 · Talvola · 2022 [cited by applicant]
US 11270785B1 · Talvola · 2022 [cited by applicant]
US 11302426B1 · Winlo · 2022 [cited by applicant]
US 11527313B1 · Talvola · 2022 [cited by applicant]
US 11605465B1 · Larson · 2023 [cited by applicant]
US 11621085B1 · Gottula · 2023 [cited by applicant]
US 11625789B1 · Drouin · 2023 [cited by applicant]
US 11636497B1 · Talvola · 2023 [cited by applicant]
US 11676070B1 · Snyder · 2023 [cited by examiner]
US 11694119B1 · Snyder · 2023 [cited by examiner]
US 11720555B1 · Snyder · 2023 [cited by examiner]
US 11742091B1 · Gottula · 2023 [cited by applicant]
US 11748820B1 · Drouin · 2023 [cited by applicant]
US 11763950B1 · Larson · 2023 [cited by applicant]
US 11880368B2 · Kondiles · 2024 [cited by applicant]
US 11922289B1 · Segars · 2024 [cited by applicant]
US 12056911B1 · Shalev · 2024 [cited by examiner]
US 12079230B1 · Rogers · 2024 [cited by examiner]
US 20020087358A1 · Gilbert · 2002 [cited by applicant]
US 20050038669A1 · Sachdeva · 2005 [cited by applicant]
US 20050137912A1 · Rao · 2005 [cited by applicant]
US 20050222867A1 · Underwood · 2005 [cited by applicant]
US 20060052945A1 · Rabinowitz et al. · 2006 [cited by applicant]
US 20060080139A1 · Mainzer · 2006 [cited by applicant]
US 20060161456A1 · Baker · 2006 [cited by applicant]
US 20060178915A1 · Chao · 2006 [cited by applicant]
US 20070005154A1 · Lancaster · 2007 [cited by applicant]
US 20070260492A1 · Feied · 2007 [cited by applicant]
US 20080010097A1 · Williams · 2008 [cited by applicant]
US 20080120133A1 · Krishnaswami · 2008 [cited by applicant]
US 20080146893A1 · Levendowski · 2008 [cited by applicant]
US 20080183508A1 · Harker · 2008 [cited by applicant]
US 20080201172A1 · McNamar · 2008 [cited by applicant]
US 20090006419A1 · Savitsky · 2009 [cited by applicant]
US 20090048877A1 · Binns · 2009 [cited by applicant]
US 20090192828A1 · Yunker · 2009 [cited by applicant]
US 20090206992A1 · Giobbi · 2009 [cited by applicant]
US 20090222290A1 · Crowe · 2009 [cited by applicant]
US 20110112871A1 · Simonowski · 2011 [cited by applicant]
US 20110166883A1 · Palmer · 2011 [cited by applicant]
US 20110213625A1 · Joao · 2011 [cited by applicant]
US 20110270630A1 · Green, III · 2011 [cited by applicant]
US 20110289035A1 · Stojadinovic et al. · 2011 [cited by applicant]
US 20120047105A1 · Saigal · 2012 [cited by applicant]
US 20120078659A1 · Ashrafzadeh · 2012 [cited by applicant]
US 20120179478A1 · Ross · 2012 [cited by applicant]
US 20120271612A1 · Barsoum · 2012 [cited by applicant]
US 20120310661A1 · Greene · 2012 [cited by applicant]
US 20130054259A1 · Wojtusiak · 2013 [cited by applicant]
US 20130096937A1 · Campbell · 2013 [cited by applicant]
US 20130159023A1 · Srinivas · 2013 [cited by applicant]
US 20130179380A1 · Kojaku · 2013 [cited by applicant]
US 20130197936A1 · Willich · 2013 [cited by applicant]
US 20130226624A1 · Blessman · 2013 [cited by applicant]
US 20130290028A1 · McGuigan · 2013 [cited by applicant]
US 20130290037A1 · Hu · 2013 [cited by applicant]
US 20130304618A1 · Mastrogiovanni · 2013 [cited by applicant]
US 20140046682A1 · Soto · 2014 [cited by applicant]
US 20140058755A1 · Macoviak · 2014 [cited by applicant]
US 20140058763A1 · Zizzamia · 2014 [cited by applicant]
US 20140067406A1 · Hyatt · 2014 [cited by applicant]
US 20140081652A1 · Klindworth · 2014 [cited by applicant]
US 20140095201A1 · Farooq · 2014 [cited by applicant]
US 20140122100A1 · Fillmore · 2014 [cited by applicant]
US 20140316810A1 · Oliver · 2014 [cited by applicant]
US 20150088541A1 · Yao · 2015 [cited by applicant]
US 20150095069A1 · Waljee · 2015 [cited by applicant]
US 20150100336A1 · Ford · 2015 [cited by applicant]
US 20150127370A1 · Comelis · 2015 [cited by applicant]
US 20150213223A1 · Amarasingham · 2015 [cited by applicant]
US 20150213225A1 · Amarasingham · 2015 [cited by applicant]
US 20150242583A1 · Edson · 2015 [cited by applicant]
US 20150261922A1 · Nawana · 2015 [cited by applicant]
US 20150302178A1 · Patel · 2015 [cited by applicant]
US 20150347705A1 · Simon · 2015 [cited by applicant]
US 20160048766A1 · McMahon · 2016 [cited by applicant]
US 20160048780A1 · Sethumadhavan · 2016 [cited by applicant]
US 20160063212A1 · Monier · 2016 [cited by applicant]
US 20160071171A1 · Cancelliere · 2016 [cited by applicant]
US 20160078578A1 · Tumma · 2016 [cited by applicant]
US 20160092641A1 · Delaney · 2016 [cited by applicant]
US 20160098533A1 · Jackson · 2016 [cited by applicant]
US 20160132646A1 · Jones · 2016 [cited by applicant]
US 20160154937A1 · Hennenfent · 2016 [cited by applicant]
US 20160171177A1 · Caffarel · 2016 [cited by applicant]
US 20160196398A1 · Vivero · 2016 [cited by applicant]
US 20160328526A1 · Park · 2016 [cited by applicant]
US 20170006135A1 · Siebel · 2017 [cited by applicant]
US 20170017760A1 · Freese · 2017 [cited by applicant]
US 20170029894A1 · Damask · 2017 [cited by applicant]
US 20170053080A1 · Geppert · 2017 [cited by applicant]
US 20170100213A1 · Kuo · 2017 [cited by applicant]
US 20170103180A1 · Jiao · 2017 [cited by applicant]
US 20170103181A1 · Czerska · 2017 [cited by applicant]
US 20170161439A1 · Raduchel · 2017 [cited by applicant]
US 20170169173A1 · Snow, Jr. · 2017 [cited by applicant]
US 20170236063A1 · Dorris · 2017 [cited by applicant]
US 20170249434A1 · Brunner · 2017 [cited by applicant]
US 20170270257A1 · St. Clair · 2017 [cited by applicant]
US 20170293722A1 · Valverde, Jr. · 2017 [cited by applicant]
US 20170308650A1 · Brill · 2017 [cited by applicant]
US 20170308652A1 · Ligon · 2017 [cited by applicant]
US 20170308981A1 · Razavian · 2017 [cited by applicant]
US 20170351821A1 · Tanner · 2017 [cited by applicant]
US 20170372028A1 · Zhou · 2017 [cited by applicant]
US 20180011976A1 · Lewis · 2018 [cited by applicant]
US 20180025126A1 · Barnard · 2018 [cited by applicant]
US 20180060521A1 · Connolly · 2018 [cited by applicant]
US 20180060744A1 · Achin · 2018 [cited by applicant]
US 20180089376A1 · Tucker · 2018 [cited by applicant]
US 20180137247A1 · Bore · 2018 [cited by applicant]
US 20180182475A1 · Cossler · 2018 [cited by applicant]
US 20180211727A1 · Zarkoob · 2018 [cited by applicant]
US 20180268320A1 · Shekhar · 2018 [cited by applicant]
US 20180277246A1 · Zhong · 2018 [cited by applicant]
US 20180289387A1 · Khajavi · 2018 [cited by applicant]
US 20180321412A1 · Wang et al. · 2018 [cited by applicant]
US 20180336638A1 · Dziabiak · 2018 [cited by applicant]
US 20180336639A1 · Dziabiak · 2018 [cited by applicant]
US 20180336640A1 · Dziabiak · 2018 [cited by applicant]
US 20180342323A1 · Shankar · 2018 [cited by applicant]
US 20180344215A1 · Ohnemus · 2018 [cited by applicant]
US 20190005115A1 · Warrier · 2019 [cited by applicant]
US 20190005195A1 · Peterson · 2019 [cited by applicant]
US 20190005410A1 · Shekhar · 2019 [cited by applicant]
US 20190034590A1 · Oren · 2019 [cited by applicant]
US 20190043605A1 · Hegarty · 2019 [cited by applicant]
US 20190080416A1 · Smith · 2019 [cited by applicant]
US 20190172564A1 · Chandra · 2019 [cited by applicant]
US 20190244683A1 · Francois · 2019 [cited by applicant]
US 20190272602A1 · Ray · 2019 [cited by applicant]
US 20190311812A1 · Sweeney · 2019 [cited by applicant]
US 20190325995A1 · Malone · 2019 [cited by applicant]
US 20190333636A1 · Bennett · 2019 [cited by applicant]
US 20190355481A1 · Lamb · 2019 [cited by applicant]
US 20200005080A1 · Cogan · 2020 [cited by applicant]
US 20200058403A1 · Barrett · 2020 [cited by applicant]
US 20200066253A1 · Peng · 2020 [cited by applicant]
US 20200075139A1 · Master · 2020 [cited by applicant]
US 20200105413A1 · Vladimirova · 2020 [cited by applicant]
US 20200111545A1 · Syeda-Mahmood · 2020 [cited by applicant]
US 20200152320A1 · Ghazeleh · 2020 [cited by applicant]
US 20200152332A1 · Yang · 2020 [cited by applicant]
US 20200160998A1 · Ward · 2020 [cited by applicant]
US 20200176119A1 · Spagnolo · 2020 [cited by applicant]
US 20200211692A1 · Kalafut · 2020 [cited by applicant]
US 20200227172A1 · Perkins · 2020 [cited by applicant]
US 20200253547A1 · Harris · 2020 [cited by applicant]
US 20200258511A1 · Barkol · 2020 [cited by applicant]
US 20200279635A1 · Letterie · 2020 [cited by applicant]
US 20200286616A1 · Dunn · 2020 [cited by applicant]
US 20200293887A1 · De Brouwer · 2020 [cited by applicant]
US 20200311300A1 · Callcut · 2020 [cited by applicant]
US 20210076960A1 · Fornwalt · 2021 [cited by applicant]
US 20210082554A1 · Kalia · 2021 [cited by applicant]
US 20210193320A1 · Shukla · 2021 [cited by applicant]
US 20210225463A1 · Knighton · 2021 [cited by applicant]
US 20210241905A1 · Hoar · 2021 [cited by applicant]
US 20210350910A1 · Dastmalchi · 2021 [cited by applicant]
US 20210391079A1 · Clifton · 2021 [cited by applicant]
US 20220051773A1 · Appelbaum · 2022 [cited by applicant]
US 20220414108A1 · Strelzoff · 2022 [cited by applicant]
US 20230236882A1 · Satyarthi · 2023 [cited by applicant]
US 20230394039A1 · Transier · 2023 [cited by applicant]
US 20240071598A1 · Neumann · 2024 [cited by applicant]
US 20240273105A1 · Martigny · 2024 [cited by examiner]
US 20240303245A1 · Fateev · 2024 [cited by examiner]
CN 101689220 · 2010 [cited by applicant]
EP 3471107 · 2019 [cited by applicant]
WO 2016094330 · 2016 [cited by applicant]
WO 2016201212 · 2016 [cited by applicant]
WO 2018149397 · 2018 [cited by applicant]
WO 2020089576 · 2020 [cited by applicant]
WO 2021003485 · 2021 [cited by applicant]
Sheth et al., Active Semantic Electronic Medical Records, 5th Int'l Semantic Web Conference, Athens, GA, Nov. 6-Nov. 9, 2006. [cited by applicant]
Thesmar et al., “Combining the Power of Artificial Intelligence with the Richness of Healthcare Claims Data: Opportunities and Challenges” Mar. 8, 2019, PharmoEconomics, No. 37, pp. 745-752. [cited by applicant]
Luo et al., “Automating Construction of Machine Learning Models with Clinical Big Data: Proposal Rationale and Methods” Aug. 29, 2017, J MIR Res Protoc, vol. 6, No. 8, pp. 1-18. [cited by applicant]
Bjarnadottir, Margret Vilborg, “Data-Driven Approach to Health Care: Applications Using Claims Data” Sep. 2008, Doctoral Thesis, MIT, pp. 1-130. [cited by applicant]
Lix et al., “A Prediction model to estimate completeness of electronic physician claims databases” May 11, 2015, BMJ Open, pp. 1-8. [cited by applicant]
Bertsimas et al., “Algorithmic Prediction of Health-Care Costs” Dec. 2008, Operations Research, vol. 56, No. 6, pp. 1382-1392. [cited by applicant]
Xie et al., “Predicting Days in Hospital Using Health Insurance Claims” Jul. 2015, IEEE Journal of Biomedical and Health Informatics, vol. 19, No. 4, pp. 1224-1233. [cited by applicant]
Hamad et al., “Using ‘Big Data’ to Capture Overall Health Status: Properties and Predictive Value of a Claims-Based Health Risk Score” May 7, 2015, PLoS One, vol. 10, No. 5, pp. 1-14. [cited by applicant]
Yen et al., “Association Between Wellness Score from a Health Risk Appraisal and Prospective Medical Claims Costs” Oct. 2003, JOEM, vol. 45, No. 10, pp. 1049-1057. [cited by applicant]
Sushmita et al., “Population Cost Prediction on Public Healthcare Datasets” May 18-20, 2015, pp. 87-94. [cited by applicant]
Sears et al., “Predicting work-related disability and medical cost outcomes: A comparison of severity scoring methods” Dec. 28, 2012 , Injury, Int J Care Injured, vol. 45, pp. 16-22. [cited by applicant]
Ramamurthy et al., “A Configurable, Big Data System for On-Demand Healthcare Cost Prediction” 2017, IEEE International Conference on Big Data, pp. 1524-1533. [cited by applicant]
Layton, “Risk Selection and Risk Adjustment in Competitive Health Insurance Markets” 2014, Doctoral Dissertation, Boston University, pp. 1-179. [cited by applicant]
Wang, “Competition in the Market of Health Insurance and Health Care Utilization”, 2017, Doctoral Dissertation, Boston University, pp. 1-123. [cited by applicant]
Zou et al., “Regularization and variable selection via the elestic net,” J. of the Royal Statistical Soc., Series B (statistical methodology), 67:2, pp. 301-320 (2005). [cited by applicant]
Jung et al., “Predicting need for advanced illness or palliative care in a primary care population using electronic health record data,” J. Biomedical Informatics 92(2019) 103115. [cited by applicant]
Khalifa et al., “Utilizing health analytics in improving the performance of healthcare services: A case study on a tertiary care hospital,” J. of Infection and Public Health (2016) 9, 757-765. [cited by applicant]
Silverio et al., “Big Health Data and Cardiovascular Diseases: A Challenge for Research, an Opportunity for Clinical Care” Feb. 25, 2019, Frontiers in Medicine, vol. 6, Art 36, pp. 1-10. [cited by applicant]
Lentz et al., “Prediction of healthcare utilization following an episode of physical therapy for musculoskeletal pain” 2018, BMC Health Services Research, pp. 1-14. [cited by applicant]
Johnson et al., “Machine Learning and Decision Support in Critical Care” Jan. 19, 2016, Proceedings of the IEEE, vol. 104, No. 2, pp. 444-466. [cited by applicant]
Akhmetov et al., “Assessing value of innovative molecular diagnostic tests in the concept of predictive, preventative, and personalized medicine” 2015, EPMA Journal, pp. 1-12. [cited by applicant]
Lipton et al., “Modeling Missing Data in Clinical Time Series with RN Ns” Nov. 11, 2016, Proceedings of Machine Learning for Healthcare. [cited by applicant]
Liu et al., “Learning Hierarchical Representations of Electronic Health Records for Clinical Outcome Prediction” Mar. 20, 2019. [cited by applicant]
Nezhad et al., “A Predictive Approach Using Deep Feature Learning for Electronic Medical Records: A Comparative Study” (Jan. 2019), pp. 1-24. [cited by applicant]
Reyes-Garcia et al., “Evaluation of the Impact of Data Uncertainty on the Prediction of Physiological Patient Deterioration” 2018, IEEE, pp. 38595-38606. [cited by applicant]
Razzaghi et al., “Multilevel Weighted Support Vector Machine for Classification on Healthcare Data with Missing Values” Apr. 7, 2016, pp. 1-20. [cited by applicant]
Rhon et al., “Leveraging healthcare utilization to explore outcomes from musculoskeletal disorders: methodology for defining relevant variables from a health services data repository” 2018, pp. 1-11. [cited by applicant]
Jiang et al., “Cost-Sensitive Parallel Learning Framework for Insurance Intelligence Operation,” Oct. 10, 2018. [cited by applicant]
Kanchinadam et al., “Using Discriminative Graphical Models for Insurance Recommender Systems,” Dec. 17, 2018, pp. 421-428. [cited by applicant]
Beam et al., “Clinical Concept Embeddings Learned from Massive Sources of Multimodal Medical Data,” May 18, 2018, pp. 1-11. [cited by applicant]
Henckaerts et al., “Tree-based machine learning for insurance pricing”, Sep. 11, 2018. [cited by applicant]
Liu et al., “FADL: Federated-Autonomous Deep Learning for Distributed Electronic Health Record,” Dec. 3, 2018, pp. 1-5. [cited by applicant]
Huang et al., “ClinicalBERT: Modeling Clinical Notes and Predicting Hospital Readmission,” Apr. 10, 2019. [cited by applicant]
Wang et Xu, “Inpatient2Vec: Medical Representation Learning for Inpatients,” Apr. 18, 2019. [cited by applicant]
Zhang et al., “MetaPred: Meta-Learning for Clinical Risk Prediction with Limited Patient Electronic Health Records,” May 8, 2019. [cited by applicant]
Zhang et al., Patient2Vec: A Personalized Interpretable Deep Representation of the Longitudinal Electronic Health Record, Oct. 25, 2018, pp. 1-14. [cited by applicant]
Bai et al., “Interpretable Representation Learning for Healthcare via Capturing Disease Progression through Time,” Aug. 2018, pp. 43-51. [cited by applicant]
Fadhil, Ahmed “A Conversational Interface to Improve Medication Adherence: Towards AI Support in Patient's Treatment,” 2018. [cited by applicant]
De Brouwer et al., System and Method with Federated Learning Model for Medical Research Applications, U.S. Appl. No. 62/816,880, filed Mar. 11, 2019. [cited by applicant]