# US 2022/0031955 A1 · System for enhancing data quality of dispense data sets

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0031955 A1
- Document ID: US20220031955A1
- Status: Published application
- Kind: A1
- Application number: 17/275,722
- Filed: 2019-09-24
- Published: 2022-02-03
- Earliest claimed: 2018-09-24
- Applicants: Novo Nordisk A/S
- Inventors: Mark Haun; Carsten Schau Andersen; Thomas Dedenroth Miller; Ryan Scott Frazier
- Web page: https://patentgrep.com/patent/US20220031955A1

## CPC

- A61M 5/31535: {Means improving security or handling thereof, e.g. blocking means, means preventing insufficient dosing, means allowing correction of overset dose}
- A61M 5/31565: {Administration mechanisms, i.e. constructional features, modes of administering a dose (dosing mechanisms for setting a dose A61M5/31533)}
- G16H 20/17: delivered via infusion or injection
- G16H 40/67: for remote operation
- G16H 50/20: for computer-aided diagnosis, e.g. based on medical expert systems
- A61M 2005/3125: {Display means, e.g. to indicate dose setting}
- G16H 40/60: for the operation of medical equipment or devices
- A61M: DEVICES FOR INTRODUCING MEDIA INTO, OR ONTO, THE BODY (introducing media into or onto the bodies of animals A61D7/00; means for inserting tampons A61F13/26; devices for administering food or medicines orally A61J; containers for collecting, storing or administering blood or medical fluids A61J1/05); DEVICES FOR TRANSDUCING BODY MEDIA OR FOR TAKING MEDIA FROM THE BODY (surgery A61B; chemical aspects of surgical articles A61L); DEVICES FOR PRODUCING OR ENDING SLEEP OR STUPOR {(Electrotherapy, e.g. producing anaesthesia by the use of alternating or intermittent currents A61N1/36021)}
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA

## Abstract

A method for enhancing data quality of a drug dose dispense data set to automatically provide dispense data reflecting actually injected dose amounts. For a given dispense session the method comprises the steps of creating a list of possible dispense patterns in accordance with a set of pattern rules and then for each pattern in the list calculate a weight allowing a winning pattern to be determined. Each dispense pattern is a particular sequence of priming events and injection events, with each dispense pattern being a possible interpretation of the dispense events in the current session. For each pattern a combined pattern weight being the product of weight factors for each dispense in the pattern is calculated, wherein each weight factor is determined in accordance with a weight factor vs dispense size function for the given dispense type and dispense size, wherein the larger the dispense size, the more likely it is to represent an injection event and the less likely it is to represent a priming event.

## Claims

### Claim 1

A computing system for enhancing data quality of a query drug dispense data set, wherein the system comprises one or more processors and a memory, the memory comprising:
instructions that, when executed by the one or more processors, perform a method responsive to receiving a query request for enhancing dispense data quality, the instructions comprising the steps of:
a) obtaining a query dispense data set comprising a plurality of dispense records created over a time course, each respective dispense record representing a dispense event comprising:
(i) a dispense amount of a medicament, wherein the dispense amount is one of a priming amount [p] or an injection amount [i], each amount corresponding to a size,
(ii) a corresponding dispense timestamp,
b) segmenting the query dispense data set into one or more current sessions, each current session comprising a sequence of dispense events clustered in time according to a set of clustering criterions,
for each current session:
c) creating a list of possible dispense patterns in accordance with a set of pattern rules, wherein a dispense pattern is a sequence of dispense amounts, either priming or injection amounts,
d) for each pattern calculating a combined pattern weight being the product of weight factors for each dispense in the pattern, wherein each weight factor is determined in accordance with a weight factor vs dispense size function for the given dispense type and dispense size, wherein the larger the dispense size, the more likely it is to represent an injection event and the less likely it is to represent a priming event,
e) identifying a winning pattern as the pattern being the pattern having the highest combined pattern weight, and
f) storing in memory the corresponding dispense events labelled as either a priming or an injection event corresponding to the winning pattern.

### Claim 2 (depends on 1)

The computing system as in claim 1, the instructions comprising the further step of:
obtaining a history dispense data set comprising a plurality of prior dispense records created over a prior time course,

### Claim 3 (depends on 2)

The computing system as in claim 2, the instructions comprising the further steps for each current session:
generating mean and variance values for an expected total injected amount distribution based on history dispense data,
comparing the highest and the second-highest combined pattern weights, and if the pattern weights are within a given proximity of each other then identify an updated winning pattern as the pattern having the highest probability according to the generated distribution.

### Claim 4 (depends on 3)

The computing system as in claim 3, the instructions comprising the further step for each current session:
calculating a history weight for the history dispense data upon which the expected total injected amount values are based, the history weight being based on relevance criteria, comprising one or more of:
age of data,
time-of-day similarity, and
inter-session gap similarity,
wherein no expected total injected amount values are generated unless the history weight reaches a given minimum threshold.

### Claim 5 (depends on 1)

The computing system as in claim 1, the instructions comprising the further step for each current session:
determining a combined confidence value based on one or more confidence metrics from the group of confidence values comprising:
data confidence value based on the value of the highest combined pattern weight,
expected-amount confidence value based on the difference between estimated total injected amount and an expected total injected amount, if calculated,
ambiguity confidence value based on the probability proximity of the highest and the second-highest combined pattern weights according to the generated distribution, if generated, and
priming confidence value based on the consistency between priming behavior of the winning pattern and,
wherein, when the combined confidence value is above a given threshold value, then:
calculate an estimated total injected amount as the sum of all injection amounts in the winning pattern.

### Claim 6 (depends on 2)

The computing system as in claim 2, wherein, when the combined confidence value is above a given threshold value, then:
label the session corresponding to the winning pattern, wherein the mean and variance values for the expected total injected amount distribution is based on history dispense data from labeled sessions only.

### Claim 7 (depends on 2)

The computing system as in claim 2, wherein a combined pattern weight is the product of one or more further factors, comprising:
priming probability factor based on history dispense data,
priming disparity factor, and
intra-session dispense interval factor for sessions having more than two dispenses.

### Claim 8 (depends on 1)

The computing system as in claim 1, the instructions comprising the further step for each current session:
calculate an estimated total injected amount as the sum of all injection amounts in the winning pattern.

### Claim 9 (depends on 1)

The computing system as in claim 1, wherein:
the obtained dispense records comprise an identifier for identifying a given dispense event as a bolus event or a basal event, and
the rules and parameters of the method is adapted for use with dispense data generated in a bolus only, basal only, or bolus and basal regimen.

### Claim 10 (depends on 1)

The computing system as in claim 1, wherein:
the segmenting is controlled by a set of time parameters and a set of time measures, wherein the initial dispense event in the sequence of dispense events starts a session and zeros a timer, and the next dispenses are automatically included in this session until a session time window have elapsed, and wherein later dispenses are included, provided that the expressions: (i) the ratio between a resulting session length and the resulting inter-session length on either side of the session is less than the session length ratio, and (ii) the resulting session length is less than session window max, is true,
wherein the sequence of dispense events in the session defines a set of dispense events, and wherein each dispense event comprises a corresponding dispense size being the amount of dispensed medicament, and
wherein a new session is started, in response to the expressions are no longer true.

### Claim 11 (depends on 1)

The computing system as in claim 1, wherein a given event or session label can be changed by a user.
