IP Library › Granted Patent US 12,499,982
Granted Patent B2
US 12,499,982 · App. 18/761,902 · Granted Dec 16, 2025

System and method for record linkage

Inventors: Douglas S. McNair (Seattle, WA); Kanakasabha Kailasam (Olathe, KS); John Christopher Murrish (Overland Park, KS)
Assignee: Cerner Innovation, Inc.
G16H10/60G16H80/00
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,499,982
App. No.
18/761,902
Granted
Dec 16, 2025
Kind
B2
Abstract

Methods, systems, and computer-readable media are provided for facilitating record matching and entity resolution and for enabling improvements in record linkage. A power-spectrum-based temporal pattern-specific weight may be incorporated into record linkage methods to enhance the record linkage accuracy and statistical performance. For example, in embodiments, a value-specific weight may be calculated from a population-based frequency of field-specific values and provides an opportunity to capture and measure the relative importance of specific values found in a field. A timeseries-derived Bayesian power spectrum weight may be calculated from the population-based frequency of temporal pattern-specific values in terms of intensities at various frequencies of the power spectrum computed from the timeseries, and further provides an opportunity to capture and measure the relative importance of specific sequences of care episodes.

Claims (53)

1 . A computer-implemented method comprising:

receiving a target record from a first record system, the target record comprising one or more first date-time variables associated with a target patient, wherein each of the one or more first date-time variables identifies a date and/or time;

receiving a candidate record from a second record system, the candidate record comprising a second date-time variable for an episode associated with the target patient, wherein the second date-time variable identifies a date and/or time;

generating a power spectrum based on the first date-time variable and the second date-time variable;

predicting, based on at least one demographic characteristic of a subject, a record linkage weight based on a similarity of a demographic variable associated with the candidate record and the target record;

determining, based on the record linkage weight and the power spectrum, that the candidate record is related to the target record; and

generating a result that is based on the candidate record being linked to the target record.

2 . The computer-implemented method of claim 1 , further comprising:

outputting the result.

3 . The computer-implemented method of claim 1 , further comprising:

determining a power spectra weight based on a characteristic of the power spectrum and a corresponding reference characteristic generated using a set of reference power spectra, wherein determining that the candidate record is related to the target record is based on the record linkage weight and the power spectra weight.

4 . The computer-implemented method of claim 3 , further comprising:

determining a composite weight of the record linkage weight and the power spectra weight, wherein determining that the candidate record is related to the target record comprises determining that the composite weight satisfies a threshold.

5 . The computer-implemented method of claim 3 , wherein determining the power spectra weight comprises:

determining a likelihood value of each spectrum of the set of reference power spectra; and

normalizing the determined likelihood values.

6 . The computer-implemented method of claim 3 , wherein the set of reference power spectra are generated using a Bayesian Markov Chain Monte Carlo simulation.

7 . The computer-implemented method of claim 1 , wherein the second date-time variable comprises a date-time value associated with a most recent episode stored in association with the candidate record.

8 . The computer-implemented method of claim 1 , wherein the first and second record systems comprise the same record system.

9 . The computer-implemented method of claim 1 , further comprising:

presenting, via an interface, an indication that the candidate record is related to the target record.

10 . A system comprising:

one or more data processors; and

a non-transitory computer readable storage medium containing instructions which, when executed on the one or more data processors, cause the one or more data processors to perform a set of actions including:

receiving a target record from a first record system, the target record comprising one or more first date-time variables associated with a target patient, wherein each of the one or more first date-time variables identifies a date and/or time;

receiving a candidate record from a second record system, the candidate record comprising a second date-time variable for an episode associated with the target patient, wherein the second date-time variable identifies a date and/or time;

generating a power spectrum based on the first date-time variable and the second date-time variable;

predicting, based on at least one demographic characteristic of a subject, a record linkage weight based on a similarity of a demographic variable associated with the candidate record and the target record;

determining, based on the record linkage weight and the power spectrum, that the candidate record is related to the target record; and

generating a result that is based on the candidate record being linked to the target record.

11 . The system of claim 10 , wherein the set of actions further includes:

outputting the result.

12 . A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause one or more data processors to perform a set of actions including:

receiving a target record from a first record system, the target record comprising one or more first date-time variables associated with a target patient, wherein each of the one or more first date-time variables identifies a date and/or time;

