Ontology-based data access monitoring

• US 9,558,261 B2
• Filed: 04/06/2016
• Issued: 01/31/2017
• Est. Priority Date: 05/05/2014
• Status: Expired due to Fees

• Current Assignee: Streamline Licensing LLC (IP Edge LLC)
• Original Assignee: Empire Technology Development LLC (Allied Inventors Management, LLC)
• Inventors: Li, Daqi, Fang, Jun
• Primary Examiner(s): LEWIS, CHERYL RENEA
• Application Number:
  US15/092,229
• Publication Number:
  US 20160217205A1
• Time in Patent Office: 300 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/24542 Plan optimisation
• CPC Class Codes: G06F 16/288 Entity relationship models
• CPC Class Codes: G06F 16/95 Retrieval from the web
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

Technologies are generally described for methods and systems effective to monitor a data access activity. In some examples, a method may include receiving, by a processor, a destination concept. The processor may identify a set of concepts, which may include the destination concept and at least one related concept associated with the destination concept, in an ontology. The processor may generate a planned path, which may define a first data access order associated with access of at least one of the related concepts and the destination concept, using the set of concepts. The processor may generate a browsing path which may define a second data access order associated with the data access activity. The processor may compare the planned path with the browsing path. The processor may determine a deviation based on the comparison of the planned path and the browsing path. The processor may monitor the data access activity using the deviation.

Claims

1. A method to monitor a data access activity, the method comprising, by a processor:

receiving an indication of a destination concept;

identifying a first node in an ontology, wherein the first node corresponds to the destination concept;

identifying a link connected to the first node;

identifying a second node connected to the link, wherein the second node corresponds to a related concept associated with the destination concept, and the link is effective to indicate a relationship between the destination concept and the related concept;

identifying a set of nodes, wherein the set of nodes includes at least the first node and the second node, and the set of nodes corresponds to the destination concept and at least one related concept associated with the destination concept;

generating a planned path using the set of nodes, wherein the planned path is effective to define a first data access order associated with access of at least one of the related concepts and with the destination concept;

generating a browsing path effective to define a second data access order associated with the data access activity;

comparing the planned path with the browsing path; and

determining whether to issue an alert based on a result of the comparison of the planned path with the browsing path.

2. The method of claim 1, wherein determining whether to issue the alert includes:

determining a deviation based on the comparison of the planned path and the browsing path; and

comparing the deviation with a threshold, wherein determining whether to issue the alert is based on a result of the comparison of the deviation with the threshold.

3. The method of claim 2, further comprising:

determining that the deviation is greater than the threshold; and

issuing the alert in response to the deviation being greater than the threshold.

4. The method of claim 2, wherein the threshold relates to a distance between nodes in the ontology.

5. The method of claim 1, wherein the related concept is a first related concept, the link is a first link, the set of nodes further includes a third node, and generating the planned path comprises:

determining a first dependency between the first related concept and the destination concept based on the first link connected to the first node and the second node;

determining a second dependency between the second related concept and the destination concept based on a second link, wherein the second link is connected to the first node and the third node, and the third node corresponds to a second related concept associated with the destination concept;

determining a third dependency between the first related concept and the second related concept based on a third link connected to the second node and the third node; and

assigning the first, second, and third nodes in an order based on the first, second, and third dependencies, wherein generation of the planned path is based on the order of the first, second, and third nodes.

6. The method of claim 5, further comprising assigning the first node to be a start node of the planned path.

7. The method of claim 1, further comprising, prior to generating the planned path:

obtaining knowledge data that includes at least a known concept associated with a user, wherein the known concept corresponds to a third node;

searching for the third node in the set of nodes; and

generating the planned path includes determining a presence of the third node in the set of nodes.

8. The method of claim 7, wherein when the third node is present in the set of nodes, the method further comprising, removing the third node from the set of nodes.

9. The method of claim 1, wherein comparing the planned path with the browsing path comprises:

identifying a particular node in the browsing path, wherein the particular node corresponds to a particular concept in the ontology; and

determining whether the particular node is in the planned path.

10. A system configured to monitor a data access activity, the system comprising:

a memory configured to store an ontology;

a processor configured to be in communication with the memory, the processor being configured to;

receive an indication of a destination concept;

