×

Concealing sensitive patterns from linked data graphs

  • US 9,268,950 B2
  • Filed: 12/30/2013
  • Issued: 02/23/2016
  • Est. Priority Date: 12/30/2013
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method to conceal sensitive patterns from Linked Data Graphs comprising:

  • receiving at a hardware processor, data representing a Linked Data graph form (data graph G) and a set of patterns S to be concealed in said data graph G;

    using the hardware processor to de-reference from the received data Uniform Resource Indicators (URIs) in the data graph G;

    using the hardware processor to compute inferences from the de-referenced data graph G structure;

    using the hardware processor to extract said patterns from said data graph G based on said computed inferences;

    using the hardware processor to compute for each pattern extracted its bindingsin data graph G which lead to the discovery of the patterns S; and

    using said hardware processor to remove each of the one or more bindings in the data graph G by suppressing one or more of;

    nodes, links between nodes, or nodes and links between nodes to form a new data graph G′

    such that the patterns discoverable in G, cannot be discovered in graph G′

    , andusing said hardware processor to render said new data graph G′

    in a form suitable for publishing over a communications network and accessible via a browser-based user device.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×