receiving a candidate record from a second record system, the candidate record comprising a second date-time variable for an episode associated with the target patient, wherein the second date-time variable identifies a date and/or time;

generating a power spectrum based on the first date-time variable and the second date-time variable;

predicting, based on at least one demographic characteristic of a subject, a record linkage weight based on a similarity of a demographic variable associated with the candidate record and the target record;

determining, based on the record linkage weight and the power spectrum, that the candidate record is related to the target record; and

generating a result that is based on the candidate record being linked to the target record.

13 . The computer-program product of claim 12 , wherein the set of actions further includes:

outputting the result.

14 . The computer-program product of claim 12 , wherein the set of actions further includes:

determining a power spectra weight based on a characteristic of the power spectrum and a corresponding reference characteristic generated using a set of reference power spectra, wherein determining that the candidate record is related to the target record is based on the record linkage weight and the power spectra weight.

15 . The computer-program product of claim 14 , wherein the set of actions further includes:

determining a composite weight of the record linkage weight and the power spectra weight, wherein determining that the candidate record is related to the target record comprises determining that the composite weight satisfies a threshold.

16 . The computer-program product of claim 14 , wherein determining the power spectra weight comprises:

determining a likelihood value of each spectrum of the set of reference power spectra; and

normalizing the determined likelihood values.

17 . The computer-program product of claim 14 , wherein the set of reference power spectra are generated using a Bayesian Markov Chain Monte Carlo simulation.

18 . The computer-program product of claim 12 , wherein the second date-time variable comprises a date-time value associated with a most recent episode stored in association with the candidate record.

19 . The computer-program product of claim 12 , wherein the first and second record systems comprise the same record system.

20 . The computer-program product of claim 12 , wherein the set of actions further includes:

presenting, via an interface, an indication that the candidate record is related to the target record.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 16, 2024
From: MCNAIR, DOUGLAS S.; KAILASAM, KANAKASABHA; MURRISH, JOHN CHRISTOPHER
To: CERNER INNOVATION, INC.
Reel/Frame 067998/0861 →
Continuity (7)
Continuation 18359777 · Jul 26, 2023
Continuation 17740751 · May 10, 2022
Continuation 16793870 · Feb 18, 2020
Continuation 16237206 · Dec 31, 2018
Continuation 13874961 · May 1, 2013
Provisional Application 61641097 · May 1, 2012
Related Publication 20240355440A1 · Oct 24, 2024
References Cited (304)
US 4839853A · Deerwester et al. · 1989 [cited by applicant]
US 5243565A · Yamamoto · 1993 [cited by applicant]
US 5301109A · Landauer et al. · 1994 [cited by applicant]
US 5664109A · Johnson et al. · 1997 [cited by applicant]
US 5809494A · Nguyen · 1998 [cited by applicant]
US 5835900A · Fagg, III et al. · 1998 [cited by applicant]
US 6039688A · Douglas et al. · 2000 [cited by applicant]
US 6122628A · Castelli et al. · 2000 [cited by applicant]
US 6246964B1 · Blaunstein · 2001 [cited by applicant]
US 6246975B1 · Rivonelli et al. · 2001 [cited by applicant]
US 6247004B1 · Moukheibir · 2001 [cited by applicant]
US 6397224B1 · Zubeldia et al. · 2002 [cited by applicant]
US 6618715B1 · Johnson et al. · 2003 [cited by applicant]
US 6654740B2 · Tokuda et al. · 2003 [cited by applicant]
US 6665669B2 · Han et al. · 2003 [cited by applicant]
US 6915254B1 · Heinze et al. · 2005 [cited by applicant]
US 6996575B2 · Cox et al. · 2006 [cited by applicant]
US 7039634B2 · Xu et al. · 2006 [cited by applicant]
US 7120626B2 · Li et al. · 2006 [cited by applicant]
US 7249117B2 · Estes · 2007 [cited by applicant]
US 7386522B1 · Bigus et al. · 2008 [cited by applicant]
US 7440947B2 · Adcock et al. · 2008 [cited by applicant]
US 7447643B1 · Olson et al. · 2008 [cited by applicant]
US 7496561B2 · Caudill et al. · 2009 [cited by applicant]
US 7529765B2 · Brants et al. · 2009 [cited by applicant]
US 7555425B2 · Oon · 2009 [cited by applicant]
US 7558778B2 · Carus et al. · 2009 [cited by applicant]
US 7617078B2 · Rao et al. · 2009 [cited by applicant]
US 7640171B2 · Gendron et al. · 2009 [cited by applicant]
US 7657540B1 · Bayliss · 2010 [cited by applicant]
US 7668820B2 · Zuleba · 2010 [cited by applicant]
US 7720846B1 · Bayliss · 2010 [cited by applicant]
US 7831423B2 · Schubert · 2010 [cited by applicant]
US 7844449B2 · Lin et al. · 2010 [cited by applicant]
US 7844566B2 · Wnek · 2010 [cited by applicant]
US 7853456B2 · Soto et al. · 2010 [cited by applicant]
US 7865373B2 · Punzak et al. · 2011 [cited by applicant]
US 7899764B2 · Martin et al. · 2011 [cited by applicant]
US 7899796B1 · Borthwick et al. · 2011 [cited by applicant]
US 7900052B2 · Jonas · 2011 [cited by applicant]
US 7912842B1 · Bayliss · 2011 [cited by applicant]
US 7933909B2 · Trepetin · 2011 [cited by applicant]
US 7953685B2 · Liu et al. · 2011 [cited by applicant]
US 8015136B1 · Baker et al. · 2011 [cited by applicant]
US 8078554B2 · Fung et al. · 2011 [cited by applicant]
US 8126736B2 · Anderson et al. · 2012 [cited by applicant]
US 8160895B2 · Schmitt et al. · 2012 [cited by applicant]
US 8165893B1 · Goldberg et al. · 2012 [cited by applicant]
US 8200505B2 · Walker et al. · 2012 [cited by applicant]
US 8515777B1 · Rajasenan · 2013 [cited by applicant]
US 8539424B2 · Tetelbaum · 2013 [cited by applicant]
US 8589424B1 · Patel et al. · 2013 [cited by applicant]
US 8666785B2 · Baluta et al. · 2014 [cited by applicant]
US 8688474B2 · Walter · 2014 [cited by examiner]
US 8838628B2 · Leighton et al. · 2014 [cited by applicant]
US 8856156B1 · McNair et al. · 2014 [cited by applicant]
US 8930218B1 · Oakley et al. · 2015 [cited by applicant]
US 9375142B2 · Schultz et al. · 2016 [cited by applicant]
US 9542647B1 · Mirhaji · 2017 [cited by applicant]
US 9734146B1 · McNair et al. · 2017 [cited by applicant]
US 9892231B2 · Vdovjak · 2018 [cited by examiner]
US 10249385B1 · McNair et al. · 2019 [cited by applicant]
US 10268687B1 · McNair et al. · 2019 [cited by applicant]
US 10431336B1 · Murrish et al. · 2019 [cited by applicant]
US 10446273B1 · McNair et al. · 2019 [cited by applicant]
US 10580524B1 · McNair et al. · 2020 [cited by applicant]
US 10628553B1 · Murrish et al. · 2020 [cited by applicant]
US 10769241B1 · McNair · 2020 [cited by applicant]
US 10854334B1 · McNair et al. · 2020 [cited by applicant]
US 10946311B1 · McNair · 2021 [cited by applicant]
US 10957449B1 · McNair et al. · 2021 [cited by applicant]
US 11100933B2 · Lefkofsky et al. · 2021 [cited by applicant]
US 20020007284A1 · Schurenberg et al. · 2002 [cited by applicant]
US 20020023067A1 · Garland et al. · 2002 [cited by applicant]
US 20020032583A1 · Joao · 2002 [cited by applicant]
US 20020035486A1 · Huyn et al. · 2002 [cited by applicant]
US 20020038227A1 · Fey et al. · 2002 [cited by applicant]
US 20020038308A1 · Cappi · 2002 [cited by applicant]
US 20020042793A1 · Choi · 2002 [cited by applicant]
US 20020073138A1 · Gilbert et al. · 2002 [cited by applicant]
US 20020128860A1 · Leveque et al. · 2002 [cited by applicant]
US 20030023571A1 · Barnhill · 2003 [cited by applicant]
US 20030038308A1 · Kim · 2003 [cited by applicant]
US 20030046280A1 · Rotter et al. · 2003 [cited by applicant]
US 20030055679A1 · Soll et al. · 2003 [cited by applicant]
US 20030163057A1 · Flick et al. · 2003 [cited by applicant]
US 20030212580A1 · Shen · 2003 [cited by applicant]
US 20040064438A1 · Kostoff · 2004 [cited by applicant]
US 20040199332A1 · Iliff · 2004 [cited by applicant]
US 20040230105A1 · Geva et al. · 2004 [cited by applicant]
US 20040260666A1 · Pestotnik et al. · 2004 [cited by applicant]
US 20050004895A1 · Schurenberg · 2005 [cited by examiner]
US 20050027562A1 · Brown · 2005 [cited by applicant]
US 20050049497A1 · Krishnan et al. · 2005 [cited by applicant]
US 20050055246A1 · Simon · 2005 [cited by applicant]
US 20050119534A1 · Trost et al. · 2005 [cited by applicant]
US 20050144042A1 · Joffe et al. · 2005 [cited by applicant]
US 20050256740A1 · Kohan et al. · 2005 [cited by applicant]
US 20050272984A1 · Huiku · 2005 [cited by applicant]
US 20050288910A1 · Schlessinger et al. · 2005 [cited by applicant]
US 20060020465A1 · Cousineau et al. · 2006 [cited by applicant]
US 20060036619A1 · Fuerst et al. · 2006 [cited by applicant]
US 20060064447A1 · Malkov · 2006 [cited by applicant]
US 20060074824A1 · Li · 2006 [cited by applicant]
US 20060129427A1 · Wennberg · 2006 [cited by applicant]
US 20060161457A1 · Rapaport et al. · 2006 [cited by applicant]
US 20060173663A1 · Langheier et al. · 2006 [cited by applicant]
US 20060179050A1 · Giang et al. · 2006 [cited by applicant]
US 20060205564A1 · Peterson · 2006 [cited by applicant]
US 20060206027A1 · Malone · 2006 [cited by applicant]
US 20060206359A1 · Stang · 2006 [cited by applicant]
US 20060218010A1 · Michon et al. · 2006 [cited by applicant]
US 20060265253A1 · Rao et al. · 2006 [cited by applicant]
US 20060271556A1 · Mukherjee et al. · 2006 [cited by applicant]
US 20070005621A1 · Lesh et al. · 2007 [cited by applicant]
US 20070026365A1 · Friedrich et al. · 2007 [cited by applicant]
US 20070031873A1 · Wang et al. · 2007 [cited by applicant]
US 20070094048A1 · Grichnik · 2007 [cited by applicant]
US 20070106533A1 · Greene · 2007 [cited by applicant]
US 20070106752A1 · Moore · 2007 [cited by applicant]
US 20070233391A1 · Milstein et al. · 2007 [cited by applicant]
US 20070239482A1 · Finn et al. · 2007 [cited by applicant]
US 20070244724A1 · Pendergast et al. · 2007 [cited by applicant]
US 20080021288A1 · Bowman et al. · 2008 [cited by applicant]
US 20080046292A1 · Myers et al. · 2008 [cited by applicant]
US 20080097938A1 · Guyon et al. · 2008 [cited by applicant]
US 20080131374A1 · Medich et al. · 2008 [cited by applicant]
US 20080133269A1 · Ching · 2008 [cited by applicant]
US 20080147438A1 · Kil · 2008 [cited by applicant]
US 20080147441A1 · Kil · 2008 [cited by applicant]
US 20080172214A1 · Col et al. · 2008 [cited by applicant]
US 20080172251A1 · Reichert et al. · 2008 [cited by applicant]
US 20080183454A1 · Barabasi et al. · 2008 [cited by applicant]
US 20080195422A1 · Nessinger et al. · 2008 [cited by applicant]
US 20080243548A1 · Cafer · 2008 [cited by applicant]
US 20080249376A1 · Zaleski · 2008 [cited by applicant]
US 20080255884A1 · Carus et al. · 2008 [cited by applicant]
US 20080256006A1 · Buscema et al. · 2008 [cited by applicant]
US 20080268413A1 · Leichner · 2008 [cited by applicant]
US 20080275731A1 · Rao et al. · 2008 [cited by applicant]
US 20080287746A1 · Reisman · 2008 [cited by applicant]
US 20080288292A1 · Bi et al. · 2008 [cited by applicant]
US 20080288474A1 · Chin et al. · 2008 [cited by applicant]
US 20080294692A1 · Angell et al. · 2008 [cited by applicant]
US 20080301177A1 · Doherty · 2008 [cited by applicant]
US 20080306926A1 · Friedlander et al. · 2008 [cited by applicant]
US 20090006431A1 · Agrawal et al. · 2009 [cited by applicant]
US 20090012928A1 · Lussier et al. · 2009 [cited by applicant]
US 20090112892A1 · Cardie et al. · 2009 [cited by applicant]
US 20090125333A1 · Heywood et al. · 2009 [cited by applicant]
US 20090132284A1 · Fey et al. · 2009 [cited by applicant]
US 20090164249A1 · Hunt et al. · 2009 [cited by applicant]
US 20090228303A1 · Faulkner et al. · 2009 [cited by applicant]
US 20090259493A1 · Venon et al. · 2009 [cited by applicant]
US 20090299767A1 · Michon et al. · 2009 [cited by applicant]
US 20090304246A1 · Walker et al. · 2009 [cited by applicant]
US 20090313041A1 · Eder · 2009 [cited by applicant]
US 20090318775A1 · Michelson et al. · 2009 [cited by applicant]
US 20090319295A1 · Kass-Hout et al. · 2009 [cited by applicant]
US 20100082369A1 · Prenelus et al. · 2010 [cited by applicant]
US 20100088117A1 · Belden et al. · 2010 [cited by applicant]
US 20100121883A1 · Cutting et al. · 2010 [cited by applicant]
US 20100131434A1 · Magent et al. · 2010 [cited by applicant]
US 20100131438A1 · Pandya et al. · 2010 [cited by applicant]
US 20100131482A1 · Linthicum et al. · 2010 [cited by applicant]
US 20100131883A1 · Linthicum et al. · 2010 [cited by applicant]
US 20100142774A1 · Ben-Haim et al. · 2010 [cited by applicant]
US 20100145720A1 · Reiner · 2010 [cited by applicant]
US 20100153133A1 · Angell et al. · 2010 [cited by applicant]
US 20100179818A1 · Kelly et al. · 2010 [cited by applicant]
US 20100185685A1 · Chew et al. · 2010 [cited by applicant]
US 20100198755A1 · Soll et al. · 2010 [cited by applicant]
US 20100235330A1 · Reiner · 2010 [cited by applicant]
US 20100274576A1 · Young · 2010 [cited by applicant]
US 20100293003A1 · Abbo · 2010 [cited by applicant]
US 20100299155A1 · Findlay et al. · 2010 [cited by applicant]
US 20100324938A1 · Ennett et al. · 2010 [cited by applicant]
US 20110010401A1 · Adams et al. · 2011 [cited by applicant]
US 20110015937A1 · Janas, III et al. · 2011 [cited by applicant]
US 20110046979A1 · Tulipano et al. · 2011 [cited by applicant]
US 20110067108A1 · Hoglund · 2011 [cited by applicant]
US 20110077973A1 · Breitenstein et al. · 2011 [cited by applicant]
US 20110087501A1 · Severin · 2011 [cited by applicant]
US 20110093467A1 · Sharp et al. · 2011 [cited by applicant]
US 20110119089A1 · Carlisle · 2011 [cited by applicant]
US 20110161110A1 · Mault · 2011 [cited by applicant]
US 20110201900A1 · Zhang et al. · 2011 [cited by applicant]
US 20110225001A1 · Shen · 2011 [cited by applicant]
US 20110246238A1 · Vdovjak et al. · 2011 [cited by applicant]
US 20110270629A1 · Abbo · 2011 [cited by applicant]
US 20110295621A1 · Farooq et al. · 2011 [cited by applicant]
US 20110306845A1 · Osorio · 2011 [cited by applicant]
US 20120016685A1 · Ryan et al. · 2012 [cited by applicant]
US 20120020536A1 · Moehrle · 2012 [cited by applicant]
US 20120047105A1 · Saigal et al. · 2012 [cited by applicant]
US 20120059779A1 · Syed et al. · 2012 [cited by applicant]
US 20120072235A1 · Varadarajan et al. · 2012 [cited by applicant]
US 20120078127A1 · McDonald et al. · 2012 [cited by applicant]
US 20120086963A1 · Fujitsuka et al. · 2012 [cited by applicant]
US 20120089420A1 · Hoffman et al. · 2012 [cited by applicant]
US 20120089421A1 · Hoffman et al. · 2012 [cited by applicant]
US 20120109685A1 · Carter et al. · 2012 [cited by applicant]
US 20120110016A1 · Phillips · 2012 [cited by applicant]
US 20120173475A1 · Ash et al. · 2012 [cited by applicant]
US 20120174014A1 · Ash et al. · 2012 [cited by applicant]
US 20120174018A1 · Ash et al. · 2012 [cited by applicant]
US 20120175475A1 · McErlane · 2012 [cited by applicant]
US 20120185275A1 · Loghmani · 2012 [cited by applicant]
US 20120203575A1 · Tulipano et al. · 2012 [cited by applicant]
US 20120203576A1 · Bucur et al. · 2012 [cited by applicant]
US 20120215784A1 · King et al. · 2012 [cited by applicant]
US 20120232930A1 · Schmidt et al. · 2012 [cited by applicant]
US 20130006911A1 · Christie, IV et al. · 2013 [cited by applicant]
US 20130023434A1 · Laar · 2013 [cited by applicant]
US 20130031613A1 · Shanabrook et al. · 2013 [cited by applicant]
US 20130046529A1 · Grain et al. · 2013 [cited by applicant]
US 20130046558A1 · Landi et al. · 2013 [cited by applicant]
US 20130080192A1 · Bucur et al. · 2013 [cited by applicant]
US 20130110547A1 · Englund et al. · 2013 [cited by applicant]
US 20130110548A1 · Kutty · 2013 [cited by applicant]
US 20130132308A1 · Boss et al. · 2013 [cited by applicant]
US 20130132312A1 · Lee et al. · 2013 [cited by applicant]
US 20130132323A1 · Soto et al. · 2013 [cited by applicant]
US 20130158968A1 · Ash et al. · 2013 [cited by applicant]
US 20130197938A1 · Bayouk et al. · 2013 [cited by applicant]
US 20130245389A1 · Schultz et al. · 2013 [cited by applicant]
US 20140081652A1 · Klindworth · 2014 [cited by applicant]
US 20140095184A1 · Gotz et al. · 2014 [cited by applicant]
US 20140095186A1 · Gotz et al. · 2014 [cited by applicant]
US 20140180699A1 · Massa et al. · 2014 [cited by applicant]
US 20140181128A1 · Riskin et al. · 2014 [cited by applicant]
US 20140200414A1 · Osorio · 2014 [cited by applicant]
US 20140336539A1 · Torres et al. · 2014 [cited by applicant]
US 20150049947A1 · Katsaros et al. · 2015 [cited by applicant]
US 20150161329A1 · Mabotuwana et al. · 2015 [cited by applicant]
US 20150193583A1 · Mcnair et al. · 2015 [cited by applicant]
US 20150254408A1 · Mahtani et al. · 2015 [cited by applicant]
US 20150324535A1 · Ash et al. · 2015 [cited by applicant]
US 20150363559A1 · Jackson et al. · 2015 [cited by applicant]
US 20160004840A1 · Rust et al. · 2016 [cited by applicant]
US 20160063212A1 · Monier et al. · 2016 [cited by applicant]
US 20160143594A1 · Moorman et al. · 2016 [cited by applicant]
US 20170098358A1 · Bechtel et al. · 2017 [cited by applicant]
US 20170124269A1 · McNair et al. · 2017 [cited by applicant]
US 20190336085A1 · Kayser et al. · 2019 [cited by applicant]
US 20200335179A1 · Stojadinovic et al. · 2020 [cited by applicant]
US 20210177338A1 · Pagi et al. · 2021 [cited by applicant]
EP 1043666A2 · 2000 [cited by applicant]
EP 2365456A2 · 2011 [cited by applicant]
WO 2006002465A1 · 2006 [cited by applicant]
WO 2009112977A1 · 2009 [cited by applicant]
WO 2010045463A2 · 2010 [cited by applicant]
WO 2012122122A1 · 2012 [cited by applicant]
WO 2012122195A1 · 2012 [cited by applicant]
WO 2012122196A2 · 2012 [cited by applicant]
Dey et al., Efficient Techniques for Online Record Linkage, IEEE Transactions on Knowledge and Data Engineering, vol. 23, No. 3, Mar. 2011, 15 pages (Year: 2011). [cited by examiner]
Abbott et al., “Sequence Analysis and Optimal Matching Methods in Sociology, Review and Prospect”, Sociol Meth Res., vol. 29, 2000, pp. 3-33. [cited by applicant]
Abernethy et al., “Eliciting Consumer Preferences Using Robust Adaptive Choice Questionnaires”, IEEE Transactions on Knowledge and Data Engineering, vol. 20, No. 2, Feb. 2008, pp. 145-155. [cited by applicant]
Agrawal et al., “Fast Discovery of Association Rules”, Advances in Knowledge Discovery and Data Mining, Menlo Park, AAAI Press, 1996, pp. 307-328. [cited by applicant]
Appavoo et al., “Enabling Automomic Behavior in Systems Software with Hot Swapping”, IBM Systems Journal, vol. 42, No. 1, 2003, pp. 60-76. [cited by applicant]
Aronson, Alan R., “MetaMap: Mapping Text to the UMLS Metathesaurus”, 2006, 26 pages. [cited by applicant]
Arpaia et al., “Multi-Agent Remote Predictive Diagnosis of Dangerous Good Transports”, Instrumentation and Measurement Technology Conference, Proceedings of the IEEE, May 17-19, 2005, pp. 1685-1690. [cited by applicant]
Berchtold et al., “The Mixture Transition Distribution Model for High-Order Markov Chains and Non-Gaussian Time Series”, Statistical Science, vol. 17, No. 3, 2002, pp. 328-356. [cited by applicant]
Berry et al., “Care Coordination for Patients with Complex Health Profiles in Inpatient and Outpatient Settings”, Mayo Clinic Proceedings, available online at www.mayclinicproceedings.org., 2013, pp. 1-11. [cited by applicant]
Billari et al., “Timing, Sequencing, and Quantum of Life Course Events: A Machine-Learning Approach”, European Journal of Population, vol. 22, 2006, pp. 37-65. [cited by applicant]
Cohen et al., “Integrated Complex Care Coordination For Children with Medical Complexity: A Mixed-Methods Evaluation of Tertiary Care-Community Collaboration”, BMC Health Services Research, vol. 12, No. 366, Oct. 23, 20… [cited by applicant]
Cook et al., “Making Prophecies with Decision Predicates”, ACM 978-14503-0490-0/11/01, Jan. 2011, 14 pages. [cited by applicant]
Deville et al., “Correspondence Analysis with an Extension Towards Nominal Time Series”, Journal of Econometrics, vol. 22, 1983, pp. 169-189. [cited by applicant]
Dijkstra et al., “Measuring the Agreement Between Sequences”, Sociological Methods and Research, vol. 24, No. 2, Nov. 1995, pp. 214-231. [cited by applicant]
Duff, I., “Development and history of sparse direct methods”, SIAM Conference on Applied Linear Algebra, available online at http://www.numerical.rl.ac.uk/people/isd/isd.html, Oct. 26-29, 2009, 44 pages. [cited by applicant]
Dvorak et al., “Football injuries and Physical Symptoms: A Review of the Literature”, The American Journal of Sports Medicine, vol. 28, No. 5, 2000, pp. S3-S9. [cited by applicant]
Dvorak et al., “Risk Factor Analysis for Injuries in Football Players: Possibilities for a Prevention Program”, The American Journal of Sport Medicine, vol. 28, No. 5, 2000, pp. S69-S74. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/717,299, mailed Oct. 27, 2022, 13 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/819,890 mailed on Oct. 27, 2022, 17 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/011,474, mailed Oct. 12, 2022, 17 pages. [cited by applicant]
First Action Interview Office Action received for U.S. Appl. No. 16/714,221, mailed on Apr. 4, 2022, 19 pages. [cited by applicant]
Han et al., “Frequent Pattern Mining: Current status and future directions”, Data Mining and Knowledge Discovery, vol. 15, 2007, pp. 55-86. [cited by applicant]
Hawkins et al., “A Prospective Eidemiological Study of Injuries in Four English Professional Football Clubs”, Br J Sports Med., vol. 33, 1999, 196-203. [cited by applicant]
Huyse et al., “Compri-An Instrument to Detect Patients with Complex Care Needs”, Psychosomatics, vol. 42, No. 3, May-Jun. 2001, 7 pages. [cited by applicant]
John et al, “Neuro-Fuzzy Clustering of Radiographic Tibia Image Data Using Type 2 Fuzzy Sets”, Information Sciences, vol. 125, issues 1-4, 2000, ISSN 0020-0255, available online at https://www.sciencedirect.com/science/… [cited by applicant]
Junge et al., “Soccer Injuries: A Review on Incidence and Prevention”, Sports Med., vol. 34, 2004, pp. 929-938. [cited by applicant]
Kang et al., “Mining Based Decision Support Multi-agent System for Personalized e-Healthcare Service”, Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications,… [cited by applicant]
Kiran et al., “An Improved Multiple Minimum Support Based Approach to Mine Rare Association Rules”, Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, 2009, 8 pages. [cited by applicant]
Mabry et al., “Clinical Decision Support with IM-Agents and ERMA Multi-agents”, Department of Computer Science and Emergency Medicine, 2004, 6 pages. [cited by applicant]
Nealon et al., “Agent-Based Applications in Health Care”, Applications of Software Agent Technology in the Health Care Domain, 2003, pp. 1-17. [cited by applicant]
Nielsen et al., “Epidemiology and Traumatology of Injuries in Soccer”, Am J Sports Med., vol. 17, 1989, pp. 803-807. [cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 16/717,299, mailed on Apr. 27, 2022, 10 pages. [cited by applicant]
Non-Final Office Action received for U.S. Appl. No. 16/819,890, mailed on Apr. 28, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/148,039, dated Jul. 11, 2022, 10 pages. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/387,786 mailed Nov. 30, 2022. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 18/359,777, dated Apr. 12, 2024. [cited by applicant]
Ohno-Machado, L., “Realizing the full potential of electronic health records: the role of natural language processing”, Journal of American Medical Information Association., vol. 18, No. 5, Sep. 2011, p. 539. [cited by applicant]
Othman et al., “Agent Based Preprocessing”, International Conference on Intelligent and Advanced Systems, 2007, pp. 219-223. [cited by applicant]
Prados-Suarez et al., “Contextualized Access to Electronic Health Records in Cardiology”, IEEE Transactions on Information Technology in Biomedicine, vol. 16, No. 3, doi: 10.1109/TITB.2011.2178033., May 2012, pp. 401-41… [cited by applicant]
Roever, C., “Package ‘Bayesian Spectral Inference’”, r-project.org, Feb. 21, 2013, pp. 1-27. [cited by applicant]
Sariyar et al., “The RecordLinkage Package: Detecting Errors in Data”, The R Journal, vol. 2, No. 2, Dec. 2010, pp. 61-67. [cited by applicant]
Seibig et al., “Collection of Annotated Data in a Clinical Validation Study for Alarm Algorithms in Intensive Care-A Methodologic Framework”, Journal of Critical Care, vol. 25, 2010, pp. 128-135. [cited by applicant]
Shirabad et al., “Implementating an Integrative Multi-agent Clinical Decision Support System with Open Source Software”, Journal of Medical Systems 36, available online at https://doi.org/10.1007/s10916-010-9452-9, 2012… [cited by applicant]
Ta et al., Data Descriptor: Columbia Open Health Data, Clinical Concept Prevalence and Co-occurence from Electronic Health Records, Scientific data, vol. 5, 180273, doi: 10.1038/sdata.2018.273, Nov. 27, 2018, pp. 1-17. [cited by applicant]
The Comprehensive R Archive Network, R, Available online at: http://cran.r-project-org, retrieved on Feb. 27, 2020, 1 page. [cited by applicant]
Townsend, H., “Natural Language Processing and Clinical Outcomes: The Promise and Progress of NLP for Improved Care”, Journal of AHIMA, vol. 84, No. 2, available online at https://bok.ahima.org/doc?oid=106198#XOSgnSgzY2… [cited by applicant]
Uhrmacher et al., “Distributed, Parallel Simulation of Multiple, Deliberative Agents”, Proceedings of the fourteenth workshop on Parallel and distributed simulation, May 2000, pp. 101-108. [cited by applicant]
Xue et al., “Fast Query by Example of Environment Sounds via Robust and Efficient Cluster-based Indexing”, 2008, IEEE International Conference on Acoustics, Speech and Signal Processing, available online at doi: 10.1109… [cited by applicant]
Zaki, M., “Spade: An Efficient Algorithm for Mining Frequent Sequences”, Machine Learning, vol. 42, 2001, pp. 31-60. [cited by applicant]