# US 11,308,117 B2 · Relationship analysis and mapping for interrelated multi-layered datasets

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

- Number: US 11,308,117 B2
- Document ID: US11308117B2
- Status: Granted
- Kind: B2
- Application number: 17/013,510
- Filed: 2020-09-04
- Published: 2020-12-24
- Granted: 2022-04-19
- Earliest claimed: 2017-12-07
- Assignees: Palantir Technologies Inc.
- Applicants: Palantir Technologies Inc.
- Inventors: Arjun Prakash; Becky Moore; Jakub Pilch
- Web page: https://patentgrep.com/patent/US11308117B2

## CPC

- G06F 16/26: Visual data mining; Browsing structured data
- G06F 16/904: Browsing; Visualisation therefor (for navigating the web G06F16/954; browsing optimisation for the web G06F16/957)
- G06F 16/2264: {Multidimensional index structures}
- G06F 16/288: {Entity relationship models}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A system stores original datasets in a datastore. The system generates first derivative datasets from the original datasets, and generates second derivative datasets from at least the first derivative datasets. The system determines relationships among the original datasets, the first derivative datasets, and the second derivative datasets, based on an analytical relationship between two datasets, a similarity relationship between two datasets, a modification relationship between two datasets, and a user-interaction relationship between two datasets. Then, the system generates a node map including at least part of the original datasets, the first derivative datasets, and the second derivative datasets as a node, and at least part of the determined analytical, similarity, modification, and user-interaction relationships between two nodes as a link.

## Claims

### Claim 1

A system comprising:
one or more hardware processors; and
a memory storing instructions that, when executed by the one or more hardware processors, cause the system to perform:
storing original datasets in a datastore;
generating derivative datasets from the original datasets;
determining relationships among the original datasets and the derivative datasets, based on any two of:
an analytical relationship between two datasets;
a similarity relationship between two datasets;
a modification relationship between two datasets; and
a user-interaction relationship between two datasets;
generating a node map including a plurality of nodes and links between the plurality of nodes, wherein the plurality of nodes represent at least a part of the original datasets and the derivative datasets, and the links represent at least a part of the determined relationships;
displaying the node map in a main field of a graphical user interface (GUI);
displaying searched or selected data of the node map in a first auxiliary field of the GUI, the first auxiliary field being presented at a side of the main field, the first auxiliary field further comprising any of:
a content field that provides a portion of the node map indicating a determined relationship of a dataset with an other dataset; and
a metadata field that presents metadata of the dataset including a data source and the other dataset;
receiving an input or a selection, in the first auxiliary field or a second auxiliary field of the GUI, of at least one criterion indicating whether at least a portion of the original datasets or the derivative datasets are active or discarded; and
generating and displaying a focused node map in the main field, wherein:
the focused node map comprises a selected node satisfying a filtering criteria and one or more nodes linked with the selected node, the selected node satisfying the at least one criterion for filtering the original datasets and the derivative datasets, and
at least one of the one or more linked nodes in the focused node map is visualized with emphasis based on respective types of the determined relationships.

### Claim 2 (depends on 1)

The system of claim 1, wherein the instructions further cause the system to perform:
generating second derivative datasets; and
generating third derivative datasets based on consumption of at least the second derivative datasets, wherein the determined relationships are among the original datasets, the first derivative datasets, the second derivative datasets, and the third derivative datasets, and the node map also includes at least a part of the third derivative datasets as one or more additional nodes.

### Claim 3 (depends on 1)

The system of claim 1, wherein the node map comprises the nodes connected by links, and lengths of respective links are determined based on proximity degrees among the original datasets or the derivative datasets represented by the nodes disposed at ends of each of the links.

### Claim 4 (depends on 1)

The system of claim 1, wherein the instructions further cause the system to:
perform a speech recognition process on an original dataset; and
perform a term-frequency-inverse-document frequency (TF-IDF) analysis on an audio data field of the original dataset in response to performing the speech recognition process.

### Claim 5 (depends on 1)

The system of claim 1, wherein the at least one of the linked nodes in the focused node map is visualized with emphasis based on a proximity of a relationship between the selected node and the at least one of the linked nodes.

### Claim 6 (depends on 2)

The system of claim 2, wherein the third derivative datasets are not generated based on the first derivative datasets or the original datasets.

### Claim 7 (depends on 1)

The system of claim 1, wherein the auxiliary field further comprises a search field and the metadata field further presents a name and a path.

### Claim 8 (depends on 1)

The system of claim 1, wherein the main field decreases in size in response to the second auxiliary field being opened.

### Claim 9 (depends on 1)

