Visualization engine for a knowledge management system
First Claim
1. A system, comprising:
- a memory operable to store visualization rules, the visualization rules comprising level of detail rules, reduction rules, and rewriting rules; and
a processor communicatively coupled to the memory and operable to;
receive a visualization request relating to information stored in an ontology;
parse the visualization request to generate a search query;
submit the search query to the ontology, wherein the ontology is dynamically created to store retrieved data that is collected from a data source;
perform data mitigation to process the retrieved data to detect and resolve conflicts among classified tokens provided by data agent, wherein the data mitigation uses quality score, trust score, and rate of decay for the data source;
receive, in response to the query, a result comprising a plurality of instances associated with the classified tokens and a plurality of relationships between the instances; and
generate a visual representation of the result using the visualization rules, wherein generating the visual representation of the result using the visualization rules comprises;
identifying a relationship between a first instance and a second instance from the plurality of instances within the result;
removing the relationship between the first instance and the second instance from the results; and
removing the first instance from the results when the first instance has no relationships with any other instances from the plurality of instances.
1 Assignment
0 Petitions
Accused Products
Abstract
A system includes a memory operable to store visualization rules. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a visualization request relating to information stored in an ontology. The processor is further operable to parse the visualization request to generate a search query. The processor is further operable to submit the search query to the ontology. The processor is further operable to receive, in response to the query, a result. The result includes a plurality of instances and a plurality of relationships between the instances. The processor is further operable to generate a visual representation of the result using the visualization rules.
-
Citations
20 Claims
-
1. A system, comprising:
-
a memory operable to store visualization rules, the visualization rules comprising level of detail rules, reduction rules, and rewriting rules; and a processor communicatively coupled to the memory and operable to; receive a visualization request relating to information stored in an ontology; parse the visualization request to generate a search query; submit the search query to the ontology, wherein the ontology is dynamically created to store retrieved data that is collected from a data source; perform data mitigation to process the retrieved data to detect and resolve conflicts among classified tokens provided by data agent, wherein the data mitigation uses quality score, trust score, and rate of decay for the data source; receive, in response to the query, a result comprising a plurality of instances associated with the classified tokens and a plurality of relationships between the instances; and generate a visual representation of the result using the visualization rules, wherein generating the visual representation of the result using the visualization rules comprises; identifying a relationship between a first instance and a second instance from the plurality of instances within the result; removing the relationship between the first instance and the second instance from the results; and removing the first instance from the results when the first instance has no relationships with any other instances from the plurality of instances. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method, comprising:
-
receiving, by a processor, a visualization request relating to information stored in an ontology; parsing, by the processor, the visualization request to generate a search query; submitting, by the processor, the search query to the ontology, wherein the ontology is dynamically created to store retrieved data that is collected from a data source; perform data mitigation to process the retrieved data to detect and resolve conflicts among classified tokens provided by data agent, wherein the data mitigation uses quality score, trust score, and rate of decay for the data source; receiving, by the processor, in response to the query, a result comprising a plurality of instances associated with the classified tokens and a plurality of relationships between the instances; and generating, by the processor, a visual representation of the result using visualization rules stored in a memory, the visualization rules comprising level of detail rules, reduction rules, and rewriting rules, wherein generating the visual representation of the result using the visualization rules comprises; identifying a relationship between a first instance and a second instance from the plurality of instances within the results; removing the relationship between the first instance and the second instance from the results; and removing the first instance from the results when the first instance has no relationships with any other instances from the plurality of instances. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. One or more non-transitory computer readable storage media embodying logic that is operable when executed by one or more processors to:
-
receive a visualization request relating to information stored in an ontology; parse the visualization request to generate a search query; submit the search query to the ontology, wherein the ontology is dynamically created to store retrieved data that is collected from a data source; perform data mitigation to process the retrieved data to detect and resolve conflicts among classified tokens provided by data agent, wherein the data mitigation uses quality score, trust score, and rate of decay for the data source; receive, in response to the query, a result comprising a plurality of instances associated with the classified tokens and a plurality of relationships between the instances; and generate a visual representation of the result using visualization rules stored in a memory, the visualization rules comprising level of detail rules, reduction rules, and rewriting rules, wherein generating the visual representation of the result using the visualization rules comprises; identifying a relationship between a first instance and a second instance from the plurality of instances within the result; removing the relationship between the first instance and the second instance from the results; and removing the first instance from the results when the first instance has no relationships with any other instances from the plurality of instances. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification