# US 2020/0401599 A1 · 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 2020/0401599 A1 - Document ID: US20200401599A1 - Status: Published application - Kind: A1 - Application number: 17/013,510 - Filed: 2020-09-04 - Published: 2020-12-24 - 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/US20200401599A1 ## 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 Systems and methods are provided for analyzing and visualizing relationship of multi-layered datasets. 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 first 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 comprise at least a part of the original datasets and the first derivative datasets, and the links represent at least a part of the determined relationships; presenting data of the node map in a main field of a graphical user interface (GUI); generating a focused node map including a selected node satisfying a filtering criteria and one or more nodes linked with the selected node, and at least one of the linked nodes in the focused node map being 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 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 a node. ### Claim 3 (depends on 1) The system of claim 1, wherein the node map compares nodes connected by links, and lengths of respective links are determined based on a proximity degree between the datasets represented by the nodes. ### Claim 4 (depends on 1) The system of claim 1, wherein the instructions further cause the system to: perform a speech recognition process on the dataset; and perform a term-frequency-inverse-document frequency (TF-IDF) analysis on an audio data field of the 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 being visualized with emphasis is based on a proximity of a relationship between the selected node and 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 instructions further cause the system to perform: presenting searched or selected data of the node map in an auxiliary field of the GUI, the auxiliary field being presented at a side of the main field; inputting or selecting, in a second auxiliary field of the GUI, criteria for filtering the original datasets and the first derivative datasets. ### Claim 8 (depends on 7) The system of claim 7, wherein the auxiliary field further comprises a search field, a content field that provides a portion of the node map indicating a relationship of a dataset having a close relationship with an other dataset, and a metadata field that presents metadata of the dataset including a name, a data source, a path, and the other dataset. ### Claim 9 (depends on 7) The system of claim 7, wherein the main field decreases in size in response to the second auxiliary field being opened. ### Claim 10 (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 a 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 11 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 first derivative datasets from the original datasets; generating second derivative datasets from at least the first derivative 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 comprise at least a part of the original datasets and the first derivative datasets, and the links represent at least a part of the determined relationships; presenting data of the node map in a main field of a graphical user interface (GUI); generating a focused node map including a selected node satisfying a filtering criteria and one or more nodes linked with the selected node, and at least one of the linked nodes in the focused node map being visualized with emphasis based on respective types of the determined relationships. ### Claim 12 (depends on 11) The method of claim 11, further comprising generating second derivative datasets and 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 a node. ### Claim 13 (depends on 11) The method of claim 11, wherein the node map compares nodes connected by links, and lengths of respective links are determined based on a proximity degree between the datasets represented by the nodes. ### Claim 14 (depends on 11) The method of claim 11, further comprising perform a speech recognition process on the dataset; and perform a term-frequency-inverse-document frequency (TF-IDF) analysis on an audio data field of the dataset in response to performing the speech recognition process. ### Claim 15 (depends on 11) The method of claim 11, wherein the at least one of the linked nodes in the focused node map being visualized with emphasis is based on a proximity of a relationship between the selected node and the at least one of the linked nodes. ### Claim 16 (depends on 12) The method of claim 12, wherein the third derivative datasets are not generated based on the first derivative datasets or the original datasets. ### Claim 17 (depends on 11) The method of claim 11, further comprising presenting searched or selected data of the node map in an auxiliary field of the GUI, the auxiliary field being presented at a side of the main field; inputting or selecting, in a second auxiliary field of the GUI, criteria for filtering the original datasets and the first derivative datasets. ### Claim 18 (depends on 17) The method of claim 17, wherein the auxiliary field further comprises a search field, a content field that provides a portion of the node map indicating a relationship of a dataset having a close relationship with an other dataset, and a metadata field that presents metadata of the dataset including a name, a data source, a path, and the other dataset. ### Claim 19 (depends on 11) The method of claim 11, wherein the main field decreases in size in response to the second auxiliary field being opened. ### Claim 20 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 first derivative datasets from the original datasets; generating second derivative datasets from at least the first derivative 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 comprise at least a part of the original datasets and the first derivative datasets, and the links represent at least a part of the determined relationships; presenting data of the node map in a main field of a graphical user interface (GUI); generating a focused node map including a selected node satisfying a filtering criteria and one or more nodes linked with the selected node, and at least one of the linked nodes in the focused node map being visualized with emphasis based on respective types of the determined relationships.