IP Library Granted Patent US 12,217,839
Granted Patent B2
US 12,217,839 · App. 18/063,834 · Granted Feb 4, 2025

Systems and methods for medical information data warehouse management

Inventors: Vishnuvyas Sethumadhavan (Mountain View, CA); John O. Schneider (Los Gatos, CA); Darren Matthew Schulte (San Francisco, CA); Robert Derward Rogers (Pleasanton, CA)
Assignee: Apixio, LLC
G16H10/60G06F16/313G06F40/134G06F40/169G16H70/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,217,839
App. No.
18/063,834
Granted
Feb 4, 2025
Kind
B2
Abstract

Systems and methods for data warehouse management for medical information is provided. The system receives a set of medical record documents. These documents include evidence for one or more findings which are identified using natural language processing of evidence. The data set is probabilistically transformed into a structured data set (often as a table). This structured data set includes embedded links that reference the source document where the evidence is located. If the finding is supported by multiple articles of evidence, the link will direct the user to the source document with the highest confidence ranking. Evidence in the source document is highlighted and may include associated annotations. Evidence, findings and annotations may be updated by the user.

Claims (57)

1. A health information computer system comprising:

at least one memory with instructions stored thereon; and

at least one processor in communication with the at least one memory, wherein the instructions, when executed by the at least one processor, cause the at least one processor to:

receive a plurality of medical record documents;

select a model and model weights based on an annotation activity and a user, wherein the selecting includes modifying a dynamic confidence threshold based at least in part on the annotation activity, wherein the dynamic confidence threshold is applied to at least some documents of the plurality of medical record documents;

identify a finding using the model;

transform the plurality of medical record documents into a structured data set;

select a number of the plurality of medical record documents associated with the finding;

embed links into the structured data set that reference at least one medical record source document of the number of medical record documents;

identify a set of proficient coders by filtering a plurality of coders for proficiency, wherein proficiency is a metric including accuracy in an area associated with the finding and time taken to perform coding in the area:

measure a number of risk adjustment factors each proficient coder of the set of proficient coders completes per hour on average, a rate of false positive coding measured as a rate of annotation disagreement with a supervisor, and an accuracy measure comprising a degree that a given coder agrees with other coders when presented the same task;

route the structured dataset to a coder of the set of proficient coders based at least in part upon the number of risk adjustment factors; and

submit the finding for reimbursement.

2. The health information computer system of claim 1 , wherein the instructions further cause the at least one processor to rank the set of proficient coders in a ranked coder list by at least one of a risk adjustment factor of the number of risk adjustment factors, the accuracy measure, or the rate of false positive coding.

3. The health information computer system of claim 2 , wherein the instructions further cause the at least one processor to:

filter the ranked coder list to identify a best suited coder associated with the finding; and

route the structured data set to the coder, wherein the coder comprises the best suited coder.

4. The health information computer system of claim 1 , wherein the instructions further cause the at least one processor to identify the finding based on evidence from natural language processing.

5. The health information computer system of claim 1 , wherein the instructions further cause the at least one processor to:

receive a selection of one of the number of medical record documents; and

cause display of the one of the number of medical record documents.

6. The health information computer system of claim 5 , wherein the instructions further cause the at least one processor to cause display of an annotated version of the one of the number of medical record documents.

7. At least one non-transitory computer-readable storage medium with instructions stored thereon that, in response to execution by at least one processor, cause the at least one processor to:

receive a plurality of medical record documents;

select a model and model weights based on an annotation activity and a user, wherein the selecting includes modifying a dynamic confidence threshold based at least in part on the annotation activity, wherein the dynamic confidence threshold is applied to at least a portion of the plurality of medical record documents;

identify a finding using the model;

transform the plurality of medical record documents into a structured data set;

select a number of the plurality of medical record documents associated with the finding;

embed links into the structured data set that reference at least one medical record source document of the number of medical record documents;

identify a set of proficient coders by filtering a plurality of coders for proficiency, wherein proficiency is a metric including accuracy in an area associated with the finding and time taken to perform coding in the area;

measure a number of risk adjustment factors each proficient coder of the set of proficient coders completes per hour on average, a rate of false positive coding measured as a rate of annotation disagreement with a supervisor, and an accuracy measure comprising a degree that a given coder agrees with other coders when presented the same task;

