# US 2025/0149186 A1 · Methods and Systems for Semantics Based Generation of Connections Between Separate Data Sets

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

- Number: US 2025/0149186 A1
- Document ID: US20250149186A1
- Status: Published application
- Kind: A1
- Application number: 18/833,639
- Filed: 2023-01-27
- Published: 2025-05-08
- Earliest claimed: 2022-01-27
- Assignees: Id Business Solutions Inc.
- Applicants: ID Business Solutions, Ltd.
- Inventors: Alberto Pascual Montano; Shun Mao; Scott Weiss
- Web page: https://patentgrep.com/patent/US20250149186A1

## CPC

- G06F 16/358: Browsing; Visualisation therefor
- G16H 50/70: for mining of medical data, e.g. analysing previous cases of other patients
- G06F 16/287: {Visualization; Browsing}
- G06F 16/313: {Selection or weighting of terms for indexing}
- 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

A method and system for identifying connections between data items in an updatable data repository includes dynamically receiving a plurality of data items, each data item including one or more controlled terms, displaying the dynamically received data items on a display, and identifying one or more connections between data items from different updatable sources based on the display. A method and system for identifying connections between data items in an updatable data repository also includes dynamically receiving a plurality of data items, each data item including one or more controlled terms, defining degrees of similarity between the data items, ranking the data items with respect to one another based on the degree of similarity therebetween, and identifying one or more connections between data items from different updatable sources based on the ranking. The data items are also updated contemporaneously when the sources thereof are updated.

## Claims

### Claim 1

A method for identifying connections between data items in an updatable data repository, the method comprising:
dynamically receiving a plurality of data items from the updatable data repository, the data items being provided by a plurality of updatable sources, each data item including one or more controlled terms;
displaying the dynamically received data items on a display; and
identifying one or more connections between data items from different updatable sources based on the display;
wherein the dynamically received data items are updated contemporaneously when the sources thereof are updated.

### Claim 2 (depends on 1)

The method of claim 1, wherein, for each data item, each controlled term defines one or more characteristics of the data item.

### Claim 3 (depends on 1, 2)

The method of claim 1 or claim 2, wherein the characteristics comprise at least one of a drug, an experiment, a gene, a device, a chemical molecule, a research center, a research team, a location, and an event.

### Claim 4 (depends on 1, 2, 3)

The method of any one of claims 1-3, wherein the data items only comprise controlled terms.

### Claim 5 (depends on 1, 2, 3, 4)

The method of any one of claims 1-4, wherein:
the displayed data items are separated by distances related to a degree of similarity therebetween; and
identifying the one or more connections is based on the distances.

### Claim 6 (depends on 1, 2, 3, 4, 5)

The method of any one of claims 1-5, wherein the degree of similarity between two data items is defined by at least one of a number and a frequency of controlled terms shared by the two data items.

### Claim 7 (depends on 1, 2, 3, 4, 5, 6)

The method of any one of claims 1-6, further comprising:
defining a distance threshold;
wherein identifying the one or more connections comprises identifying data items that are separated by a distance that is less than the distance threshold.

### Claim 8 (depends on 1, 2, 3, 4, 5, 6, 7)

The method of any one of claims 1-7, wherein the data items are grouped in one or more clusters on the display, the data items in each cluster sharing one of same controlled terms and same frequency of controlled terms.

### Claim 9 (depends on 1, 2, 3, 4, 5, 6, 7, 8)

The method of any one of claims 1-8, wherein the updatable data repository comprises one or more laboratory electronic notebooks.

### Claim 10 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9)

The method of any one of claims 1-9, wherein when the dynamically received data is updated, at least one connection is identified as a result thereof.

### Claim 11

A data connection finder comprising:
a data receiver;
an updatable data repository functionally coupled to the data receiver;
a display device functionally coupled to the data receiver;
a processor operatively coupled to the data receiver, to the updatable data repository and to the display device; and
a memory coupled to the processor, the memory storing instructions that, when executed by the processor, perform a set of operations comprising:
dynamically receiving, at the data receiver, a plurality of data items from the updatable data repository, the data items being provided by a plurality of updatable sources, each data item including one or more controlled terms;
displaying the dynamically received data items on a display of the display device; and
identifying, via the processor, one or more connections between data items from different updatable sources based on the display;
wherein the dynamically received data items are updated contemporaneously when the sources thereof are updated.

### Claim 12 (depends on 11)

The data connection finder of claim 11, wherein:
the displayed data items are separated, on the display of the display device, by distances related to a degree of similarity therebetween; and
identifying the one or more connections is based on the distances.

### Claim 13 (depends on 11, 12)

The data connection finder of claim 11 or claim 12, wherein the degree of similarity between two data items is defined by at least one of a number and a frequency of controlled terms shared by the two data items.

### Claim 14 (depends on 11, 12, 13)

The data connection finder of any one of claims 11-13, wherein the set of operations further comprise:
defining a distance threshold;
wherein identifying the one or more connections comprises identifying data items that are separated by a distance that is less than the distance threshold.

### Claim 15 (depends on 11, 12, 13, 14)

The data connection finder of any one of claims 11-14, wherein;
the data items are grouped, on the display of the display device, in one or more clusters; and
the data items in each cluster share same controlled terms.

### Claim 16 (depends on 11, 12, 13, 14, 15)

The data connection finder of any one of claims 11-15, wherein the updatable data repository comprises one or more electronic workbooks.

### Claim 17 (depends on 11, 12, 13, 14, 15, 16)

The data connection finder of any one of claims 11-16, wherein when the dynamically received data is updated, at least one connection is identified as a result thereof via the processor.

### Claim 18

A method for identifying connections between data items in an updatable data repository, the method comprising:
dynamically receiving a plurality of data items from the updatable data repository, the data items being provided by a plurality of updatable sources, each data item including one or more controlled terms;
defining degrees of similarity between the data items;
ranking the data items with respect to one another based on the degree of similarity therebetween; and
identifying one or more connections between data items from different updatable sources based on the ranking;
wherein the data items are updated contemporaneously when the sources thereof are updated.

### Claim 19 (depends on 18)

The method of claim 18, wherein, for each data item, each controlled term defines one or more characteristics of the data item.

### Claim 20 (depends on 18, 19)

The method of claim 18 or claim 19, wherein the data items only comprise controlled terms.

### Claim 21 (depends on 18, 19, 20)

The method of any one of claims 18-20, wherein the degree of similarity between two data items is defined by at least one of a number and a frequency of controlled terms shared by the two data items.

### Claim 22 (depends on 18, 19, 20, 21)

The method of any one of claims 18-21, wherein for each given data item, other data items are individually ranked based on the degree of similarity between the given data item and each of the other data items.

### Claim 23 (depends on 18, 19, 20, 21, 22)

The method of any one of claims 18-22 wherein any two data items share a same rank.

### Claim 24 (depends on 18, 19, 20, 21, 22, 23)

The method of any one of claims 18-23, further comprising:
defining a rank threshold;
wherein identifying the one or more connections comprises identifying data items that share a rank that is higher than the rank threshold.

### Claim 25 (depends on 18, 19, 20, 21, 22, 23, 24)

The method of any one of claims 18-24, further comprising providing the one or more identified connections.