identify a first node in the ontology, wherein the first node corresponds to the destination concept;

identify a link connected to the first node;

identify a second node connected to the link, wherein the second node corresponds to a related concept associated with the destination concept, and the link is effective to indicate a relationship between the destination concept and the related concept;

identify a set of nodes, wherein the set of nodes includes at least the first node and the second node, and the set of nodes corresponds to the destination concept and at least one related concept associated with the destination concept;

generate a planned path using the set of nodes, wherein the planned path is effective to define a first data access order associated with access of at least one of the related concepts and with the destination concept;

store the planned path in the memory;

generate a browsing path effective to define a second data access order associated with the data access activity;

compare the planned path with the browsing path; and

determine whether to issue an alert based on a result of the comparison of the planned path with the browsing path.

11. The system of claim 10, wherein the processor is further configured to:

determine a deviation based on the comparison of the planned path and the browsing path; and

compare the deviation with a threshold, wherein the determination of whether to issue the alert is based on a result of the comparison of the deviation with the threshold.

12. The system of claim 11, wherein the processor is further configured to:

determine that the deviation is greater than the threshold; and

issue the alert in response to the deviation being greater than the threshold.

13. The system of claim 11, wherein the threshold relates to a distance between nodes in the ontology.

14. The system of claim 10, wherein the related concept is a first related concept, the link is a first link, the set of nodes further include a third node, and the processor is further configured to:

determine a first dependency between the first related concept and the destination concept based on the first link connected to the first node and the second node;

determine a second dependency between the second related concept and the destination concept based on a second link, wherein the second link is connected to the first node and the third node, and the third node corresponds to a second related concept associated with the destination concept;

determine a third dependency between the first related concept and the second related concept based on a third link connected to the second node and the third node; and

assign the first, second, and destination nodes in an order based on the first, second, and third dependencies, wherein generation of the planned path is based on the order of the first, second, and third nodes.

15. The system of claim 14, wherein the processor is further configured to assign the first node to be a start node of the planned path.

16. The system of claim 10, wherein the processor is further configured to, prior to the generation of the planned path:

obtain knowledge data that includes at least a known concept associated with a user, wherein the known concept corresponds to a third node;

search for the third node in the set of nodes; and

determine a presence of the third node in the set of nodes in order to generate the planned path.

17. The system of claim 16, wherein the processor is further configured to remove the third node from the set of nodes when the third node is present in the set of nodes.

18. The system of claim 10, wherein the processor is further configured to:

identify a particular node in the browsing path, wherein the particular node corresponds to a particular concept in the ontology; and

determine whether the particular node is in the planned path.

19. A method to generate a planned path associated with a data access activity, the method comprising, by a processor:

receiving an indication of a destination concept;

identifying a first node in an ontology, wherein the first node corresponds to the destination concept;

identifying a first link connected to the first node;

identifying a second node connected to the first link, wherein the second node corresponds to a first related concept associated with the destination concept, and the first link is effective to indicate a relationship between the destination concept and the first related concept;

identifying a second link connected to the first node;

identifying a third node connected to the second link, wherein the third node corresponds to a second related concept associated with the destination concept, and the second link is effective to indicate a relationship between the destination concept and the second related concept;

identifying a set of nodes, wherein the set of nodes includes at least the first node, the second node, and the third node, and the set of nodes corresponds to the destination concept and at least the first and second related concepts associated with the destination concept;

determining a first dependency between the first related concept and the destination concept based on the first link;

determining a second dependency between the second related concept and the destination concept based on a second link;

determining a third dependency between the first related concept and the second related concept based on a third link, wherein the third link connects the second node and the third node;

assigning the first, second, and third nodes in an order based on the first, second, and third dependencies; and

generating the planned path based on the order of the first, second, and third nodes, wherein the planned path is effective to define a data access order associated with access of at least one of the related concepts and with the destination concept.

20. The method of claim 19, wherein prior to generating the planned path, the method further comprising:

obtaining knowledge data that includes at least a known concept associated with a user, wherein the known concept corresponds to a fourth node;

searching for the fourth node in the set of nodes; and

when the result of the search indicates a presence of the fourth node in the set of nodes, removing the fourth node from the set of nodes to generate the planned path.