route the structured data set to a coder of the set of proficient coders based at least in part upon the number of risk adjustment factors; and

submit the finding for reimbursement.

8. The at least one non-transitory computer-readable storage medium of claim 7 , wherein the instructions further cause the at least one processor to rank the set of proficient coders in a ranked coder list by at least one of a risk adjustment factor of the number of risk adjustment factors, the accuracy measure, or the rate of false positive coding.

9. The at least one non-transitory computer-readable storage medium of claim 8 , wherein the instructions further cause the at least one processor to:

filter the ranked coder list to identify a best suited coder associated with the finding; and

route the structured data set to the coder, wherein the coder comprises the best suited coder.

10. The at least one non-transitory computer-readable storage medium of claim 7 , wherein the instructions further cause the at least one processor to identify the finding based on evidence from natural language processing.

11. The at least one non-transitory computer-readable storage medium of claim 7 , wherein the instructions further cause the at least one processor to:

receive a selection of one of the number of medical record documents; and

cause display of the one of the number of medical record documents.

12. The at least one non-transitory computer-readable storage medium of claim 7 , wherein the instructions further cause the at least one processor to cause display of an annotated version of the one of the number of medical record documents.

13. A method of medical data management implemented by at least one processor in communication with at least one memory, the method comprising:

receiving a plurality of medical record documents;

selecting a model and model weights based on an annotation activity, wherein the selecting includes modifying a dynamic confidence threshold based at least in part on the annotation activity, wherein the dynamic confidence threshold is applied to at least one document of the plurality of medical record documents;

identifying a finding using the model;

transforming the plurality of medical record documents into a structured data set;

selecting a number of the plurality of medical record documents associated with the finding;

embedding links into the structured data set that reference at least one medical record source document of the number of medical record documents;

identifying a set of proficient coders by filtering a plurality of coders for proficiency, wherein proficiency is a metric including accuracy in an area associated with the finding and time taken to perform coding in the area;

measuring a number of risk adjustment factors each proficient coder of the set of proficient coders completes per hour on average, a rate of false positive coding measured as a rate of annotation disagreement with a supervisor, and an accuracy measure comprising a degree that a given coder agrees with other coders when presented the same task;

routing the structured data set to a coder; and

submitting the finding for reimbursement.

14. The method of claim 13 , further comprising:

ranking the set of proficient coders in a ranked coder list by at least one of a risk adjustment factor of the number of risk adjustment factors, the accuracy measure, or the rate of false positive coding;

filtering the ranked coder list to identify a best suited coder associated with the finding; and

routing the structured data set to the coder, wherein the coder comprises the best suited coder.

Assignments (4)
RELEASE OF SECURITY INTEREST Recorded Aug 30, 2024
From: CHURCHILL AGENCY SERVICES LLC
To: APIXIO, LLC (F/K/A APIXIO INC.)
Reel/Frame 068453/0713 →
ENTITY CONVERSION Recorded Jul 12, 2023
From: APIXIO INC.
To: APIXIO, LLC
Reel/Frame 064259/0006 →
SECURITY INTEREST Recorded Jun 13, 2023
From: APIXIO INC.
To: CHURCHILL AGENCY SERVICES LLC
Reel/Frame 063928/0847 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 9, 2022
From: SETHUMADHAVAN, VISHNUVYAS; SCHNEIDER, JOHN O.; SCHULTE, DARREN MATTHEW; ROGERS, ROBERT DERWARD
To: APIXIO, INC.
Reel/Frame 062104/0663 →
Continuity (9)
Continuation 14538800 · Nov 11, 2014
Continuation In Part 14498594 · Sep 26, 2014
Continuation In Part 13656652 · Oct 19, 2012
Continuation In Part 13223228 · Aug 31, 2011
Provisional Application 62059139 · Oct 2, 2014
Provisional Application 61883967 · Sep 27, 2013
Provisional Application 61682217 · Aug 11, 2012
Provisional Application 61379228 · Sep 1, 2010
Related Publication 20230113089A1 · Apr 13, 2023
References Cited (108)
US 5307262A · Ertel · 1994 [cited by applicant]
US 7321861B1 · Oon · 2008 [cited by applicant]
US 8898798B2 · Rogers et al. · 2014 [cited by applicant]
US 10580520B2 · Schulte et al. · 2020 [cited by applicant]
US 10629303B2 · Schulte et al. · 2020 [cited by applicant]
US 20010042080A1 · Ross · 2001 [cited by applicant]
US 20020010679A1 · Felsher · 2002 [cited by applicant]
US 20020188182A1 · Haines et al. · 2002 [cited by applicant]
US 20030046280A1 · Rotter et al. · 2003 [cited by applicant]
US 20030229510A1 · Kerr · 2003 [cited by applicant]
US 20040073458A1 · Jensen · 2004 [cited by applicant]
US 20040076264A1 · Sorenson · 2004 [cited by applicant]
US 20040109028A1 · Stern et al. · 2004 [cited by applicant]
US 20040249667A1 · Oon · 2004 [cited by applicant]
US 20050043986A1 · McConnell et al. · 2005 [cited by applicant]
US 20050138017A1 · Keen et al. · 2005 [cited by applicant]
US 20050228593A1 · Jones · 2005 [cited by applicant]
US 20050251422A1 · Wolfman et al. · 2005 [cited by applicant]
US 20060036619A1 · Fuerst · 2006 [cited by applicant]
US 20060047669A1 · Durrence · 2006 [cited by applicant]
US 20060112050A1 · Miikkulainen et al. · 2006 [cited by applicant]
US 20060129435A1 · Smitherman · 2006 [cited by applicant]
US 20070016450A1 · Bhora et al. · 2007 [cited by applicant]
US 20070055545A1 · Maughan et al. · 2007 [cited by applicant]
US 20070106754A1 · Moore · 2007 [cited by applicant]
US 20070192143A1 · Krishnan et al. · 2007 [cited by applicant]
US 20070192910A1 · Vu et al. · 2007 [cited by applicant]
US 20070219829A1 · Kay · 2007 [cited by applicant]
US 20070226211A1 · Heinze et al. · 2007 [cited by applicant]
US 20080077443A1 · Singer · 2008 [cited by applicant]
US 20080091633A1 · Rappaport · 2008 [cited by applicant]
US 20080103828A1 · Squilla et al. · 2008 [cited by applicant]
US 20080120296A1 · Kariathungal · 2008 [cited by applicant]
US 20080250025A1 · Abhyanker · 2008 [cited by applicant]
US 20080256181A1 · Morita et al. · 2008 [cited by applicant]
US 20080263048A1 · Wise · 2008 [cited by applicant]
US 20080270340A1 · Abrams · 2008 [cited by applicant]
US 20090024615A1 · Pedro · 2009 [cited by applicant]
US 20090070103A1 · Beggelman · 2009 [cited by applicant]
US 20090112882A1 · Maresh · 2009 [cited by applicant]
US 20090136102A1 · Kimpe · 2009 [cited by applicant]
US 20090138287A1 · Hermann, Jr. · 2009 [cited by applicant]
US 20090228303A1 · Faulkner et al. · 2009 [cited by applicant]
US 20090228909A1 · Huang · 2009 [cited by applicant]
US 20090259487A1 · Rao et al. · 2009 [cited by applicant]
US 20090271221A1 · Aridi · 2009 [cited by applicant]
US 20090287504A1 · Benjamin et al. · 2009 [cited by applicant]
US 20100036680A1 · Familant · 2010 [cited by applicant]
US 20100088107A1 · Ur et al. · 2010 [cited by applicant]
US 20100117799A1 · Dormer · 2010 [cited by applicant]
US 20100131299A1 · Hasan · 2010 [cited by applicant]
US 20100169123A1 · Maus · 2010 [cited by applicant]
US 20100179827A1 · McCallie, Jr. et al. · 2010 [cited by applicant]
US 20100185496A1 · Hahn · 2010 [cited by applicant]
US 20100235410A1 · Apacible et al. · 2010 [cited by applicant]
US 20100324936A1 · Vishnubhatla · 2010 [cited by applicant]
US 20110078145A1 · Chung et al. · 2011 [cited by applicant]
US 20110117799A1 · Harada et al. · 2011 [cited by applicant]
US 20110295616A1 · Vesto · 2011 [cited by applicant]
US 20120060216A1 · Chaudhri et al. · 2012 [cited by applicant]
US 20120066017A1 · Siegel · 2012 [cited by applicant]
US 20120166212A1 · Campbell · 2012 [cited by applicant]
US 20120215578A1 · Frank et al. · 2012 [cited by applicant]
US 20120284056A1 · Hofstetter · 2012 [cited by applicant]
US 20120303378A1 · Lieberman · 2012 [cited by applicant]
US 20130124523A1 · Rogers et al. · 2013 [cited by applicant]
US 20130159023A1 · Srinivas et al. · 2013 [cited by applicant]
US 20130238349A1 · Sethumadhavan et al. · 2013 [cited by applicant]
US 20130297536A1 · Almosni et al. · 2013 [cited by applicant]
US 20130332194A1 · DAuria et al. · 2013 [cited by applicant]
US 20130332199A1 · Freiwat et al. · 2013 [cited by applicant]
US 20130346356A1 · Welinder et al. · 2013 [cited by applicant]
US 20140012738A1 · Woo · 2014 [cited by applicant]
US 20140046697A1 · Rogers et al. · 2014 [cited by applicant]
US 20140136559A1 · Kottaram · 2014 [cited by applicant]
US 20140257842A1 · Heinze et al. · 2014 [cited by applicant]
US 20140278832A1 · Glavina et al. · 2014 [cited by applicant]
US 20150066537A1 · Sheffer et al. · 2015 [cited by applicant]
US 20150066539A1 · Sheffer et al. · 2015 [cited by applicant]
US 20150095065A1 · Schneider et al. · 2015 [cited by applicant]
US 20150142472A1 · Schulte et al. · 2015 [cited by applicant]
US 20150269337A1 · Schulte et al. · 2015 [cited by applicant]
US 20160048643A1 · Woods et al. · 2016 [cited by applicant]
US 20170132314A1 · Liu et al. · 2017 [cited by applicant]
JP H1145304A · 1999 [cited by applicant]
JP 2001290890A · 2001 [cited by applicant]
JP 2001325290A · 2001 [cited by applicant]
JP 2002318820A · 2002 [cited by applicant]
JP 2003263507A · 2003 [cited by applicant]
JP 2004280807A · 2004 [cited by applicant]
JP 2005309666A · 2005 [cited by applicant]
JP 2006107299A · 2006 [cited by applicant]
JP 2006164234A · 2006 [cited by applicant]
JP 2007193399A · 2007 [cited by applicant]
JP 2007323525A · 2007 [cited by applicant]
JP 2008204378A · 2008 [cited by applicant]
JP 2009193157A · 2009 [cited by applicant]
KR 1020050015059A · 2005 [cited by applicant]
KR 1020090050881A · 2009 [cited by applicant]
WO 0154042A1 · 2001 [cited by applicant]
WO 2007051245A1 · 2007 [cited by applicant]
WO 2008039880A2 · 2008 [cited by applicant]
WO 2010058398A2 · 2010 [cited by applicant]
Hayeems Robin Zoe. Informed consent and genetic databases: An exploration of the authorization model ProQuest Dissertations Publishing. (2007). [cited by applicant]
Lemeshow et al, Searching one or two databases was insufficient for meta-analysis of observational studies, 7 pages (Year: 2005). [cited by applicant]
Valkhoff, Vera E.; Coloma, Preciosa; Mosseveld, Mees; Kuipers, Ernst J.; Sturkenboom, Miriam C.; Trifiro, Gianluca Validation of the Diagnosis for Upper Gastrointestinal Bleeding in a Dutch Medical Record Database Gastr… [cited by applicant]
Vazquez, Miguel 1 ; Krallinger, Martin 1 ; Leitner, Florian 1 ; Valencia, Alfonso. Text Mining for Drugs and Chemical Compounds: Methods, Tools and Applications. 1 1 Ctr Nacl Invest Oncol Biol Computac Estruct,) Molecul… [cited by applicant]
Mori et al., “What is Mash-up?”, A Web 2.0 service construction technique, iNTERNET magazine, Impress Corporation, Apr. 1, 2006, No. 135, with English Translation, 54 pages. [cited by applicant]