US 11,698,918 B2
System and method for content-based data visualization using a universal knowledge graph
Inna Tokarev Sela, Tel Aviv (IL); Yael Lev, Tel Aviv (IL); Guy Boyangu, Tel Aviv (IL); Yuval Shkolar, Tel Aviv (IL); and Amnon Lotenberg, Tel Aviv (IL)
Assigned to SISENSE LTD., Ramat Gan (IL)
Filed by Sisense Ltd., Ramat Gan (IL)
Filed on Oct. 29, 2020, as Appl. No. 17/83,697.
Application 17/083,697 is a continuation in part of application No. 16/876,943, filed on May 18, 2020.
Claims priority of provisional application 63/076,713, filed on Sep. 10, 2020.
Claims priority of provisional application 62/850,760, filed on May 21, 2019.
Prior Publication US 2021/0042589 A1, Feb. 11, 2021
Int. Cl. G06F 16/28 (2019.01); G06F 3/04842 (2022.01); G06N 5/02 (2023.01); G06F 18/20 (2023.01); G06F 18/22 (2023.01)
CPC G06F 16/285 (2019.01) [G06F 3/04842 (2013.01); G06F 18/22 (2023.01); G06F 18/29 (2023.01); G06N 5/02 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method for generating data visualizations, by a computer system, comprising:
receiving events by the computer system;
parsing, by the computer system, each of a plurality of the received events into a plurality of objects, wherein the plurality of events includes a plurality of queries, wherein each event of the plurality of events is related to an interaction with at least one data source;
determining, by the computer system, for each of the plurality of events, a relationship between two objects of the plurality of objects;
generating, by the computer system, a semantic knowledge graph based on the determined relationships, the semantic knowledge graph including a plurality of query nodes and a plurality of edges, wherein each query node corresponds to a respective object of the plurality of objects, wherein each query node is connected to another query node of the plurality of query nodes by one of the plurality of edges, wherein each edge represents a relationship between the objects connected by the edge;
repeating, by the computer system, the receiving, parsing, determining, and generating so as to cause the first semantic knowledge graph to be updated continually over time as events occur;
assigning, by the computer system, a score to each edge, wherein the score assigned to each edge indicates a weight of the edge, wherein the score assigned to each edge is determined based on a number of appearances of the relationship represented by the edge in the parsed plurality of events;
generating, by the computer system, an enriched data layer based on a plurality of knowledge graphs including the first semantic knowledge graph, the plurality of knowledge graphs including a plurality of first nodes, the enriched data layer including a plurality of second nodes, wherein each of the plurality of second nodes is connected via an edge to at least one of the plurality of first nodes; and
generating, by the computer system, a data visualization based on the enriched data layer and a request for data, wherein the request for data indicates a type of data corresponding to at least one of the plurality of second nodes, wherein the data visualization is generated using data represented by at least one of the plurality of first nodes connected to the at least one of the plurality of second nodes.