The system of claim 1, wherein representations of the node map are generated repeatedly at different points in time, and the instructions further cause the system to perform presenting a transition of the generated representations, the presenting of the transition of the generated representations-comprising showing a transition of the determined relationships indicating a degree of directness or a proximity among nodes of the generated representations over time.

### Claim 10

A computer implemented method performed on a computer system having one or more hardware processors programmed with computer program instructions that, when executed by the one or more hardware processors, cause the computer system to perform the method, the method comprising:
storing original datasets in a datastore;
generating derivative datasets from the original datasets;
determining relationships among the original datasets and the derivative datasets, based on any two of:
an analytical relationship between two datasets;
a similarity relationship between two datasets;
a modification relationship between two datasets; and
a user-interaction relationship between two datasets;
generating a node map including a plurality of nodes and links between the plurality of nodes, wherein the plurality of nodes represent at least a part of the original datasets and the derivative datasets, and the links represent at least a part of the determined relationships;
displaying the node map in a main field of a graphical user interface (GUI);
displaying searched or selected data of the node map in a first auxiliary field of the GUI, the first auxiliary field being presented at a side of the main field, the first auxiliary field further comprising any of:
a content field that provides a portion of the node map indicating a determined relationship of a dataset with an other dataset; and
a metadata field that presents metadata of the dataset including a data source and the other dataset;
receiving an input or a selection, in the first auxiliary field or a second auxiliary field of the GUI, of at least one criterion indicating whether at least a portion of the original datasets or the derivative datasets are active or discarded; and
generating and displaying a focused node map in the main field, wherein:
the focused node map comprises a selected node satisfying a filtering criteria and one or more nodes linked with the selected node, the selected node satisfying the at least one criterion for filtering the original datasets and the derivative datasets, and
at least one of the one or more linked nodes in the focused node map is visualized with emphasis based on respective types of the determined relationships.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
generating second derivative datasets; and
generating third derivative datasets based on consumption of at least the second derivative datasets, wherein the determined relationships are among the original datasets, the first derivative datasets, the second derivative datasets, and the third derivative datasets, and the node map also includes at least a part of the third derivative datasets as one or more additional nodes.

### Claim 12 (depends on 10)

The method of claim 10, wherein the node map comprises the nodes connected by links, and lengths of respective links are determined based on proximity degrees among the original datasets or the derivative datasets represented by the nodes disposed at ends of each of the links.

### Claim 13 (depends on 10)

The method of claim 10, further comprising:
performing a speech recognition process on an original dataset; and
performing a term-frequency-inverse-document frequency (TF-IDF) analysis on an audio data field of the original dataset in response to performing the speech recognition process.

### Claim 14 (depends on 10)

The method of claim 10, wherein the at least one of the linked nodes in the focused node map is visualized with emphasis based on a proximity of a relationship between the selected node and the at least one of the linked nodes.

### Claim 15 (depends on 11)

The method of claim 11, wherein the third derivative datasets are not generated based on the first derivative datasets or the original datasets.

### Claim 16 (depends on 10)

The method of claim 10, wherein the auxiliary field further comprises a search field and the metadata field further presents a name and a path.

### Claim 17 (depends on 10)

The method of claim 10, wherein the main field decreases in size in response to the second auxiliary field being opened.

### Claim 18

A non-transitory computer readable medium comprising instructions that, when executed, cause one or more processors to perform:
storing original datasets in a datastore;
generating derivative datasets from the original datasets;
determining relationships among the original datasets and the first derivative datasets,
based on any two of:
an analytical relationship between two datasets;
a similarity relationship between two datasets;
a modification relationship between two datasets; and
a user-interaction relationship between two datasets;
generating a node map including a plurality of nodes and links between the plurality of nodes, wherein the plurality of nodes represent at least a part of the original datasets and the derivative datasets, and the links represent at least a part of the determined relationships;
displaying the node map in a main field of a graphical user interface (GUI);
displaying searched or selected data of the node map in a first auxiliary field of the GUI, the first auxiliary field being presented at a side of the main field, the first auxiliary field further comprising any of:
a content field that provides a portion of the node map indicating a determined relationship of a dataset with an other dataset; and
a metadata field that presents metadata of the dataset including a data source and the other dataset;
receiving an input or a selection, in the first auxiliary field or a second auxiliary field of the GUI, of at least one criterion indicating whether at least a portion of the original datasets or the derivative datasets are active or discarded; and
generating and displaying a focused node map in the main field, wherein:
the focused node map comprises a selected node satisfying a filtering criteria and one or more nodes linked with the selected node, the selected node satisfying the at least one criterion for filtering the original datasets and the derivative datasets, and
at least one of the one or more linked nodes in the focused node map is visualized with emphasis based on respective types of the determined relationships.
