# US 2023/0273931 A1 · Systems and methods for dataset recommendation in a zero-trust computing environment

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

- Number: US 2023/0273931 A1
- Document ID: US20230273931A1
- Status: Published application
- Kind: A1
- Application number: 18/169,867
- Filed: 2023-02-15
- Published: 2023-08-31
- Earliest claimed: 2022-02-25
- Assignees: BeeKeeperAI, Inc.
- Applicants: BeeKeeperAI, Inc.
- Inventors: Mary Elizabeth Chalk; Robert Derward Rogers
- Web page: https://patentgrep.com/patent/US20230273931A1

## CPC

- G06F 21/6245: {Protecting personal data, e.g. for financial or medical purposes}
- G06F 16/2237: {Vectors, bitmaps or matrices}
- G06F 16/2458: Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F 16/2462: {Approximate or statistical queries}
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/6254: {by anonymising data, e.g. decorrelating personal data from the owner's identification}
- G16H 10/60: for patient-specific data, e.g. for electronic patient records
- G16H 50/70: for mining of medical data, e.g. analysing previous cases of other patients
- G06F 2221/2115: Third party
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA

## Abstract

Systems and methods for recommendation of cohort sample sets is provided. In some embodiments, a set of dataset requirements is received as a required vector set. The historical vector sets are queried. Each vector set corresponds to a known dataset. The difference between the required vector set and each of the historical vector sets is calculated by framing the distance as a p-value in a hypothesis test, compared against a threshold. The historical vector set with the least difference to the required vector set is identified. The least difference is calculated as a count of differing classes or as a numerically weighted summation of differing classes.

## Claims

### Claim 1

A computerized method for recommending a dataset in a zero-trust environment, the method comprising:
receiving a set of dataset requirements as a required vector set;
querying historical vector sets, wherein each vector set corresponds to a known dataset;
calculating the difference between the required vector set and each of the historical vector sets; and
identifying the historical vector set with the least difference to the required vector set.

### Claim 2 (depends on 1)

The method of claim 1, wherein the calculating the difference is by framing the distance as a p-value in a hypothesis test, compared against a threshold.

### Claim 3 (depends on 1)

The method of claim 1, wherein the least difference is calculated as a count of differing classes.

### Claim 4 (depends on 1)

The method of claim 1, wherein the least difference is calculated as a numerically weighted summation of differing classes.

### Claim 5

A zero-trust computing system for recommending a dataset, the system comprising:
a data store hosted within a secure computing environment for receiving a set of dataset requirements as a required vector set; and
a runtime server hosted within a secure computing environment for querying historical vector sets, wherein each vector set corresponds to a known dataset, calculating the difference between the required vector set and each of the historical vector sets, and identifying the historical vector set with the least difference to the required vector set.

### Claim 6 (depends on 5)

The system of claim 5, wherein the calculating the difference is by framing the distance as a p-value in a hypothesis test, compared against a threshold.

### Claim 7 (depends on 5)

The system of claim 5, wherein the least difference is calculated as a count of differing classes.

### Claim 8 (depends on 5)

The system of claim 5, wherein the least difference is calculated as a numerically weighted summation of differing classes.

### Claim 9

A computer program products stored on non-volatile computer memory which when executed upon a computer system performs the steps of:
receiving a set of dataset requirements as a required vector set;
querying historical vector sets, wherein each vector set corresponds to a known dataset;
calculating the difference between the required vector set and each of the historical vector sets; and
identifying the historical vector set with the least difference to the required vector set.

### Claim 10 (depends on 9)

The computer program product of claim 9, wherein the calculating the difference is by framing the distance as a p-value in a hypothesis test, compared against a threshold.

### Claim 11 (depends on 9)

The computer program product of claim 9, wherein the least difference is calculated as a count of differing classes.

### Claim 12 (depends on 9)

The computer program product of claim 9, wherein the least difference is calculated as a numerically weighted summation of differing classes.
