Data processing systems and methods for automatically redacting unstructured data from a data subject access request

Description

BACKGROUND

Computing tools for managing sensitive data, such as data storage systems and their associated applications for modifying or accessing stored data, are often used to automatically process requests regarding how that particular data is handled. For instance, processing such requests may require these computing tools to search multiple data assets that use a variety of different data structures, storage formats, or software architectures in order to identify and action requests to access personal data, delete or otherwise modify personal data, receive information about the handling, storage, and/or processing of personal data, etc. The effectiveness of these computing tools can be degraded when resources (e.g., processing power, storage, network bandwidth) are used to service requests having extraneous information that is not useful in processing the request, especially when a request is received as an unstructured electronic communication such as an email or text message. For example, such extraneous unstructured data may not correspond to any particular data type recognized by the data storage system to which the request is directed. Devoting resources to processing such extraneous data can degrade system performance through the wasteful expenditure of resources, the provision of an inaccurate or incomplete response to the request, or both.

SUMMARY

A method, according to various embodiments, may include: receiving, by computing hardware, a request for personal data associated with a data subject, the request comprising structured data and unstructured data; retrieving, by the computing hardware, a piece of the personal data by scanning a data source using the structured data; analyzing, by the computing hardware, the unstructured data to determine a first categorization for a first piece of the unstructured data and a second categorization for a second piece of the unstructured data; mapping, by the computing hardware, the first piece of the unstructured data to the piece of the personal data based on the first categorization and the personal data categorization; mapping, by the computing hardware, the second piece of the unstructured data to the piece of the personal data based on the second categorization and the personal data categorization; determining, by the computing hardware, that the first piece of the unstructured data matches the piece of the personal data; determining, by the computing hardware, that the second piece of the unstructured data does not match the piece of the personal data; in response to determining that the first piece of the unstructured data matches the piece of the personal data and the second piece of the unstructured data does not match the piece of the personal data, generating, by the computing hardware, redacted unstructured data comprising the first piece of the unstructured data and excluding the second piece of the unstructured data from the redacted unstructured data; and processing, by the computing hardware, the request using the redacted unstructured data.

In particular embodiments, the method further comprises determining an access method for the data source; and retrieving the piece of personal data comprises retrieving the piece of personal data from the data source using the access method. In particular embodiments, the method further comprises determining a first data type identifier for the data source, determining a second data type identifier for the structured data, and determining that the first data type identifier corresponds to the second data type identifier; and retrieving the piece of personal data comprises, in response to determining that the first data type identifier corresponds to the second data type identifier, retrieving the piece of personal data from the data source using the structured data. In particular embodiments, the piece of personal data is associated with a third data type identifier that is distinct from the first data type identifier and the second data type identifier. In particular embodiments, analyzing the unstructured data comprises: determining a first confidence score for the first categorization and a second confidence score for the second categorization; determining the first categorization for the first piece of the unstructured data based on the first confidence score; and determining the second categorization for the second piece of the unstructured data based on the first confidence score. In particular embodiments, processing the request comprises: determining that the redacted unstructured data represents a portion of the unstructured data greater than a threshold; and in response to determining that the redacted unstructured data represents the portion of the unstructured data greater than the threshold, suspending processing of the request and transmitting a notification that the redacted unstructured data represents a portion of the unstructured data greater than a threshold to a user. In particular embodiments, the method further comprises retrieving a second piece of the personal data by scanning a second data source using the piece of the personal data.

A system, according to various embodiments, may include: a non-transitory computer-readable medium storing instructions; and processing hardware communicatively coupled to the non-transitory computer-readable medium, wherein the processing hardware is configured to execute the instructions and thereby perform operations comprising: receiving a request for personal data associated with a data subject, the request comprising unstructured data; retrieving a piece of the personal data stored on a data source using a personal data categorization associated with the piece of the personal data; determining a first categorization for a first piece of the unstructured data and a second categorization for a second piece of the unstructured data; mapping the first piece of the unstructured data to the piece of the personal data based on the first categorization and the personal data categorization; mapping the second piece of the unstructured data to the piece of the personal data based on the second categorization and the personal data categorization; determining that the first piece of the unstructured data corresponds to the piece of the personal data; determining that the second piece of the unstructured data does not correspond to the piece of the personal data; generating redacted unstructured data comprising the first piece of the unstructured data and excluding the second piece of the unstructured data from the redacted unstructured data; and transmitting the redacted unstructured data for use in processing the request.

In particular embodiments, determining that the first piece of the unstructured data corresponds to the piece of the personal data comprises: determining that the first piece of the unstructured data matches the piece of the personal data; determining a confidence score based on determining that the first piece of the unstructured data matches the piece of the personal data; determining that the confidence score is greater than a threshold value; and in response to determining that the confidence score is greater than the threshold value, determining that the first piece of the unstructured data corresponds to the piece of the personal data. In particular embodiments, determining that the second piece of the unstructured data does not correspond to the piece of the personal data comprises: determining that the second piece of the unstructured data matches the piece of the personal data; determining a confidence score for based on determining that the second piece of the unstructured data matches the piece of the personal data; determining that the confidence score is less than a threshold value; and in response to determining that the confidence score is less than the threshold value, determining that the second piece of the unstructured data does not correspond to the piece of the personal data. In particular embodiments, the operations further comprise retrieving a second piece of the personal data stored on a second data source by searching the second data source using the piece of the personal data. In particular embodiments, the operations further comprise: determining a third categorization for a third piece of the unstructured data; mapping the third piece of the unstructured data to a second piece of the personal data based on the third categorization and a second personal data categorization associated with the second piece of the personal data; and determining that the third piece of the unstructured data corresponds to the second piece of the personal data. In particular embodiments, the method further comprises determining an access method associated with the data source; and retrieving the piece of personal data comprises retrieving the piece of personal data from the data source using the access method. In particular embodiments, the request further comprises structured data; retrieving the piece of the personal data stored on the data source comprises searching the data source using the structured data; the structured data is associated with a first data type identifier; the piece of the personal data is associated with a second data type identifier; and the first data type identifier is distinct from the second data type identifier.

A non-transitory computer-readable medium, according to various embodiments, may store computer-executable instructions that, when executed by processing hardware, configure the processing hardware to perform operations comprising: receiving an electronic communication comprising a request for personal data associated with a data subject, the request comprising a data subject identifier and message data; retrieving, based on the data subject identifier, a piece of the personal data by scanning a data source using a personal data categorization for the piece of the personal data; analyzing the message data to determine a first categorization for a first piece of the message data and a second categorization for a second piece of the message data; mapping the first piece of the message data to the piece of the personal data based on the first categorization and the personal data categorization; mapping the second piece of the message data to the piece of the personal data based on the second categorization and the personal data categorization; determining that the first piece of the message data matches the piece of the personal data; determining that the second piece of the message data does not match the piece of the personal data; in response to determining that the first piece of the message data message data matches the piece of the personal data and the second piece of the message data does not match the piece of the personal data, generating redacted message data comprising the first piece of the message data and excluding the second piece of the message data from the redacted message data; and processing the request using the redacted message data.

In particular embodiments, the operations further comprise retrieving a second piece of the personal data by scanning a second data source using the piece of the personal data. In particular embodiments, the piece of the personal data is associated with a first data type identifier; the second piece of the personal data is associated with a second data type identifier; and the first data type identifier is distinct from the second data type identifier. In particular embodiments, the operations further comprise determining the second data source based on the first data type identifier. In particular embodiments, processing the request comprises: determining that the request was processed; based on determining that the request was processed, generating a graphical user interface for a browser application executed on a user device by configuring a first display element configured to display an indication that the request was successfully processed on the graphical user interface and excluding a second display element configured to display an indication that the request was not successfully processed from the graphical user interface; and transmitting an instruction to the browser application causing the browser application to present the graphical user interface on the user device. In particular embodiments, generating the graphical user interface comprises configuring a third display element configured to display the personal data on the graphical user interface.

BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments of a system and method for automatically redacting unstructured data from a data subject access request are described below. In the course of this description, reference will be made to the accompanying drawings, which are not necessarily drawn to scale, and wherein:

FIG. 1 depicts an example of a computing environment for performing redaction with respect to a data subject access request.

FIG. 2 is a flow chart showing an example of a process performed by a Personal Data Discovery and Identity Graph Generation Module according to various embodiments.

FIG. 3 is a diagram illustrating a representation of an exemplary identity graph and associated metadata according to various embodiments.

FIG. 4 is a flow chart showing an example of a process performed by an Automatic Unstructured Data Redaction Module according to various embodiments.

FIG. 5 is a diagram illustrating representations of exemplary data structures that may be used by systems and methods for automatically redacting unstructured data according to various embodiments.

FIG. 6 is a diagram illustrating an exemplary network environment in which the various systems and methods for automatically redacting extraneous information and/or unstructured data may be implemented.

FIG. 7 is a schematic diagram of a computer that is suitable for use in various embodiments.

DETAILED DESCRIPTION

Various embodiments now will be described more fully hereinafter with reference to the accompanying drawings. It should be understood that the invention may be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Like numbers refer to like elements throughout.

Overview

In various embodiments, an unstructured data redaction system may be configured to dynamically determine whether one or more pieces of data included in a request for data associated with a particular data subject (e.g., a data subject access request (DSAR), a consumer rights request, etc.) are relevant to the request. The unstructured data redaction system may analyze the request using an identity graph representing personal data associated with the data subject to identify pieces of data in the request that are relevant to the request (e.g., associated with the data subject) and pieces of data that are not relevant to the request (e.g., not associated with the data subject). The unstructured data redaction system may then redact pieces of data that are not relevant and process the request using the relevant data.

To generate an identity graph that represents a data subject's personal data, an exemplary unstructured data redaction system may be configured to search various data sources using pieces of personal data associated with the data subject. The unstructured data redaction system may scan each of the data sources using the data subject's personal data to discover and correlate data type identifiers associated with the identified personal data with that data subject. Using this information, the unstructured data redaction system may generate an identity graph of the user's personal data. The identity graph may include a mapping of the personal data that is stored or otherwise handled at each data source and the means by which such personal data may be accessed at each data source. The identity graph may be stored as metadata along with the data type identifiers that are used with the particular data source to access the personal data stored on the data source. Such data type identifiers may indicate a classification and/or categorization for the personal data (e.g., telephone number, home address, postal code, name, etc.).

When a request for data associated with a data subject is received, the unstructured data redaction system may parse the information in the request to classify and/or categorize pieces of data in the request. The unstructured data redaction system may use the identity graph generated for the data subject's personal data to determine and/or retrieve (e.g., all available) personal data associated with the user and the associated data type identifiers for each piece of such personal data. The unstructured data redaction system may map the categorized request data to the personal data associated with the data subject based on the data type identifiers associated with such personal data. The unstructured data redaction system may then compare the categorized request data to the corresponding personal data to determine whether, or to what extent, each piece of the request data matches the known personal data for the user. The quality of a data match may be determined based on a correlation of the request data values and the known personal data values. In particular embodiments, the quality of a data match may be further determined based on a confidence score of the known personal data (e.g., retrieved from the data sources using the graph). The unstructured data redaction system may then discard or otherwise redact those pieces of data in the request that do not match (e.g., sufficiently match) known personal data associated with the data subject as determined using the identity graph. The unstructured data redaction system may then process the request using the unredacted request data.

FIG. 1 illustrates an exemplary computing environment in which unstructured data may be redacted from a DSAR and the DSAR may be processed using the remaining (e.g., relevant) data. A DSAR processing system 110 may generate, at a DSAR generation module 115, a DSAR 111 in response to, for example, a request from a data subject. The DSAR 111 may be a request to perform any data request actions as described herein. The DSAR 111 may include unstructured data. The DSAR generation module 115 may provide the DSAR 111 to a personal data discovery and correlation module 120 of an unstructured data redaction system 150 that may use the DSAR 111 to generate an identity graph 121 representing the personal data associated with the data subject that requested the DSAR 111. The personal data discovery and correlation module 120 may search various data sources 125 using pieces of personal data associated with the data subject that the personal data discovery and correlation module 120 may determine, for example, from the DSAR 111. The personal data discovery and correlation module 120 may scan the data sources 125 using the data subject's personal data to discover and correlate data type identifiers associated with the identified personal data with that data subject. Using this information, the personal data discovery and correlation module 120 may generate the identity graph 121 of the user's personal data. The identity graph 121 may include a mapping of the personal data that is stored or otherwise handled at each of the data sources 125 and the means by which such personal data may be accessed at each such data source. The identity graph 121 may be stored as metadata along with the data type identifiers that are used with the particular data source of the data sources 125 to access the personal data stored on the particular data source. Such data type identifiers may indicate a classification and/or categorization for the personal data (e.g., telephone number, home address, postal code, name, etc.).

An automatic unstructured data redaction module 140 may parse the information in the DSAR 111 to classify and/or categorize pieces of data in the DSAR 111. The automatic unstructured data redaction module 140 may use the identity graph 121 generated for the data subject's personal data to determine and/or retrieve (e.g., all available) the personal data associated with the user from the data sources 125 and the associated data type identifiers for each piece of such personal data. The automatic unstructured data redaction module 140 may map the categorized data from the DSAR 111 to the personal data associated with the data subject based on the data type identifiers associated with such personal data. The automatic unstructured data redaction module 140 may then compare the categorized data from the DSAR 111 to the corresponding personal data to determine whether, or to what extent, each piece of the categorized data from the DSAR 111 matches the known personal data for the user. As described in more detail herein, the quality of a data match may be taken into account in determining the particular pieces of the categorized data from the DSAR 111 are relevant. The automatic unstructured data redaction module 140 may then discard or otherwise redact those pieces of categorized data from the DSAR 111 that do not sufficiently match known personal data associated with the data subject as determined using the identity graph 121. The automatic unstructured data redaction module 140 may then provide the redacted DSAR 141 to a DSAR processing module 116 of the DSAR processing system 110 for processing using the unredacted request data.

Personal Data Discovery and Identity Graph Generation Systems and Methods

As noted herein, an entity that handles (e.g., collects, receives, transmits, stores, processes, shares, etc.) sensitive and/or personal information associated with particular individuals (“personal data”) may be subject to various laws and regulations regarding the handling of such personal data. The applicable laws and regulations may vary based on the jurisdiction in which the entity is operating, the jurisdiction in which the individual associated with the personal data (“data subject”) is located, and/or the jurisdiction in which the personal data is handled. In many jurisdictions, an entity that handles personal data may be required to track the personal data they handle, by maintaining and/or readily generating information that indicates where the personal data is stored, how the personal data is processed, how the personal data is collected, etc. The entity may be required to have this information available (or have to ability to obtain this information) so that it can readily service data subject access requests (DSARs). As noted above, a DSAR may be a request from a data subject or other user to access personal data, delete personal data, receive information about the handling of personal data, etc. The entity may also, or instead, be required to have this information available (or have to ability to obtain this information) to comply with various aspects of applicable laws, regulations, and/or standards. The entity may also, or instead, want to be able to have this information available (or have to ability to obtain this information) to perform other functions, such as mine legacy systems for personal data (e.g., to ensure that legacy systems comply with current laws, regulations, and/or standards), create maps of where personal data may be stored, identify personal data that may need to be modified (deleted due to age or other factors, updated, supplemented, etc.), generate identity graphs representing personal data associated with a particular data subject, and/or perform unstructured data redaction functions in processing requests for data.

As the quantity of personal data increases over time, and as the number of systems that may possibly be handling personal data increases, determining how particular personal data has been handled (e.g., collected, received, transmitted, stored, processed, shared, etc.) across all of the potential systems that may have handled such personal data can be difficult. Discovering particular personal data cross multiple systems may become even more challenging when each of the systems may use its own, possibly unique, method of identifying the data subject associated with the particular personal data. Where different means of identifying a data subject are used across multiple systems, locating personal data associated with a particular data subject may not be feasible by simply using a name or other single piece of information associated with the particular data subject.

In various embodiments, the unstructured data redaction system may connect to data sources that handle personal data for a particular data subject. Such data sources may include, but are not limited to, file repositories (structured and/or unstructured), data repositories, databases, enterprise applications, mobile applications (“apps”), cloud storage, local storage, and/or any other type of system that may be configured to handle personal data. The unstructured data redaction system may analyze some or all of the data stored on the data sources to determine whether such data includes pieces of personal data. If so, the unstructured data redaction system may label or otherwise store an indication that the personal data stored on the data sources as personal data. The unstructured data redaction system may then record the location of each of the pieces of personal data and/or the location of each of the data sources on which each of the pieces of personal data were discovered. The unstructured data redaction system may also record the manner of identification used to identify each of the pieces of personal data. The unstructured data redaction system may store any such information as metadata. This personal data information may then be used when the unstructured data redaction system needs to locate the particular personal data, for example, to respond to a request for data, generate an identity graph representing the particular personal data, and/or perform unstructured data redaction in processing a request for data. The unstructured data redaction system may also, or instead, use such personal data information to comply with various requirements (e.g., legal, regulatory, standards, etc.), to mine legacy systems for personal data, to create a map of where personal data may be stored, to identify personal data that may need to be modified, etc.

In analyzing the data on various data sources, the unstructured data redaction system may determine whether a particular piece of personal data on a first data source corresponds to particular piece of personal data on a second data source using various methods. For example, the unstructured data redaction system may compare the pieces of personal data (e.g., text string comparison) to determine if they are the same. In particular embodiments, the unstructured data redaction system may compare the data type identifiers of the pieces of personal data to determine if they correspond. In particular embodiments, the unstructured data redaction system may use artificial intelligence, big data methods, and/or neural networks to perform more sophisticated analysis to determine whether the particular pieces of personal data correspond to one another. For example, in some embodiments, two particular pieces of personal data may not have similar data type identifiers and/or may be stored in different formats but may actually both represent a same type of personal data (e.g., email address, telephone number, name, etc.). In such embodiments, the unstructured data redaction system may use artificial intelligence, machine learning, neural networking, big data methods, natural language processing, contextual awareness, and/or continual learning (in any combination) to identify particular pieces of personal data and/or to determine whether and how particular pieces of personal data match up to one another. Once a piece of personal data is identified and/or matched with one or more other pieces of personal data, the unstructured data redaction system may store information reflecting the identification and/or matching in metadata for future use, including as described herein.

In a particular embodiment, the unstructured data redaction system may tag (e.g., in metadata) particular pieces of personal data with an indicator that indicates that the respective particular piece of personal data can be used to query its data source associated with that particular piece of personal data (e.g., a “queryable” tag). The unstructured data redaction system may also, or instead, tag (e.g., in metadata) fields associated with personal data storage at a particular data source with an indicator that indicates that the respective field may contain data that can be used to query that data source (e.g., a “queryable” tag). The unstructured data redaction system may then use such a tag in future attempts to locate particular personal data, for example, stored in a particular data source.

FIG. 2 illustrates an example process that may be performed by a Personal Data Discovery and Identity Graph Generation Module 200. At Step 210, a particular user may submit a DSAR requesting a copy of the personal data associated with the particular data subject indicated by the DSAR. The DSAR may include the particular data subject's first name, last name, and email address. While this example uses a DSAR requesting a data subject's personal data, in various embodiments the unstructured data redaction system may locate particular personal data in response to a need to, for example, comply with various requirements (e.g., legal, regulatory, standards, etc.), mine legacy systems for personal data, create a map of where personal data may be stored, to identify personal data that may need to be modified, proactively generate an identity graph, etc.

At Step 220, using the information included in the DSAR, such as personal data, the unstructured data redaction system may identify a particular data subject associated with the DSAR (who may or may not be the user that submitted the DSAR). At Step 230, the unstructured data redaction system may identify data sources that store personal data. In particular embodiments, the unstructured data redaction system may identify data sources that store personal data generally and scan (e.g., all) of such data sources for personal data associated with the particular data subject as described in more detail below. Alternatively, the unstructured data redaction system may determine a subset of the data sources that store personal data generally for scanning based on, for example, information in the DSAR. For example, the unstructured data redaction system may determine that the DSAR is a request for a specific type of information (e.g., billing, financial, healthcare, etc.) and may determine a subset of data sources that store personal data associated with that specific type of information. In another example, the unstructured data redaction system may determine that the DSAR is a request from a specific type of data subject (e.g., customer, subscriber, member, etc.) and may determine a subset of data sources that store personal data associated with that specific type of data subject. The unstructured data redaction system may also, or instead, use any other means of determining a particular set of data sources for personal data scanning.

The unstructured data redaction system, according to this particular example, may have access to personal data associated with the particular data subject stored in two separate data sources. The first data source may be a customer database that stores the username of the particular data subject, along with the particular data subject's email address, first name, last name, social security number, postal code (e.g., zip code), and street address. The first data source may (e.g., only, or most efficiently) be searchable by email address. The second data source may be a certified drivers database that stores the particular data subject's driver's license record and social security number. The second data source may (e.g., only, or most efficiently) be searchable by social security number. In this example, if an initial search was executed against these two data sources using the information provided in the DSAR (the particular data subject's first name, last name, and email address), only the first data source would return results because only it may be searched using an email address, whereas the second data source may not be searchable using an email address.

In various embodiments, the unstructured data redaction system may record metadata that correlates (or may be used to correlate) the data in the two data sources. For example, at Step 240, the unstructured data redaction system may scan the first data source using the email address provided by the DSAR. The unstructured data redaction system may determine to scan the first data source by determining that the first data source is searchable using personal data or other information that may be associated with the particular data subject that was included in the DSAR. The unstructured data redaction system may obtain or identify, in response to the scan, first additional personal data associated with the particular data subject stored on the first data source. For example, the unstructured data redaction system may obtain, via the scan of the first data source, the particular data subject's username, email address, first name, last name, social security number, postal code, and street address as stored on the first data source.

At Step 250, using a piece of personal data obtained from the first data source, such as the particular data subject's social security number, the unstructured data redaction system may scan the second data source to obtain or identify second additional personal data associated with the particular data subject stored on the second data source. For example, the unstructured data redaction system may obtain, via the scan of the second data source, the particular data subject's driver's license information (e.g., driver's license number).

At Step 260, the unstructured data redaction system may perform a check to determine whether the first additional personal data and the second additional personal data correspond to the particular data subject. For example, the unstructured data redaction system may compare the information received from each of the two data sources to verify that it is consistent and appears to correspond to the particular data subject (e.g., pieces of personal data of the same type have the same value or substantially similar values and/or are associated with pieces of personal data known to be associated with the particular data subject). At Step 270, the unstructured data redaction system may store a record (e.g., in metadata) of the particular personal data information (e.g., personal data, type of personal data) stored in each of the two data sources and how to access such information at each data source for the particular data subject.

FIG. 3 illustrates an exemplary identity graph 300 and table 390 representing examples of data structures that may be used in the various embodiments. The identity graph 300 is a diagrammatic representation of an identity graph representing personal data associated with a data subject 350. The table 390 represents metadata associated with the identity graph 300.

In various embodiments, the unstructured data redaction system may scan data sources that may store personal data and generate a graph for each data source. In this example, the unstructured data redaction system may scan each of the data sources 310, 320, and 330 to generate graphs 301, 302, and 303, respectively. Each of graphs 301, 302, and 303 may also be referred to as a node of the identity graph 300. Each such graph may include a mapping of the personal data that is stored or otherwise handled at the respective data source and the means by which such personal data may be accessed. The graphs may be stored as metadata along with the data type identifiers identifying the types of data that may be searched for in the particular data source to access the personal data stored on the data source. For example, if a data source has a “telephone number” data type identifier, telephone numbers may be searched in the data source to retrieve records that may include other types of data that are not searchable on that data source (e.g., search for a particular telephone number and if a match is found, data associated with the particular telephone number may be retrieved because it is linked to the telephone number, such as name, address, email, etc.).

In this example, the table 390 illustrates the metadata associated with each data source graph, or node, of identity graph 300. As can be seen in this figure, the data source 310 stores email, telephone numbers, addresses, and names, is searchable (e.g., queryable) using telephone numbers (e.g., telephone numbers may be searched on data source 310 to retrieve other data associated with a telephone number), and is accessible using the particular access method list for the data source 310 in the table 390. The access method listed in the table 390 may be a particular query that may be used to retrieve data from a data source or a reference (e.g., indicator, pointer, identifier, etc.) thereto. Alternatively, the access method listed in the table 390 may be a query template, a script, and/or any other means of accessing data at a data source or a reference (e.g., indicator, pointer, identifier, etc.) thereto.

As the unstructured data redaction system scans various data sources, the unstructured data redaction system may discover new data type identifiers for a particular data subject and/or personal data associated with the particular data subject. The unstructured data redaction system may use a dependency graph to indicate which data sources use data type identifiers that may be obtained from other data sources, thus creating a record of the interrelation of the various data sources. The unstructured data redaction system may store these new data type identifiers in metadata and determine whether there are any other data sources in scope (e.g., that use the same data type identifier). For those data sources that do not use the same data type identifier, the unstructured data redaction system may use another data type identifier determined from another data source to access the personal data for the particular data subject in those data sources.

For example, referring again to FIG. 3, the unstructured data redaction system may receive or determine a particular data subject's telephone number (e.g., in a request for data associated with the particular data subject) and may scan the data source 310 using the telephone number as the data type identifier and the access method associated with the data source 310. The unstructured data redaction system may discover that the data source 310 also stores email, addresses, and names. The unstructured data redaction system may store data type identifiers for this data and use those data type identifiers to scan other data sources that are not searchable by telephone number but may be searchable by the data type identifiers discovered at the data source 310. For example, having obtained the particular data subject's email address from the scan of the data source 310, the unstructured data redaction system may then scan the data sources 320 and 330 (which may be searchable by email but not by telephone number) using the email address as the data type identifier. These scans may result in the discovery of additional data associated with the particular data subject, as shown in the table 390.

As will be appreciated, the various disclosed embodiments may facilitate, based on a single piece of a particular data subject's data, the discovery of many types of data associated with a particular data subject in a variety of data sources that may each use different types of data type identifiers and different means of access. The unstructured data redaction system may use the other types of data discovered in a first data source using a first type of data to scan a second set of data sources that may not be searchable with the first type of data. The unstructured data redaction system may add a node to the identity graph for each data source in the second set of data sources in which the unstructured data redaction system identified data associated with a particular data subject. The unstructured data redaction system may then scan yet a third set of data sources using data discovered in the second set of data sources and add nodes for data sources in the second set of data sources to identity graph as data associated with the particular data subject is identified. The unstructured data redaction system may execute this process iteratively until the available data sources have all been scanned and a complete identity graph has been generated that can be used to efficiently perform other functions, such as automatically redacting unstructured data from a request for data.

In various embodiments, the unstructured data redaction system may generate identity graphs according to the disclosed embodiments at any time. For example, the unstructured data redaction system may generate an identity graph for any new, or newly detected, data subject in response to the detection of the new data subject. Alternatively, or in addition, the unstructured data redaction system may generate an identity graph associated with a data subject's personal data in response to receiving a request from data associated with that data subject, for example, before processing the request. The unstructured data redaction system may also, or instead, modify any such graphs in response to an event (e.g., detection of personal data modification on a data source, detection of the additional and/or removal of a data source, etc.) or on a recurring (e.g., periodic) basis. The unstructured data redaction system may also, or instead, delete any such graphs in response to an event (e.g., detection of the removal of personal data from a data source, detection of the removal of data sources associated with the graph, etc.), or in response to determining that the graph is no longer in use (e.g., unused for at least a pre-determined period of time).

Systems and Methods for Automatically Redacting Unstructured Data From a Data Request

As described herein, an entity that handles personal data associated with a particular data subject may receive data requests (e.g., DSARs) from, or on behalf of, the data subject. Each such request may be a request to access, delete, retrieve, and/or modify personal data associated with the data subject. Each such request may also, or instead, be a request for information about the manner in which the entity handles, stores, and/or processes the personal data associated with the data subject.

Often such requests may take the form of, or may be provided via, electronic communications such as emails, chats, texts, or documents containing unstructured data (e.g., data for which data types and/or associations are not indicated). Such requests may include information that is not relevant to or useful in processing the request. Such requests may also, or instead, include information that is associated with personal data of users other than the data subject associated with the request. It can be challenging to separate the useful (e.g., for purposes of processing the request) information in a request from information that is not useful. For example, an email associated with a request may include names, telephone numbers, email addresses, and/or home addresses of several people (e.g., in an email string) while the request is related to only the personal data associated with a single particular data subject. The disclosed unstructured data redaction systems and methods provide means of automatically and efficiently redacting such extraneous information from a request while retaining the relevant personal data associated with a particular data subject for processing the request.

In various embodiments, and as described in more detail above, the unstructured data redaction system may be configured to generate an identity graph for a data subject's personal data using pieces of the personal data to search across various data sources. The unstructured data redaction system may use pieces of personal data associated with a data subject to search across various data sources to discover and correlate associated data type identifiers with the particular data subject. For example, the unstructured data redaction system may use a known piece of information for a data subject (e.g., a first name, a last name, an account number, an email address, a telephone number, a username, an IP address, etc.) to identify other pieces of information from a data source associated with that known piece of information. The unstructured data redaction system may then correlate those identified other pieces of information with the data subject and store (e.g., in metadata) such correlation information to generate an identity graph for the data subject. The identity graph may include a mapping of the personal data (e.g., types of personal data, categories of personal data, etc.) that is stored or otherwise handled at each data source and the means by which such personal data may be accessed. The graph may be stored as metadata including the data type identifiers that are used with the particular data source to access the types of personal data stored on the data source for the data subject. Such data type identifiers may indicate a classification or category for the data (e.g., telephone number, home address, postal code, name, etc.). The graph can then be used to retrieve any information identified in the graph from the data sources as needed, for example to process a request for data and/or to redact extraneous data from such a request as described herein.

In response to receiving a request for data (e.g., DSAR, consumer rights request, etc.) from, or on behalf of, a particular data subject, the unstructured data redaction system may use an identity graph associated with the particular data subject's personal data to determine and/or retrieve (e.g., all or any portion of) the available personal data associated with the data subject.

Further in response to receiving the data request, the unstructured data redaction system may analyze the information in the request to classify and/or categorize each piece of information in the request. In classifying and/or categorizing each such piece of information, the unstructured data redaction system may assign each piece of information a data type identifier, for example, selected from the data type identifiers that may potentially be used to categorize pieces of personal data identified in identity graphs as described herein. In particular embodiments, the unstructured data redaction system may use natural language processing (NLP), machine learning, neural networks, and/or any other advanced processing techniques to identify and categorize information in a request. The unstructured data redaction system may also assign a confidence score to the categorization of each piece of information in a request using various techniques (e.g., 70% confident a particular piece of information is a postal code, 80% confident a particular piece of information is a telephone number, etc.). Categorizations may be associated with a type of information determined for each piece of information in the request (e.g., email, address, first name, last name, postal code, telephone number, etc.).

After the request information has been categorized and the data subject's personal data has been retrieved using an identity graph, the unstructured data redaction system may map pieces of the categorized request information to pieces of the data subject's personal data based on the data type identifiers and categories associated with each such piece of information. For example, the unstructured data redaction system may determine that a piece of request information appears to be a telephone number and may therefore categorize that piece of request information as a “telephone number.” The unstructured data redaction system may then match that piece of request information to a retrieved piece of personal data having a “telephone number” data type identifier as indicated in the data subject's graph to determine a data pairing that may then be compared as described below.

The unstructured data redaction system may then determine, for each pairing of a piece of request data with a piece of retrieved personal data that have matching categories/data type identifiers, whether the piece of request data matches the piece of retrieved personal data. For example, where the unstructured data redaction system has determined a pairing of a piece of request information categorized as a “telephone number” with a retrieved piece of personal data having a “telephone number” data type identifier, the unstructured data redaction system may then determine whether the telephone numbers represented by these pieces of information are the same telephone number. Various techniques may be used to determine whether the pieces of data match, including a strict character string match, NLP-based matching, and/or any other data matching techniques or combinations thereof. The unstructured data redaction system may determine that those pieces of information from the request that match a piece of personal data associated with the data subject are relevant to the request and may be used in processing the request.

The unstructured data redaction system may determine whether the data associated with each piece of information in a pairing is a match based on the correlation of the data values in combination with other criteria. For example, the unstructured data redaction system may consider a confidence score for the piece of information that was detected by analyzing the request and/or for the piece of information retrieved from a data source using an identity graph. Other criteria may also be used. The unstructured data redaction system may be configured to calculate a match score for each pairing (e.g., 100% match, 75% match, etc.) and determine that a pairing constitutes a match when the respective match score meets or exceeds a threshold (e.g., 70%, 80% etc.).

In response to determining whether each piece of information in a request is relevant, the unstructured data redaction system may then discard, redact, or otherwise ignore the pieces of request information that do not match personal data associated with the data subject. The unstructured data redaction system may then process the request using the unredacted data included in the request, and, in particular embodiments, data retrieved using identity graphs as described herein.

FIG. 4 shows an example process that may be performed by an Automatic Unstructured Data Redaction Module 400. In executing the Automatic Unstructured Data Redaction Module 400, the unstructured data redaction system begins at Step 410 where the unstructured data redaction system receives a request for data associated with a particular data subject, such as a DSAR. This request may take the form of a message or other electronic communication that may include message data that includes unstructured data. For example, the request may be an email that includes message data (e.g., email body) that is unstructured data. In another example, the request may be a text message that includes message data (e.g., text message content) that includes unstructured data. Using information in or associated with the request, at Step 420 the unstructured data redaction system may identify and retrieve an identity graph associated with the particular data subject's personal data. For example, the request may include structured data fields that may be populated with a data subject's name, email address, telephone number, and/or other data type identifiers (e.g., user name, IP address, account number, member number, etc.). The unstructured data redaction system may use this structured data to identify the particular data subject and retrieve the identity graph associated with the particular data subject's personal data.

At Step 430, the unstructured data redaction system may use the identity graph associated with the particular data subject's personal data to determine and/or retrieve (e.g., all or any portion of) the available personal data associated with the data subject from the data sources represented in the identity graph, for example, using the access methods and/or data type identifiers indicated for each data source in its respective identity graph node. In various embodiments, the unstructured data redaction system may use the structured data from the request to search those data sources that are indicated in the identity graph as being searchable using the type of data associated with the structured data. For example, when the request includes a structured telephone number data field, the unstructured data redaction system may use the value of this field to search a first data source that is searchable by telephone number. Using the results of this initial search (e.g., an email address), the unstructured data redaction system may then search a second data source that is searchable by email address but not telephone number. If there is a third data source that is not searchable by either telephone number or email address, the unstructured data redaction system may use the results of searches of the first and second data sources to further search this third data source, using the results of that search to search subsequent data sources and so on, until the available personal data associated with the data subject has been retrieved from the data sources indicated in the identity graph.

At Step 440, the unstructured data redaction system may analyze the unstructured data in the request to assign a category and/or classification to each piece of information in the unstructured data portion of the request. In classifying and/or categorizing each such piece of information, the unstructured data redaction system may assign each piece of information a data type identifier, for example, selected from the identifiers of types of personal data that may be used by the unstructured data redaction system to categorize pieces of personal data (e.g., as identified in identity graphs as described herein). Examples of such data type identifiers include but are not limited to, email, address, first name, last name, postal code, telephone number, etc. In particular embodiments, the unstructured data redaction system may use data type identifiers that indicate that a piece of unstructured data is irrelevant, for example, the conversational text within a request. In other embodiments, the unstructured data redaction system may assign a data type identifier associated with a particular type of personal data to every piece of unstructured data and rely on a low confidence score to indicate that a particular piece of unstructured data is irrelevant (e.g., not a good match for a data type identifier, such as conversational text). As noted, the unstructured data redaction system may use NLP, machine learning, neural networks, and/or any other advanced processing techniques to identify and categorize each piece of information in the unstructured data portion of the request.

At Step 450, the unstructured data redaction system may determine a confidence score for each categorization and/or classification assigned to each piece of information in the unstructured data portion of the request. The unstructured data redaction system may use any of various techniques to determine a confidence score, such as machine learning and NLP, in particular embodiments, integrating human feedback as described in more detail below. In particular embodiments, a confidence score may have a (e.g., numerical) value that may be compared to a threshold value (e.g., 70% confident a particular piece of information is a postal code, 80% confident a particular piece of information is a telephone number, 50% confident a particular piece of information is message text, etc.). In particular embodiments, a confidence score may indicate that a piece of unstructured data is irrelevant regardless of the categorization and/or classification. For example, the unstructured data redaction system may classify conversational text within a request as “names” because it is made up of character strings, but because such text has no other attributes of the “names” classification, the unstructured data redaction system may assign a very low or zero confidence score to such unstructured data.

At Step 460, the unstructured data redaction system may map eligible pieces of the categorized request information to pieces of the data subject's personal data based on the data type identifiers and categories associated with each such piece of information. The unstructured data redaction system may discard or ignore those pieces of the request information that remain uncategorized, have too low a confidence score, or are categorized as being data ineligible for mapping to the data subject's personal data. For example, the unstructured data redaction system may have determined that a piece of request information appears to be a telephone number and may have therefore categorized that piece of request information as a “telephone number.” The unstructured data redaction system may then match that piece of request information to a retrieved piece of personal data having a “telephone number” data type identifier (e.g., as indicated in the data subject's identity graph) to determine a data pairing that may then be compared as described below.

At Step 470, the unstructured data redaction system may compare each piece of categorized unstructured data from the request to the piece of retrieved personal data to which it is mapped to determine whether the pieces of data match. For example, where the unstructured data redaction system has paired a piece of unstructured data categorized as a “telephone number” with a retrieved piece of personal data having a “telephone number” data type identifier, the unstructured data redaction system may then determine whether the telephone numbers represented by these pieces of information are the same telephone number. As noted above, various techniques may be used to determine whether the pieces of data match.

In particular embodiments, the unstructured data redaction system may use determine a confidence or match score for a match and determine whether the pieces of data in a pair match based on the score. For example, the unstructured data redaction system may compare a confidence or match score for a data pairing (e.g., 50% 75%, 90%, etc.) against a threshold confidence score (e.g., 75%, 85%, etc.) and determine that the data in the pairing matches if the confidence score meets or exceeds the threshold. The unstructured data redaction system may also, or instead, take into account a confidence score for one or both pieces of data in a pairing (e.g., a confidence score for the categorization of a piece of unstructured data and/or a confidence score for the categorization of a piece of personal data retrieved from a data source using an identity graph). Other criteria may also be used.

At Step 480, the unstructured data redaction system may discard, redact, or otherwise ignore the pieces of unstructured data from the request that do not match personal data associated with the data subject and are therefore irrelevant to the request. Further at Step 480, the unstructured data redaction system may then process the request using the unredacted unstructured data included in the request, and, in particular embodiments, data retrieved using identity graphs as described herein.

A simplified example illustrating the operation of an unstructured data redaction system with reference to various exemplary data structures will now be described. FIG. 5 illustrates exemplary data structures and operations 500, including a representation of an exemplary DSAR 510. The DSAR 510 may include a structured data field 511 and unstructured data 512. The unstructured data redaction system may determine a data type identifier for the data subject associated with the DSAR 510 based on the value in the structured data field 511, in this example, an email address. Using the determined data subject identifier, at operation 501 the unstructured data redaction system may identify and retrieve personal data associated with the data subject 530, in particular embodiments using an identity graph associated with the data subject as described herein. Further at operation 501, the unstructured data redaction system may analyze and categorize the unstructured data 512 to generate categorized unstructured data 520. During this process, the unstructured data redaction system may discard those portions of the unstructured data 512 that are not eligible for matching with the data subject's personal data (e.g., message data such as email text or text message content that does not contain categorizable potentially relevant data).

At operation 502, the unstructured data redaction system may map pieces of the categorized unstructured data 520 to pieces of the retrieved personal data 530 based on the respective categorizations of each piece of data (e.g., as described herein). For example, as shown in this figure, the data categorized as telephone numbers in the categorized unstructured data 520 is mapped to the data categorized as a telephone number in the retrieved personal data 530, the data categorized as names in the categorized unstructured data 520 is mapped to the data categorized as a name in the retrieved personal data 530, and the data categorized as email addresses in the categorized unstructured data 520 is mapped to the data categorized as an email address in the retrieved personal data 530.

At operation 503, the unstructured data redaction system determines whether each piece of the categorized unstructured data 520 match the piece of retrieved personal data 530 to which it is mapped and redacts those pieces of the categorized unstructured data 520 that do not match a piece of retrieved personal data 530 to generate the redacted unstructured data 540. The unstructured data redaction system generates the relevant unstructured data 550 using the redacted unstructured data 540 and provides the relevant unstructured data 550 use in processing the DSAR 510 at operation 504.

In various embodiments, the unstructured data redaction system may be configured to perform functions that improve the performance and accuracy of categorization and/or classification determinations and the matching process. In particular embodiments, the unstructured data redaction system may generate a graphical user interface configured with presentation elements that present categorization, classification, and/or matching data to allow the user to review the results of the processes that generated this data. The unstructured data redaction system may further configure user input elements on the graphical user interface to allow a user or provide input regarding the presented data. Alternatively, or in addition, the unstructured data redaction system may configure navigation elements configured to trigger the generation of a subsequent graphical user interface that may allow the user to provide input regarding the presented data. Such interfaces may improve request data relevance determinations by gathering feedback that the unstructured data redaction system may use to improve the categorization and/or classification of data received in requests and the matching process.

In a particular example, the unstructured data redaction system may present a graphical user interface to the user indicating the pairings of potential matches that the unstructured data redaction system has identified and associated confidence levels for each pairing. In particular embodiments, the confidence levels that may be used include, but are not limited to: (1) a confidence level that a piece of information identified from a request is a particular type of information; (2) a confidence level that a piece of information retrieved from a data source using an identity graph is associated with a particular data subject; and (3) a confidence level that a piece of information identified from a request matches a piece of information retrieved from a data source using an identity graph. In particular embodiments, the unstructured data redaction system may present all such pairings to the user, while in other embodiments, the unstructured data redaction system may present only pairings that are associated with a confidence below or above a certain threshold. The unstructured data redaction system may prompt the user for input via a user input control element configured on the graphical user interface indicating whether such potential categorizations and/or matches are accurate. The unstructured data redaction system may use such information to further refine the various disclosed embodiments.

In various embodiments, the unstructured data redaction system may automatically use information from those matches having a confidence level above a certain threshold in processing the request. Also, or instead, the unstructured data redaction system may automatically exclude information from those pairings having a confidence level below a certain threshold from use in processing the request.

In various embodiments, the unstructured data redaction system may generate notifications when particular outlier or unusual events occur in analyzing a request. For example, if the unstructured data redaction system determines that the redacted portion of unstructured data in a request exceeds a certain threshold percentage of the total amount of unstructured data or the total amount of request content, the unstructured data redaction system may not process that request at all. In such cases, the unstructured data redaction system may flag the request and/or transmit the request to a user for manual review before processing. In such cases the unstructured data redaction system may also, or instead, inform the data subject (or the user submitting the request on behalf of the data subject) that the request was not processed. For example, a request with 99% of its content redacted may indicate a problematic request, as opposed to a request having only 20% of its content redacted.

Technical Contributions of Various Embodiments

An entity that handles (e.g., collects, receives, transmits, stores, processes, shares, and/or the like) sensitive and/or personal information associated with particular individuals (e.g., personally identifiable information (PII) data, sensitive data, personal data, etc.) may receive data requests from users for information relating to personal data associated with a data subject and/or requests to modify and/or delete such personal data, for example, as a data subject access request (DSAR). Because an entity may have many systems of many different types that handle personal data in various ways, processing a data request may require significant resources to locate, retrieve, and/or modify personal data based on a data request. Processing a data request becomes even more challenging when it includes extraneous data that is unrelated to the request. Such extraneous data reduces the entity's ability to efficiently process data requests by utilizing resources for processing data unnecessarily. Moreover, requests with such extraneous data may be processed improperly due to the potential confusion of relevant data in the request with irrelevant data unrelated to the request. For example, a request may include two or three unrelated telephone numbers along with a telephone number of the data subject associated with the request. This is especially an issue with data requests that include unstructured data (e.g., data for which data types and/or associations are not indicated, such as email body text, text message content, etc.), which is increasingly common as users gravitate towards simpler methods of submitting data requests. In conventional systems, such extraneous data is either processed, resulting in inefficient an unnecessary usage of system resources, or manually redacted in a time-consuming and human resource-intensive operation.

Accordingly, various embodiments of the present disclosure overcome many of the technical challenges associated with processing data requests that include unstructured data. More particularly, various embodiments of the present disclosure include implementing a limited set of rules in a process for automatically redacting irrelevant data from unstructured data included in a data request before processing the request. The various embodiments of the disclosure are directed to a computational framework configured for categorizing unstructured data in a data request, comparing the unstructured data to known personal data based on the data type, and redacting that unstructured data that does not match personal data of the same data type. Specifically, the unstructured data redaction system discovers personal data as described herein to locate (e.g., all) available personal data across various data sources and identify a data type for each such piece of data. The unstructured data redaction system generates an identity graph representing the personal data, with each node of the identity graph indicating a particular data source, the types of personal data stored at that data source, the method of accessing that data source, and the data type identifier that may be used at that data source. In response to receiving or detecting a request for data that includes unstructured data, the unstructured data redaction system analyzes the unstructured data to determine categorizations for each piece of such data. The unstructured data redaction system retrieves known personal data using the identity graph and compares the categorized pieces of unstructured data to the pieces of known personal data having the same categorization to determine whether the pieces match. Those pieces of unstructured data that match personal data are permitted to remain in the request while the pieces that do not match personal data are redacted from the request. The request including only unredacted unstructured data can then be processes much more efficiently than a request that would have included all the unstructured data. By automatically redacting irrelevant unstructured data from a data request, the various embodiments represent a significant improvement to existing and conventional processes for addressing data requests that include extraneous data.

Accordingly, various embodiments of the disclosure provided herein are more effective, efficient, accurate, and faster in determining the appropriate information to retain in a data request when the original request includes unstructured data. The various embodiments of the disclosure provided herein provide improved means of redacting irrelevant unstructured data from a data request by locating a personal data across multiple data sources using a generated identity graph, categorizing unstructured data in a data request, and redacting irrelevant unstructured data from the data request based on a comparison of the categorized unstructured data to the personal data. This is especially advantageous when an entity receives many data requests in a variety of forms from many users and data subjects. In facilitating the efficient redaction of irrelevant unstructured data from data requests, the various embodiments of the present disclosure make major technical contributions to improving the computational efficiency and reliability of various privacy management systems and procedures for data request processing. This in turn translates to more computationally efficient software systems.

Example Technical Platforms

As will be appreciated by one skilled in the relevant field, data processing systems and methods for automatically redacting unstructured data from a data subject access request, according to various embodiments described herein, may be, for example, embodied as a computer system, a method, or a computer program product. Accordingly, various embodiments may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, particular embodiments may take the form of a computer program product stored on a computer-readable storage medium having computer-readable instructions (e.g., software) embodied in the storage medium. Various embodiments may take the form of web, mobile, and/or wearable computer-implemented computer software. Any suitable computer-readable storage medium may be utilized including, for example, hard disks, compact disks, DVDs, optical storage devices, and/or magnetic storage devices.

It should be understood that each step described herein as being executed by an unstructured data redaction system or systems (and/or other steps described herein), and any combinations of such steps, may be implemented by a computer executing computer program instructions. These computer program instructions may be loaded onto a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions which execute on the computer or other programmable data processing apparatus to create means for implementing the various steps described herein.

These computer program instructions may also be stored in a computer-readable memory that may direct a computer or other programmable data processing apparatus to function in a particular manner such that the instructions stored in the computer-readable memory produce an article of manufacture that is configured for implementing the function specified in the flowchart step or steps. The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions that execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart step or steps.

Accordingly, steps of the block diagrams and flowchart illustrations support combinations of mechanisms for performing the specified functions, combinations of steps for performing the specified functions, and program instructions for performing the specified functions. It should also be understood that each step, and combinations of such steps, may be implemented by special-purpose hardware-based computer systems that perform the specified functions or steps, or combinations of special purpose hardware and other hardware executing appropriate computer instructions.

Example System Architecture

FIG. 6 is a block diagram of a system 600 according to a particular embodiment. As may be understood from this figure, the system 600 may include one or more computer networks 610, a server 620, a storage device 630 (that may, in various embodiments, contain one or more databases of information that may include personal data), and/or one or more client computing devices such as a tablet computer 640, a desktop or laptop computer 650, a handheld computing device 660 (e.g., a cellular phone, a smart phone, etc.), a browser and Internet capable set-top box 670 connected with a television (e.g., a television 680), and/or a smart television 680 having browser and Internet capability. The client computing devices attached to the network may also, or instead, include scanners/copiers/printers/fax machines 690 having one or more hard drives (a security risk since copies/prints may be stored on these hard drives). The server 620, client computing devices, and storage device 630 may be physically located in a central location, such as the headquarters of an organization, for example, or in separate facilities. The devices may be owned or maintained by employees, contractors, or other third parties (e.g., a cloud service provider, a copier vendor). In particular embodiments, the computer networks 610 facilitate communication between the server 620, one or more client computing devices 640, 650, 660, 670, 680, 690, and storage device 630.

The computer networks 610 may include any of a variety of types of wired and/or wireless computer networks and any combination therefore, such as the Internet, a private intranet, a public switched telephone network (PSTN), or any other type of network. The communication link between the server 620, one or more client computing devices 640, 650, 660, 670, 680, 690, and storage device 630 may be, for example, implemented via a Local Area Network (LAN), a Wide Area Network (WAN), and/or via the Internet.

Example Computer Architecture

FIG. 7 illustrates a diagrammatic representation of the architecture of a computer 700 that may be used within the system 600, for example, as a client computer (e.g., one of computing devices 640, 650, 660, 670, 680, 690, shown in FIG. 6) and/or as a server computer (e.g., server 620 shown in FIG. 6). In exemplary embodiments, the computer 700 may be suitable for use as a computer within the context of the system 600 that is configured to operationalize the various aspects of the exemplary unstructured data redaction systems describe herein. In particular embodiments, the computer 700 may be connected (e.g., networked) to other computers in a LAN, an intranet, an extranet, and/or the Internet. As noted above, the computer 700 may operate in the capacity of a server or a client computer in a client-server network environment or as a peer computer in a peer-to-peer (or distributed) network environment. The computer 700 may be a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a cellular telephone, smart phone, a web appliance, a server, a network router, a switch or bridge, or any other computer capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that computer. Further, while only a single computer is illustrated, the term “computer” as used herein shall also be taken to include any collection of computers that individually or jointly execute a set (or multiple sets) of instructions to perform any of the methodologies discussed herein.

The exemplary computer 700 may include a processor 702, a main memory 704 (e.g., read-only memory (ROM), flash memory, dynamic random access memory (DRAM) such as synchronous DRAM (SDRAM) or Rambus DRAM (RDRAM), etc.), a static memory 706 (e.g., flash memory, static random access memory (SRAM), etc.), and/or a data storage device 718, which communicate with each other via a bus 732.

The processor 702 represents one or more general-purpose processing devices such as a microprocessor, a central processing unit, or the like. More particularly, the processor 702 may be a complex instruction set computing (CISC) microprocessor, a reduced instruction set computing (RISC) microprocessor, a very long instruction word (VLIW) microprocessor, or a processor or processors implementing other instruction sets and/or any combination of instruction sets. The processor 702 may also be one or more special-purpose processing devices such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), network processor, or the like. The processor 702 may be configured to execute processing logic 726 for performing various operations and steps discussed herein.

The computer 700 may further include a network interface device 708. The computer 700 also may include a video display unit 710 (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)), an alphanumeric input device 712 (e.g., a keyboard), a cursor control device 714 (e.g., a mouse), and/or a signal generation device 716 (e.g., a speaker). The data storage device 718 may include a non-transitory computer-readable storage medium 730 (also known as a non-transitory computer-readable storage medium or a non-transitory computer-readable medium) on which may be stored one or more sets of instructions 722 (e.g., software, software modules) embodying any one or more of the methodologies and/or functions described herein. The instructions 722 may also reside, completely or at least partially, within the main memory 704 and/or within the processor 702 during execution thereof by computer 700, the main memory 704 and the processor 702 also constituting computer-accessible storage media. The instructions 722 may further be transmitted or received over a network 610 via network interface device 708.

While the computer-readable storage medium 730 is shown in an exemplary embodiment to be a single medium, the terms “computer-readable storage medium” and “machine-accessible storage medium” should be understood to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the sets of instructions. The term “computer-readable storage medium” should also be understood to include any medium or media that is capable of storing, encoding, and/or carrying a set of instructions for execution by a computer and that cause a computer to perform any one or more of the methodologies of described herein. The term “computer-readable storage medium” should accordingly be understood to include, but not be limited to, solid-state memories, optical and magnetic media, etc.

Exemplary System Platform

According to various embodiments, the processes and logic flows described in this specification may be performed by a system (e.g., system 600) that includes, but is not limited to, one or more programmable processors (e.g., processor 702) executing one or more computer program modules to perform functions by operating on input data and generating output, thereby tying the process to a particular machine (e.g., a machine programmed to perform the processes described herein). This includes processors located in one or more of client computers (e.g., client computing devices 640, 650, 660, 670, 680, 690 of FIG. 6). These devices connected to the computer networks 610 may access and execute one or more Internet browser-based program modules that are “served up” through the computer networks 610 by one or more servers (e.g., server 620 of FIG. 6), and the data associated with the program may be stored on a one or more storage devices, which may reside within a server or computing device (e.g., main memory 704, static memory 706), be attached as a peripheral storage device to the servers or computing devices, and/or attached to the network (e.g., storage 630).

Advanced Processing in Various Embodiments

In various embodiments, the unstructured data redaction system uses advanced processing techniques to locate personal data, generate identity graphs, perform unstructured data redaction, and/or implement any of the various aspects of the disclosed unstructured data redaction systems and methods. In particular embodiments, the unstructured data redaction system may determine a type of one or more pieces of personal data that are stored in one or more data sources using advanced processing techniques that may include artificial intelligence, artificial intelligence, machine learning, neural networking, big data methods, natural language processing, contextual awareness, and/or continual learning (in any combination). In particular embodiments, the unstructured data redaction system may match one or more pieces of personal data that are stored in one or more data sources with one or more other pieces of personal data that are stored in one or more other data sources using any one or more of these advanced processing techniques and/or any combination thereof. In various embodiments, the unstructured data redaction system may use any such advanced processing techniques to mine various data sources for personal data stored therein to determine data types and relationships. In various embodiments, the unstructured data redaction system may use any such advanced processing techniques to perform any of the processing (e.g., execute any of the modules) described herein to locate, identify, retrieve, modify, and/or perform any other functions related to personal data, including generating identity graphs and performing unstructured data redaction.

In particular embodiments, one or more neural networks may be used to implement any of the advanced processing techniques described herein. A neural network, according to various embodiments, may include a plurality of nodes that mimic the operation of the human brain, a training mechanism that analyzes supplied information, and/or a personal data location engine for performing any one or more of the functions involving personal data as described herein, including, but not limited to, generating identity graphs and performing unstructured data redaction. The neural network may also perform any of the processing (e.g., execute any of the modules) described herein to locate, identify, retrieve, modify, and/or perform any other functions on personal data. In various embodiments, each of the nodes may include one or more weighted input connections, one or more transfer functions that combine the inputs, and one or more output connections. In particular embodiments, the neural network is a variational autoencoder (AE) neural network, a denoising AE neural network, any other suitable neural network, or any combination thereof.

CONCLUSION

Although embodiments above are described in reference to various automatic unstructured data redaction and personal data discovery systems, it should be understood that various aspects of the unstructured data redaction system described above may be applicable to other types of systems, in general.

While this specification contains many specific embodiment details, these should not be construed as limitations on the scope of any embodiment or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment may also be implemented in multiple embodiments separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination may in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or variation of a sub-combination.

Similarly, while operations are described in a particular order, this should not be understood as requiring that such operations be performed in the particular order described or in sequential order, or that all described operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems may generally be integrated together in a single software product or packaged into multiple software products.

Many modifications and other embodiments will come to mind to one skilled in the art to which this disclosure pertains having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. Therefore, it is to be understood that the invention is not to be limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be included within the scope of the appended claims. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for the purposes of limitation.

Claims

1. A method comprising: receiving, by computing hardware, a request for personal data associated with a data subject, the request comprising structured data and unstructured data;retrieving, by the computing hardware, an identity graph comprising a first node representing a first data source used for handling the personal data and a second node representing a second data source used for handling the personal data, wherein: the first node comprises a mapping of a first data type identifier corresponding to a first personal data categorization to a first piece of the personal data handled by the first data source, wherein the first personal data categorization identifies a first type of personal data,the second node comprises a mapping of a second data type identifier corresponding to a second personal data categorization to a second piece of the personal data handled by the second data source, wherein the second personal data categorization identifies a second type of personal data, andthe identity graph indicates that a third piece of the personal data handled by the first data source can be used as a value for the second data type identifier;determining, by the computing hardware and based on the first personal data categorization, that the structured data corresponds to the first data type identifier;in response to determining that the structured data corresponds to the first data type identifier: retrieving, by the computing hardware, the first piece of the personal data and the third piece of the personal data by scanning the first data source using the structured data; andretrieving, by the computing hardware and based on the identity graph indicating that the third piece of the personal data can be used as the value for the second data type identifier, the second piece of the personal data by scanning the second data source using the third piece of the personal data;analyzing, by the computing hardware, the unstructured data to determine a first categorization for a first piece of the unstructured data;mapping, by the computing hardware and based on the second data type identifier, the first categorization to the second personal data categorization;determining, by the computing hardware and based on mapping the first categorization to the second personal data categorization, that the first piece of the unstructured data does not match the second piece of the personal data;in response to determining that the first piece of the unstructured data does not match the second piece of the personal data, generating, by the computing hardware, redacted unstructured data by excluding the first piece of the unstructured data from the unstructured data; andprocessing, by the computing hardware, the request using the redacted unstructured data.
2. The method of claim 1, wherein the identity graph further comprises an access method, and retrieving the first piece of the personal data and the third piece of the personal data comprises retrieving the first piece of the personal data and the third piece of the personal data from the first data source using the access method.
3. The method of claim 1, wherein analyzing the unstructured data comprises: determining a first confidence score for the first categorization; anddetermining the first categorization for the first piece of the unstructured data based on the first confidence score.
4. The method of claim 1, wherein processing the request comprises: determining that the redacted unstructured data represents a portion of the unstructured data greater than a threshold; andin response to determining that the redacted unstructured data represents the portion of the unstructured data greater than the threshold, suspending processing of the request and transmitting a notification that the redacted unstructured data represents the portion of the unstructured data greater than the threshold to a user.
5. A system comprising: a non-transitory computer-readable medium storing instructions; andprocessing hardware communicatively coupled to the non-transitory computer-readable medium, wherein the processing hardware is configured to execute the instructions and thereby perform operations comprising: receiving a request for personal data associated with a data subject, the request comprising structured data and unstructured data;retrieving an identity graph comprising a first node representing a first data source used for handling the personal data and a second node representing a second data source used for handling the personal data, wherein: the first node comprises a mapping of a first data type identifier corresponding to a first personal data categorization to a first piece of the personal data handled by the first data source, wherein the first personal data categorization identifies a first type of personal data,the second node comprises a mapping of a second data type identifier corresponding to a second personal data categorization to a second piece of the personal data handled by the second data source, wherein the second personal data categorization identifies a second type of personal data, andthe identity graph indicates that a third piece of the personal data handled by the first data source can be used as a value for the second data type identifier;determining, based on the first personal data categorization, that the structured data corresponds to the first data type identifier;retrieving the first piece of the personal data and the third piece of the personal data from the first data source using the structured data;retrieving, based on the identity graph indicating that the third piece of the personal data can be used as the value for the second data type identifier, the second piece of the personal data from the second data source by using the third piece of the personal data;determining a first categorization for a first piece of the unstructured data;mapping, based on the second data type identifier, the first categorization to the second personal data categorization;determining, based on mapping the first categorization to the second personal data categorization, that the first piece of the unstructured data does not correspond to the second piece of the personal data;responsive to determining the first piece of the unstructured data does not correspond to the second piece of the personal data, generating redacted unstructured data by excluding the first piece of the unstructured data; andtransmitting the redacted unstructured data for use in processing the request.
6. The system of claim 5, wherein determining that the first piece of the unstructured data does not correspond to the second piece of the personal data comprises: determining a confidence score based on mapping the first categorization to the second personal data categorization;determining that the confidence score does not satisfy a threshold value; andin response to determining that the confidence score does not satisfy the threshold value, determining that the first piece of the unstructured data does not correspond to the second piece of the personal data.
7. The system of claim 5, wherein the operations further comprise: determining a second categorization for a second piece of the unstructured data;mapping, based on the second data type identifier, the second categorization to the second personal data categorization;determining, based on mapping the second categorization to the second personal data categorization, that the second piece of the unstructured data corresponds to the second piece of the personal data; andresponsive to determining the second piece of the unstructured data corresponds to the second piece of the personal data, including the second piece of the unstructured data in the redacted unstructured data.
8. The system of claim 5, wherein the identity graph further comprises an access method, and retrieving the first piece of the personal data and the third piece of the personal data comprises retrieving the first piece of the personal data and the third piece of the personal data from the first data source using the access method.
9. A non-transitory computer-readable medium storing computer-executable instructions that, when executed by processing hardware, configure the processing hardware to perform operations comprising: receiving an electronic communication comprising a request for personal data associated with a data subject, the request comprising a data subject identifier and message data;retrieving an identity graph comprising a first node representing a first data source used for handling the personal data and a second node representing a second data source used for handling the personal data, wherein: the first node comprises a mapping of a first data type identifier corresponding to a first personal data categorization to a first piece of the personal data handled by the first data source, wherein the first personal data categorization identifies a first type of personal data,the second node comprises a mapping of a second data type identifier corresponding to a second personal data categorization to a second piece of the personal data handled by the second data source, wherein the second personal data categorization identifies a second type of personal data, andthe identity graph indicates that a third piece of the personal data handled by the first data source can be used as a value for the second data type identifier;determining, based on the first personal data categorization, that the data subject identifier corresponds to the first data type identifier;retrieving the third piece of the personal data by scanning the first data source using the data subject identifier;retrieving, based on the identity graph indicating that the third piece of the personal data can be used as the value for the second data type identifier, the second piece of the personal data by scanning the second data source using the third piece of the personal data;analyzing the message data to determine a first categorization for a first piece of the message data;mapping, based on the second data type identifier, the first categorization to the second personal data categorization;determining, based on mapping the first categorization to the second personal data categorization, that the first piece of the message data does not match the second piece of the personal data;in response to determining that the first piece of the message data does not match the second piece of the personal data, generating redacted message data by excluding the first piece of the message data from the redacted message data; andprocessing the request using the redacted message data.
10. The non-transitory computer-readable medium of claim 9, wherein the operations further comprise determining the second data source based on the first data type identifier.
11. The non-transitory computer-readable medium of claim 9, wherein processing the request comprises: determining that the request was processed;based on determining that the request was processed, generating a graphical user interface for a browser application executed on a user device by configuring a first display element configured to display an indication that the request was successfully processed on the graphical user interface and excluding a second display element configured to display an indication that the request was not successfully processed from the graphical user interface; andtransmitting an instruction to the browser application causing the browser application to present the graphical user interface on the user device.
12. The non-transitory computer-readable medium of claim 11, wherein generating the graphical user interface comprises configuring a third display element configured to display the personal data on the graphical user interface.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Patent Application No. 63/061,894, filed Aug. 6, 2020, the contents of which are hereby incorporated herein in its entirety.

US Referenced Citations (1500)

Number	Name	Date	Kind
4536866	Jerome et al.	Aug 1985	A
4574350	Starr	Mar 1986	A
5193162	Bordsen et al.	Mar 1993	A
5276735	Boebert et al.	Jan 1994	A
5329447	Leedom, Jr.	Jul 1994	A
5404299	Tsurubayashi et al.	Apr 1995	A
5535393	Reeve et al.	Jul 1996	A
5560005	Hoover et al.	Sep 1996	A
5668986	Nilsen et al.	Sep 1997	A
5710917	Musa et al.	Jan 1998	A
5761529	Raji	Jun 1998	A
5764906	Edelstein et al.	Jun 1998	A
5872973	Mitchell et al.	Feb 1999	A
5913041	Ramanathan et al.	Jun 1999	A
5913214	Madnick et al.	Jun 1999	A
6016394	Walker	Jan 2000	A
6122627	Carey et al.	Sep 2000	A
6148297	Swor et al.	Nov 2000	A
6148342	Ho	Nov 2000	A
6240416	Immon et al.	May 2001	B1
6243816	Fang et al.	Jun 2001	B1
6253203	Oflaherty et al.	Jun 2001	B1
6263335	Paik et al.	Jul 2001	B1
6272631	Thomlinson et al.	Aug 2001	B1
6275824	Oflaherty et al.	Aug 2001	B1
6282548	Burner et al.	Aug 2001	B1
6330562	Boden et al.	Dec 2001	B1
6363488	Ginter et al.	Mar 2002	B1
6374237	Reese	Apr 2002	B1
6374252	Althoff et al.	Apr 2002	B1
6408336	Schneider et al.	Jun 2002	B1
6427230	Goiffon et al.	Jul 2002	B1
6442688	Moses et al.	Aug 2002	B1
6446120	Dantressangle	Sep 2002	B1
6463488	San Juan	Oct 2002	B1
6484149	Jammes et al.	Nov 2002	B1
6484180	Lyons et al.	Nov 2002	B1
6516314	Birkler et al.	Feb 2003	B1
6516337	Tripp et al.	Feb 2003	B1
6519571	Guheen et al.	Feb 2003	B1
6574631	Subramanian et al.	Jun 2003	B1
6591272	Williams	Jul 2003	B1
6601233	Underwood	Jul 2003	B1
6606744	Mikurak	Aug 2003	B1
6611812	Hurtado et al.	Aug 2003	B2
6625602	Meredith et al.	Sep 2003	B1
6629081	Cornelius et al.	Sep 2003	B1
6633878	Underwood	Oct 2003	B1
6662192	Rebane	Dec 2003	B1
6662357	Bowman-Amuah	Dec 2003	B1
6697824	Bowman-Amuah	Feb 2004	B1
6699042	Smith et al.	Mar 2004	B2
6701314	Conover et al.	Mar 2004	B1
6721713	Guheen et al.	Apr 2004	B1
6725200	Rost	Apr 2004	B1
6732109	Lindberg et al.	May 2004	B2
6754665	Futagami et al.	Jun 2004	B1
6755344	Mollett et al.	Jun 2004	B1
6757685	Raffaele et al.	Jun 2004	B2
6757888	Knutson et al.	Jun 2004	B1
6816944	Peng	Nov 2004	B2
6826693	Yoshida et al.	Nov 2004	B1
6850252	Hoffberg	Feb 2005	B1
6886101	Glazer et al.	Apr 2005	B2
6901346	Tracy et al.	May 2005	B2
6904417	Clayton et al.	Jun 2005	B2
6909897	Kikuchi	Jun 2005	B2
6925443	Baggett, Jr. et al.	Aug 2005	B1
6938041	Brandow et al.	Aug 2005	B1
6956845	Baker et al.	Oct 2005	B2
6978270	Carty et al.	Dec 2005	B1
6980927	Tracy et al.	Dec 2005	B2
6980987	Kaminer	Dec 2005	B2
6983221	Tracy et al.	Jan 2006	B2
6985887	Sunstein et al.	Jan 2006	B1
6990454	McIntosh	Jan 2006	B2
6993448	Tracy et al.	Jan 2006	B2
6993495	Smith, Jr. et al.	Jan 2006	B2
6996807	Vardi et al.	Feb 2006	B1
7003560	Mullen et al.	Feb 2006	B1
7003662	Genty et al.	Feb 2006	B2
7013290	Ananian	Mar 2006	B2
7017105	Flanagin et al.	Mar 2006	B2
7023979	Wu et al.	Apr 2006	B1
7039594	Gersting	May 2006	B1
7039654	Eder	May 2006	B1
7047517	Brown et al.	May 2006	B1
7051036	Rosnow et al.	May 2006	B2
7051038	Yeh et al.	May 2006	B1
7058970	Shaw	Jun 2006	B2
7069427	Adler et al.	Jun 2006	B2
7076558	Dunn	Jul 2006	B1
7093200	Schreiber et al.	Aug 2006	B2
7095854	Ginter et al.	Aug 2006	B1
7100195	Underwood	Aug 2006	B1
7120800	Ginter et al.	Oct 2006	B2
7124101	Mikurak	Oct 2006	B1
7124107	Pishevar et al.	Oct 2006	B1
7127705	Christfort et al.	Oct 2006	B2
7127741	Bandini et al.	Oct 2006	B2
7133845	Ginter et al.	Nov 2006	B1
7139999	Bowman-Amuah	Nov 2006	B2
7143091	Charnock et al.	Nov 2006	B2
7149698	Guheen et al.	Dec 2006	B2
7165041	Guheen et al.	Jan 2007	B1
7167842	Josephson, II et al.	Jan 2007	B1
7167844	Leong et al.	Jan 2007	B1
7171379	Menninger et al.	Jan 2007	B2
7181438	Szabo	Feb 2007	B1
7203929	Vinodkrishnan et al.	Apr 2007	B1
7213233	Vinodkrishnan et al.	May 2007	B1
7216340	Vinodkrishnan et al.	May 2007	B1
7219066	Parks et al.	May 2007	B2
7223234	Stupp et al.	May 2007	B2
7225460	Barzilai et al.	May 2007	B2
7234065	Breslin et al.	Jun 2007	B2
7247625	Zhang et al.	Jul 2007	B2
7251624	Lee et al.	Jul 2007	B1
7260830	Sugimoto	Aug 2007	B2
7266566	Kennaley et al.	Sep 2007	B1
7272818	Ishimitsu et al.	Sep 2007	B2
7275063	Horn	Sep 2007	B2
7281020	Fine	Oct 2007	B2
7284232	Bates et al.	Oct 2007	B1
7284271	Lucovsky et al.	Oct 2007	B2
7287280	Young	Oct 2007	B2
7290275	Baudoin et al.	Oct 2007	B2
7293119	Beale	Nov 2007	B2
7299299	Hollenbeck et al.	Nov 2007	B2
7302569	Betz et al.	Nov 2007	B2
7313575	Carr et al.	Dec 2007	B2
7313699	Koga	Dec 2007	B2
7313825	Redlich et al.	Dec 2007	B2
7315826	Guheen et al.	Jan 2008	B1
7315849	Bakalash et al.	Jan 2008	B2
7322047	Redlich et al.	Jan 2008	B2
7330850	Seibel et al.	Feb 2008	B1
7340447	Ghatare	Mar 2008	B2
7340776	Zobel et al.	Mar 2008	B2
7343434	Kapoor et al.	Mar 2008	B2
7346518	Frank et al.	Mar 2008	B1
7353204	Liu	Apr 2008	B2
7356559	Jacobs et al.	Apr 2008	B1
7367014	Griffin	Apr 2008	B2
7370025	Pandit	May 2008	B1
7376835	Olkin et al.	May 2008	B2
7380120	Garcia	May 2008	B1
7382903	Ray	Jun 2008	B2
7383570	Pinkas et al.	Jun 2008	B2
7391854	Salonen et al.	Jun 2008	B2
7398393	Mont et al.	Jul 2008	B2
7401235	Mowers et al.	Jul 2008	B2
7403942	Bayliss	Jul 2008	B1
7409354	Putnam et al.	Aug 2008	B2
7412402	Cooper	Aug 2008	B2
7424680	Carpenter	Sep 2008	B2
7428546	Nori et al.	Sep 2008	B2
7430585	Sibert	Sep 2008	B2
7454457	Lowery et al.	Nov 2008	B1
7454508	Mathew et al.	Nov 2008	B2
7478157	Bohrer et al.	Jan 2009	B2
7480755	Herrell et al.	Jan 2009	B2
7487170	Stevens	Feb 2009	B2
7493282	Manly et al.	Feb 2009	B2
7512987	Williams	Mar 2009	B2
7516882	Cucinotta	Apr 2009	B2
7523053	Pudhukottai et al.	Apr 2009	B2
7529836	Bolen	May 2009	B1
7548968	Bura et al.	Jun 2009	B1
7552480	Voss	Jun 2009	B1
7562339	Racca et al.	Jul 2009	B2
7565685	Ross et al.	Jul 2009	B2
7567541	Karimi et al.	Jul 2009	B2
7584505	Mondri et al.	Sep 2009	B2
7584508	Kashchenko et al.	Sep 2009	B1
7587749	Leser et al.	Sep 2009	B2
7590705	Mathew et al.	Sep 2009	B2
7590972	Axelrod et al.	Sep 2009	B2
7603356	Schran et al.	Oct 2009	B2
7606783	Carter	Oct 2009	B1
7606790	Levy	Oct 2009	B2
7607120	Sanyal et al.	Oct 2009	B2
7613700	Lobo et al.	Nov 2009	B1
7617136	Lessing et al.	Nov 2009	B1
7617167	Griffis et al.	Nov 2009	B2
7620644	Cote et al.	Nov 2009	B2
7627666	Degiulio et al.	Dec 2009	B1
7630874	Fables et al.	Dec 2009	B2
7630998	Zhou et al.	Dec 2009	B2
7636742	Olavarrieta et al.	Dec 2009	B1
7640322	Wendkos et al.	Dec 2009	B2
7650497	Thornton et al.	Jan 2010	B2
7653592	Flaxman et al.	Jan 2010	B1
7657476	Barney	Feb 2010	B2
7657694	Mansell et al.	Feb 2010	B2
7665073	Meijer et al.	Feb 2010	B2
7665125	Heard et al.	Feb 2010	B2
7668947	Hutchinson et al.	Feb 2010	B2
7673282	Amaru et al.	Mar 2010	B2
7676034	Wu et al.	Mar 2010	B1
7681034	Lee et al.	Mar 2010	B1
7681140	Ebert	Mar 2010	B2
7685561	Deem et al.	Mar 2010	B2
7685577	Pace et al.	Mar 2010	B2
7693593	Ishibashi et al.	Apr 2010	B2
7698398	Lai	Apr 2010	B1
7702639	Stanley et al.	Apr 2010	B2
7707224	Chastagnol et al.	Apr 2010	B2
7712029	Ferreira et al.	May 2010	B2
7716242	Pae et al.	May 2010	B2
7725474	Tamai et al.	May 2010	B2
7725875	Waldrep	May 2010	B2
7729940	Harvey et al.	Jun 2010	B2
7730142	Levasseur et al.	Jun 2010	B2
7752124	Green et al.	Jul 2010	B2
7756826	Bots et al.	Jul 2010	B2
7756987	Wang et al.	Jul 2010	B2
7761586	Olenick et al.	Jul 2010	B2
7774745	Fildebrandt et al.	Aug 2010	B2
7788212	Beckmann et al.	Aug 2010	B2
7788222	Shah et al.	Aug 2010	B2
7788632	Kuester et al.	Aug 2010	B2
7788726	Teixeira	Aug 2010	B2
7801758	Gracie et al.	Sep 2010	B2
7801826	Labrou et al.	Sep 2010	B2
7801912	Ransil et al.	Sep 2010	B2
7802305	Leeds	Sep 2010	B1
7805349	Yu et al.	Sep 2010	B2
7805451	Hosokawa	Sep 2010	B2
7813947	Deangelis et al.	Oct 2010	B2
7822620	Dixon et al.	Oct 2010	B2
7827523	Ahmed et al.	Nov 2010	B2
7844640	Bender et al.	Nov 2010	B2
7849143	Vuong	Dec 2010	B2
7853468	Callahan et al.	Dec 2010	B2
7853470	Sonnleithner et al.	Dec 2010	B2
7853925	Kemmler	Dec 2010	B2
7860816	Fokoue-Nkoutche et al.	Dec 2010	B2
7870540	Zare et al.	Jan 2011	B2
7870608	Shraim et al.	Jan 2011	B2
7873541	Klar et al.	Jan 2011	B1
7877327	Gwiazda et al.	Jan 2011	B2
7877812	Koved et al.	Jan 2011	B2
7885841	King	Feb 2011	B2
7890461	Oeda et al.	Feb 2011	B2
7895260	Archer et al.	Feb 2011	B2
7904478	Yu et al.	Mar 2011	B2
7904487	Ghatare	Mar 2011	B2
7917888	Chong et al.	Mar 2011	B2
7917963	Goyal et al.	Mar 2011	B2
7921152	Ashley et al.	Apr 2011	B2
7930197	Ozzie et al.	Apr 2011	B2
7930753	Mellinger et al.	Apr 2011	B2
7953725	Burris et al.	May 2011	B2
7954150	Croft et al.	May 2011	B2
7958087	Blumenau	Jun 2011	B2
7958494	Chaar et al.	Jun 2011	B2
7962900	Barraclough et al.	Jun 2011	B2
7966310	Sullivan et al.	Jun 2011	B2
7966599	Malasky et al.	Jun 2011	B1
7966663	Strickland et al.	Jun 2011	B2
7974992	Fastabend et al.	Jul 2011	B2
7975000	Dixon et al.	Jul 2011	B2
7991559	Dzekunov et al.	Aug 2011	B2
7991747	Upadhyay et al.	Aug 2011	B1
7996372	Rubel, Jr.	Aug 2011	B2
8005891	Knowles et al.	Aug 2011	B2
8010612	Costea et al.	Aug 2011	B2
8010720	Iwaoka et al.	Aug 2011	B2
8019881	Sandhu et al.	Sep 2011	B2
8020206	Hubbard et al.	Sep 2011	B2
8024384	Prabhakar et al.	Sep 2011	B2
8032721	Murai	Oct 2011	B2
8036374	Noble, Jr.	Oct 2011	B2
8037409	Jacob et al.	Oct 2011	B2
8041749	Beck	Oct 2011	B2
8041913	Wang	Oct 2011	B2
8069161	Bugir et al.	Nov 2011	B2
8069471	Boren	Nov 2011	B2
8082539	Schelkogonov	Dec 2011	B1
8090754	Schmidt et al.	Jan 2012	B2
8095923	Harvey et al.	Jan 2012	B2
8099709	Baikov et al.	Jan 2012	B2
8103962	Embley et al.	Jan 2012	B2
8117441	Kurien et al.	Feb 2012	B2
8135815	Mayer	Mar 2012	B2
8146054	Baker et al.	Mar 2012	B2
8146074	Ito et al.	Mar 2012	B2
8150717	Whitmore	Apr 2012	B2
8156105	Altounian et al.	Apr 2012	B2
8156158	Rolls et al.	Apr 2012	B2
8156159	Ebrahimi et al.	Apr 2012	B2
8166406	Goldfeder et al.	Apr 2012	B1
8176061	Swanbeck et al.	May 2012	B2
8176177	Sussman et al.	May 2012	B2
8176334	Vainstein	May 2012	B2
8176470	Klumpp et al.	May 2012	B2
8180759	Hamzy	May 2012	B2
8181151	Sedukhin et al.	May 2012	B2
8185409	Putnam et al.	May 2012	B2
8196176	Berteau et al.	Jun 2012	B2
8205093	Argott	Jun 2012	B2
8205140	Hafeez et al.	Jun 2012	B2
8214362	Djabarov	Jul 2012	B1
8214803	Horii et al.	Jul 2012	B2
8234377	Cohn	Jul 2012	B2
8239244	Ginsberg et al.	Aug 2012	B2
8250051	Bugir et al.	Aug 2012	B2
8255468	Vitaldevara et al.	Aug 2012	B2
8260262	Ben Ayed	Sep 2012	B2
8261362	Goodwin et al.	Sep 2012	B2
8266231	Golovin et al.	Sep 2012	B1
8275632	Awaraji et al.	Sep 2012	B2
8275793	Ahmad et al.	Sep 2012	B2
8286239	Sutton	Oct 2012	B1
8312549	Goldberg et al.	Nov 2012	B2
8316237	Felsher et al.	Nov 2012	B1
8332908	Hatakeyama et al.	Dec 2012	B2
8340999	Kumaran et al.	Dec 2012	B2
8341405	Meijer et al.	Dec 2012	B2
8346929	Lai	Jan 2013	B1
8364713	Pollard	Jan 2013	B2
8370224	Grewal	Feb 2013	B2
8370794	Moosmann et al.	Feb 2013	B2
8380630	Felsher	Feb 2013	B2
8380743	Convertino et al.	Feb 2013	B2
8381180	Rostoker	Feb 2013	B2
8381297	Touboul	Feb 2013	B2
8386314	Kirkby et al.	Feb 2013	B2
8392982	Harris et al.	Mar 2013	B2
8418226	Gardner	Apr 2013	B2
8423954	Ronen et al.	Apr 2013	B2
8429179	Mirhaji	Apr 2013	B1
8429597	Prigge	Apr 2013	B2
8429630	Nickolov et al.	Apr 2013	B2
8429758	Chen et al.	Apr 2013	B2
8438644	Watters et al.	May 2013	B2
8463247	Misiag	Jun 2013	B2
8464311	Ashley et al.	Jun 2013	B2
8468244	Redlich et al.	Jun 2013	B2
8473324	Alvarez et al.	Jun 2013	B2
8474012	Ahmed et al.	Jun 2013	B2
8494894	Jaster et al.	Jul 2013	B2
8504481	Motahari et al.	Aug 2013	B2
8510199	Erlanger	Aug 2013	B1
8515988	Jones et al.	Aug 2013	B2
8516076	Thomas	Aug 2013	B2
8527337	Lim et al.	Sep 2013	B1
8533746	Nolan et al.	Sep 2013	B2
8533844	Mahaffey et al.	Sep 2013	B2
8538817	Wilson	Sep 2013	B2
8539359	Rapaport et al.	Sep 2013	B2
8539437	Finlayson et al.	Sep 2013	B2
8560645	Linden et al.	Oct 2013	B2
8560841	Chin et al.	Oct 2013	B2
8560956	Curtis et al.	Oct 2013	B2
8561100	Hu et al.	Oct 2013	B2
8561153	Grason et al.	Oct 2013	B2
8565729	Moseler et al.	Oct 2013	B2
8566726	Dixon et al.	Oct 2013	B2
8566938	Prakash et al.	Oct 2013	B1
8571909	Miller et al.	Oct 2013	B2
8572717	Narayanaswamy	Oct 2013	B2
8578036	Holfelder et al.	Nov 2013	B1
8578166	De Monseignat et al.	Nov 2013	B2
8578481	Rowley	Nov 2013	B2
8578501	Ogilvie	Nov 2013	B1
8583694	Siegel et al.	Nov 2013	B2
8583766	Dixon et al.	Nov 2013	B2
8589183	Awaraji et al.	Nov 2013	B2
8601467	Hofhansl et al.	Dec 2013	B2
8601591	Krishnamurthy et al.	Dec 2013	B2
8606746	Yeap et al.	Dec 2013	B2
8612420	Sun et al.	Dec 2013	B2
8612993	Grant et al.	Dec 2013	B2
8615549	Knowles et al.	Dec 2013	B2
8615731	Doshi	Dec 2013	B2
8620952	Bennett et al.	Dec 2013	B2
8621637	Al-Harbi et al.	Dec 2013	B2
8626671	Federgreen	Jan 2014	B2
8627114	Resch et al.	Jan 2014	B2
8630961	Beilby et al.	Jan 2014	B2
8631048	Davis et al.	Jan 2014	B1
8640110	Kopp et al.	Jan 2014	B2
8646072	Savant	Feb 2014	B1
8650399	Le Bihan et al.	Feb 2014	B2
8656265	Paulin et al.	Feb 2014	B1
8656456	Maxson et al.	Feb 2014	B2
8661036	Turski et al.	Feb 2014	B2
8667074	Farkas	Mar 2014	B1
8667487	Boodman et al.	Mar 2014	B1
8677472	Dotan et al.	Mar 2014	B1
8681984	Lee et al.	Mar 2014	B2
8682698	Cashman et al.	Mar 2014	B2
8683502	Shkedi et al.	Mar 2014	B2
8688601	Jaiswal	Apr 2014	B2
8689292	Williams et al.	Apr 2014	B2
8693689	Belenkiy et al.	Apr 2014	B2
8700524	Williams et al.	Apr 2014	B2
8700699	Shen et al.	Apr 2014	B2
8706742	Ravid et al.	Apr 2014	B1
8707451	Ture et al.	Apr 2014	B2
8712813	King	Apr 2014	B2
8713098	Adya et al.	Apr 2014	B1
8713638	Hu et al.	Apr 2014	B2
8719366	Mathew et al.	May 2014	B2
8732839	Hohl	May 2014	B2
8744894	Christiansen et al.	Jun 2014	B2
8751285	Deb et al.	Jun 2014	B2
8762413	Graham, Jr. et al.	Jun 2014	B2
8763071	Sinha et al.	Jun 2014	B2
8763082	Huber et al.	Jun 2014	B2
8763131	Archer et al.	Jun 2014	B2
8767947	Ristock et al.	Jul 2014	B1
8769242	Tkac et al.	Jul 2014	B2
8769412	Gill et al.	Jul 2014	B2
8769671	Shraim et al.	Jul 2014	B2
8776241	Zaitsev	Jul 2014	B2
8788935	Hirsch et al.	Jul 2014	B1
8793614	Wilson et al.	Jul 2014	B2
8793650	Hilerio et al.	Jul 2014	B2
8793781	Grossi et al.	Jul 2014	B2
8793809	Falkenburg et al.	Jul 2014	B2
8799984	Ahn	Aug 2014	B2
8805707	Schumann, Jr. et al.	Aug 2014	B2
8805806	Amarendran et al.	Aug 2014	B2
8805925	Price et al.	Aug 2014	B2
8812342	Barcelo et al.	Aug 2014	B2
8812752	Shih et al.	Aug 2014	B1
8812766	Kranendonk et al.	Aug 2014	B2
8813028	Farooqi	Aug 2014	B2
8819253	Simeloff et al.	Aug 2014	B2
8819617	Koenig et al.	Aug 2014	B1
8819800	Gao et al.	Aug 2014	B2
8826446	Liu et al.	Sep 2014	B1
8832649	Bishop et al.	Sep 2014	B2
8832854	Staddon et al.	Sep 2014	B1
8839232	Taylor et al.	Sep 2014	B2
8843487	McGraw et al.	Sep 2014	B2
8843745	Roberts, Jr.	Sep 2014	B2
8849757	Kruglick	Sep 2014	B2
8856534	Khosravi et al.	Oct 2014	B2
8856936	Datta Ray et al.	Oct 2014	B2
8862507	Sandhu et al.	Oct 2014	B2
8863261	Yang	Oct 2014	B2
8875232	Blom et al.	Oct 2014	B2
8893078	Schaude et al.	Nov 2014	B2
8893286	Oliver	Nov 2014	B1
8893297	Eversoll et al.	Nov 2014	B2
8904494	Kindler et al.	Dec 2014	B2
8914263	Shimada et al.	Dec 2014	B2
8914299	Pesci-Anderson et al.	Dec 2014	B2
8914342	Kalaboukis et al.	Dec 2014	B2
8914902	Moritz et al.	Dec 2014	B2
8918306	Cashman et al.	Dec 2014	B2
8918392	Brooker et al.	Dec 2014	B1
8918632	Sartor	Dec 2014	B1
8930896	Wiggins	Jan 2015	B1
8930897	Nassar	Jan 2015	B2
8935198	Phillips et al.	Jan 2015	B1
8935266	Wu	Jan 2015	B2
8935342	Patel	Jan 2015	B2
8935804	Clark et al.	Jan 2015	B1
8938221	Brazier et al.	Jan 2015	B2
8943076	Stewart et al.	Jan 2015	B2
8943548	Drokov et al.	Jan 2015	B2
8949137	Crapo et al.	Feb 2015	B2
8955038	Nicodemus et al.	Feb 2015	B2
8959568	Hudis et al.	Feb 2015	B2
8959584	Piliouras	Feb 2015	B2
8966575	McQuay et al.	Feb 2015	B2
8966597	Saylor et al.	Feb 2015	B1
8973108	Roth et al.	Mar 2015	B1
8977234	Chava	Mar 2015	B2
8977643	Schindlauer et al.	Mar 2015	B2
8978158	Rajkumar et al.	Mar 2015	B2
8983972	Kriebel et al.	Mar 2015	B2
8984031	Todd	Mar 2015	B1
8990933	Magdalin	Mar 2015	B1
8996417	Channakeshava	Mar 2015	B1
8996480	Agarwala et al.	Mar 2015	B2
8997213	Papakipos et al.	Mar 2015	B2
9001673	Birdsall et al.	Apr 2015	B2
9003295	Baschy	Apr 2015	B2
9003552	Goodwin et al.	Apr 2015	B2
9009851	Droste et al.	Apr 2015	B2
9014661	Decharms	Apr 2015	B2
9015796	Fujioka	Apr 2015	B1
9021469	Hilerio et al.	Apr 2015	B2
9026526	Bau et al.	May 2015	B1
9030987	Bianchetti et al.	May 2015	B2
9032067	Prasad et al.	May 2015	B2
9043217	Cashman et al.	May 2015	B2
9043480	Barton et al.	May 2015	B2
9047463	Porras	Jun 2015	B2
9047582	Hutchinson et al.	Jun 2015	B2
9047583	Patton et al.	Jun 2015	B2
9047639	Quintiliani et al.	Jun 2015	B1
9049244	Prince et al.	Jun 2015	B2
9049314	Pugh et al.	Jun 2015	B2
9055071	Gates et al.	Jun 2015	B1
9058590	Criddle et al.	Jun 2015	B2
9064033	Jin et al.	Jun 2015	B2
9069940	Hars	Jun 2015	B2
9076231	Hill et al.	Jul 2015	B1
9077736	Werth et al.	Jul 2015	B2
9081952	Sagi et al.	Jul 2015	B2
9087090	Cormier et al.	Jul 2015	B1
9092796	Eversoll et al.	Jul 2015	B2
9094434	Williams et al.	Jul 2015	B2
9098515	Richter et al.	Aug 2015	B2
9100778	Stogaitis et al.	Aug 2015	B2
9106691	Burger et al.	Aug 2015	B1
9106710	Feimster	Aug 2015	B1
9110918	Rajaa et al.	Aug 2015	B1
9111105	Barton et al.	Aug 2015	B2
9111295	Tietzen et al.	Aug 2015	B2
9123330	Sharifi et al.	Sep 2015	B1
9123339	Shaw et al.	Sep 2015	B1
9129311	Schoen et al.	Sep 2015	B2
9135261	Maunder et al.	Sep 2015	B2
9135444	Carter et al.	Sep 2015	B2
9141823	Dawson	Sep 2015	B2
9141911	Zhao et al.	Sep 2015	B2
9152818	Hathaway et al.	Oct 2015	B1
9152820	Pauley, Jr. et al.	Oct 2015	B1
9154514	Prakash	Oct 2015	B1
9154556	Dotan et al.	Oct 2015	B1
9158655	Wadhwani et al.	Oct 2015	B2
9165036	Mehra	Oct 2015	B2
9170996	Lovric et al.	Oct 2015	B2
9172706	Krishnamurthy et al.	Oct 2015	B2
9177293	Gagnon et al.	Nov 2015	B1
9178901	Xue et al.	Nov 2015	B2
9183100	Gventer et al.	Nov 2015	B2
9189642	Perlman	Nov 2015	B2
9201572	Lyon et al.	Dec 2015	B2
9201770	Duerk	Dec 2015	B1
9202026	Reeves	Dec 2015	B1
9202085	Mawdsley et al.	Dec 2015	B2
9215076	Roth et al.	Dec 2015	B1
9215252	Smith et al.	Dec 2015	B2
9218596	Ronca et al.	Dec 2015	B2
9224009	Liu et al.	Dec 2015	B1
9230036	Davis	Jan 2016	B2
9231935	Bridge et al.	Jan 2016	B1
9232040	Barash et al.	Jan 2016	B2
9235476	McHugh et al.	Jan 2016	B2
9240987	Barrett-Bowen et al.	Jan 2016	B2
9241259	Daniela et al.	Jan 2016	B2
9245126	Christodorescu et al.	Jan 2016	B2
9245266	Hardt	Jan 2016	B2
9253609	Hosier, Jr.	Feb 2016	B2
9264443	Weisman	Feb 2016	B2
9274858	Milliron et al.	Mar 2016	B2
9280581	Grimes et al.	Mar 2016	B1
9286149	Sampson et al.	Mar 2016	B2
9286282	Ling, III et al.	Mar 2016	B2
9288118	Pattan	Mar 2016	B1
9288556	Kim et al.	Mar 2016	B2
9294498	Yampolskiy et al.	Mar 2016	B1
9299050	Stiffler et al.	Mar 2016	B2
9306939	Chan et al.	Apr 2016	B2
9317697	Maier et al.	Apr 2016	B2
9317715	Schuette et al.	Apr 2016	B2
9325731	McGeehan	Apr 2016	B2
9336184	Mital et al.	May 2016	B2
9336220	Li et al.	May 2016	B2
9336324	Lomme et al.	May 2016	B2
9336332	Davis et al.	May 2016	B2
9336400	Milman et al.	May 2016	B2
9338188	Ahn	May 2016	B1
9342706	Chawla et al.	May 2016	B2
9344297	Shah et al.	May 2016	B2
9344424	Tenenboym et al.	May 2016	B2
9344484	Ferris	May 2016	B2
9348802	Massand	May 2016	B2
9348862	Kawecki, III	May 2016	B2
9348929	Eberlein	May 2016	B2
9349016	Brisebois et al.	May 2016	B1
9350718	Sondhi et al.	May 2016	B2
9355157	Mohammed et al.	May 2016	B2
9356961	Todd et al.	May 2016	B1
9361446	Demirjian et al.	Jun 2016	B1
9369488	Woods et al.	Jun 2016	B2
9374693	Olincy et al.	Jun 2016	B1
9384199	Thereska et al.	Jul 2016	B2
9384357	Patil et al.	Jul 2016	B2
9386104	Adams et al.	Jul 2016	B2
9395959	Hatfield et al.	Jul 2016	B2
9396332	Abrams et al.	Jul 2016	B2
9401900	Levasseur et al.	Jul 2016	B2
9411967	Parecki et al.	Aug 2016	B2
9411982	Dippenaar et al.	Aug 2016	B1
9417859	Gounares et al.	Aug 2016	B2
9424021	Zamir	Aug 2016	B2
9424414	Demirjian et al.	Aug 2016	B1
9426177	Wang et al.	Aug 2016	B2
9450940	Belov et al.	Sep 2016	B2
9460136	Todd et al.	Oct 2016	B1
9460171	Marrelli et al.	Oct 2016	B2
9460307	Breslau et al.	Oct 2016	B2
9461876	Van Dusen et al.	Oct 2016	B2
9462009	Kolman et al.	Oct 2016	B1
9465702	Gventer et al.	Oct 2016	B2
9465800	Lacey	Oct 2016	B2
9473446	Vijay et al.	Oct 2016	B2
9473505	Asano et al.	Oct 2016	B1
9473535	Sartor	Oct 2016	B2
9477523	Warman et al.	Oct 2016	B1
9477660	Scott et al.	Oct 2016	B2
9477685	Leung et al.	Oct 2016	B1
9477942	Adachi et al.	Oct 2016	B2
9483659	Bao et al.	Nov 2016	B2
9489366	Scott et al.	Nov 2016	B2
9495547	Schepis et al.	Nov 2016	B1
9501523	Hyatt et al.	Nov 2016	B2
9507960	Bell et al.	Nov 2016	B2
9509674	Nasserbakht et al.	Nov 2016	B1
9509702	Grigg et al.	Nov 2016	B2
9514231	Eden	Dec 2016	B2
9516012	Chochois et al.	Dec 2016	B2
9521166	Wilson	Dec 2016	B2
9524500	Dave et al.	Dec 2016	B2
9529989	Kling et al.	Dec 2016	B2
9536108	Powell et al.	Jan 2017	B2
9537546	Cordeiro et al.	Jan 2017	B2
9542568	Francis et al.	Jan 2017	B2
9549047	Fredinburg et al.	Jan 2017	B1
9552395	Bayer et al.	Jan 2017	B2
9552470	Turgeman et al.	Jan 2017	B2
9553918	Manion et al.	Jan 2017	B1
9558497	Carvalho	Jan 2017	B2
9569752	Deering et al.	Feb 2017	B2
9571509	Satish et al.	Feb 2017	B1
9571526	Sartor	Feb 2017	B2
9571559	Raleigh et al.	Feb 2017	B2
9571991	Brizendine et al.	Feb 2017	B1
9576289	Henderson et al.	Feb 2017	B2
9578060	Brisebois et al.	Feb 2017	B1
9578173	Sanghavi et al.	Feb 2017	B2
9582681	Mishra	Feb 2017	B2
9584964	Pelkey	Feb 2017	B2
9589110	Carey et al.	Mar 2017	B2
9600181	Patel et al.	Mar 2017	B2
9602529	Jones et al.	Mar 2017	B2
9606971	Seolas et al.	Mar 2017	B2
9607041	Himmelstein	Mar 2017	B2
9619652	Slater	Apr 2017	B2
9619661	Finkelstein	Apr 2017	B1
9621357	Williams et al.	Apr 2017	B2
9621566	Gupta et al.	Apr 2017	B2
9626124	Lipinski et al.	Apr 2017	B2
9626680	Ryan et al.	Apr 2017	B1
9629064	Graves et al.	Apr 2017	B2
9642008	Wyatt et al.	May 2017	B2
9646095	Gottlieb et al.	May 2017	B1
9647949	Varki et al.	May 2017	B2
9648036	Seiver et al.	May 2017	B2
9652314	Mahiddini	May 2017	B2
9654506	Barrett	May 2017	B2
9654541	Kapczynski et al.	May 2017	B1
9665722	Nagasundaram et al.	May 2017	B2
9665733	Sills et al.	May 2017	B1
9665883	Roullier et al.	May 2017	B2
9672053	Tang et al.	Jun 2017	B2
9672355	Titonis et al.	Jun 2017	B2
9678794	Barrett et al.	Jun 2017	B1
9691090	Barday	Jun 2017	B1
9699209	Ng et al.	Jul 2017	B2
9703549	Dufresne	Jul 2017	B2
9704103	Suskind et al.	Jul 2017	B2
9705840	Pujare et al.	Jul 2017	B2
9705880	Siris	Jul 2017	B2
9721078	Cornick et al.	Aug 2017	B2
9721108	Krishnamurthy et al.	Aug 2017	B2
9727751	Oliver et al.	Aug 2017	B2
9729583	Barday	Aug 2017	B1
9734255	Jiang	Aug 2017	B2
9736004	Jung et al.	Aug 2017	B2
9740985	Byron et al.	Aug 2017	B2
9740987	Dolan	Aug 2017	B2
9749408	Subramani et al.	Aug 2017	B2
9754091	Kode et al.	Sep 2017	B2
9756059	Demirjian et al.	Sep 2017	B2
9760620	Nachnani et al.	Sep 2017	B2
9760635	Bliss et al.	Sep 2017	B2
9760697	Walker	Sep 2017	B1
9760849	Vinnakota et al.	Sep 2017	B2
9762553	Ford et al.	Sep 2017	B2
9767202	Darby et al.	Sep 2017	B2
9767309	Patel et al.	Sep 2017	B1
9769124	Yan	Sep 2017	B2
9773269	Lazarus	Sep 2017	B1
9785795	Grondin et al.	Oct 2017	B2
9787671	Bogrett	Oct 2017	B1
9798749	Saner	Oct 2017	B2
9798826	Wilson et al.	Oct 2017	B2
9798896	Jakobsson	Oct 2017	B2
9800605	Baikalov et al.	Oct 2017	B2
9800606	Yumer	Oct 2017	B1
9804649	Cohen et al.	Oct 2017	B2
9804928	Davis et al.	Oct 2017	B2
9805381	Frank et al.	Oct 2017	B2
9811532	Parkison et al.	Nov 2017	B2
9817850	Dubbels et al.	Nov 2017	B2
9817978	Marsh et al.	Nov 2017	B2
9819684	Cernoch et al.	Nov 2017	B2
9825928	Lelcuk et al.	Nov 2017	B2
9830563	Paknad	Nov 2017	B2
9832633	Gerber, Jr. et al.	Nov 2017	B2
9836598	Iyer et al.	Dec 2017	B2
9838407	Oprea et al.	Dec 2017	B1
9838839	Vudali et al.	Dec 2017	B2
9841969	Seibert, Jr. et al.	Dec 2017	B2
9842042	Chhatwal et al.	Dec 2017	B2
9842349	Sawczuk et al.	Dec 2017	B2
9848005	Ardeli et al.	Dec 2017	B2
9848061	Jain et al.	Dec 2017	B1
9852150	Sharpe et al.	Dec 2017	B2
9853959	Kapczynski et al.	Dec 2017	B1
9860226	Thormaehlen	Jan 2018	B2
9864735	Lamprecht	Jan 2018	B1
9876825	Amar et al.	Jan 2018	B2
9877138	Franklin	Jan 2018	B1
9880157	Levak et al.	Jan 2018	B2
9882935	Barday	Jan 2018	B2
9887965	Kay et al.	Feb 2018	B2
9888377	McCorkendale et al.	Feb 2018	B1
9892441	Barday	Feb 2018	B2
9892442	Barday	Feb 2018	B2
9892443	Barday	Feb 2018	B2
9892444	Barday	Feb 2018	B2
9894076	Li et al.	Feb 2018	B2
9898613	Swerdlow et al.	Feb 2018	B1
9898739	Monastyrsky et al.	Feb 2018	B2
9898769	Barday	Feb 2018	B2
9912625	Mutha et al.	Mar 2018	B2
9912677	Chien	Mar 2018	B2
9912810	Segre et al.	Mar 2018	B2
9916703	Levinson et al.	Mar 2018	B2
9922124	Rathod	Mar 2018	B2
9923927	McClintock et al.	Mar 2018	B1
9928379	Hoffer	Mar 2018	B1
9934493	Castinado et al.	Apr 2018	B2
9934544	Whitfield et al.	Apr 2018	B1
9936127	Todasco	Apr 2018	B2
9942214	Burciu et al.	Apr 2018	B1
9942244	Lahoz et al.	Apr 2018	B2
9942276	Sartor	Apr 2018	B2
9946897	Lovin	Apr 2018	B2
9948652	Yu et al.	Apr 2018	B2
9948663	Wang et al.	Apr 2018	B1
9953189	Cook et al.	Apr 2018	B2
9954879	Sadaghiani et al.	Apr 2018	B1
9954883	Ahuja et al.	Apr 2018	B2
9959551	Schermerhorn et al.	May 2018	B1
9959582	Sukman et al.	May 2018	B2
9961070	Tang	May 2018	B2
9973518	Lee et al.	May 2018	B2
9973585	Ruback et al.	May 2018	B2
9977904	Khan et al.	May 2018	B2
9977920	Danielson et al.	May 2018	B2
9983936	Dornemann et al.	May 2018	B2
9984252	Pollard	May 2018	B2
9990499	Chan et al.	Jun 2018	B2
9992213	Sinnema	Jun 2018	B2
10001975	Bharthulwar	Jun 2018	B2
10002064	Muske	Jun 2018	B2
10007895	Vanasco	Jun 2018	B2
10013577	Beaumont et al.	Jul 2018	B1
10015164	Hamburg et al.	Jul 2018	B2
10019339	Von Hanxleden et al.	Jul 2018	B2
10019588	Garcia et al.	Jul 2018	B2
10019591	Beguin	Jul 2018	B1
10019741	Hesselink	Jul 2018	B2
10021143	Cabrera et al.	Jul 2018	B2
10025804	Vranyes et al.	Jul 2018	B2
10028226	Ayyagari et al.	Jul 2018	B2
10032172	Barday	Jul 2018	B2
10044761	Ducatel et al.	Aug 2018	B2
10055426	Arasan et al.	Aug 2018	B2
10055869	Borrelli et al.	Aug 2018	B2
10061847	Mohammed et al.	Aug 2018	B2
10069858	Robinson et al.	Sep 2018	B2
10069914	Smith	Sep 2018	B1
10073924	Karp et al.	Sep 2018	B2
10075437	Costigan et al.	Sep 2018	B1
10075451	Hall et al.	Sep 2018	B1
10084817	Saher et al.	Sep 2018	B2
10091214	Godlewski et al.	Oct 2018	B2
10091312	Khanwalkar et al.	Oct 2018	B1
10102533	Barday	Oct 2018	B2
10108409	Pirzadeh et al.	Oct 2018	B2
10122663	Hu et al.	Nov 2018	B2
10122760	Terrill et al.	Nov 2018	B2
10127403	Kong et al.	Nov 2018	B2
10129211	Heath	Nov 2018	B2
10140666	Wang et al.	Nov 2018	B1
10142113	Zaidi et al.	Nov 2018	B2
10152560	Potiagalov et al.	Dec 2018	B2
10158676	Barday	Dec 2018	B2
10165011	Barday	Dec 2018	B2
10169762	Ogawa	Jan 2019	B2
10176503	Barday et al.	Jan 2019	B2
10181043	Pauley, Jr. et al.	Jan 2019	B1
10181051	Barday et al.	Jan 2019	B2
10187363	Smirnoff et al.	Jan 2019	B2
10187394	Bar et al.	Jan 2019	B2
10204154	Barday et al.	Feb 2019	B2
10205994	Splaine et al.	Feb 2019	B2
10212134	Rai	Feb 2019	B2
10212175	Seul et al.	Feb 2019	B2
10223533	Dawson	Mar 2019	B2
10230571	Rangasamy et al.	Mar 2019	B2
10250594	Chathoth et al.	Apr 2019	B2
10255602	Wang	Apr 2019	B2
10257127	Dotan-Cohen et al.	Apr 2019	B2
10257181	Sherif et al.	Apr 2019	B1
10268838	Yadgiri et al.	Apr 2019	B2
10275221	Thattai et al.	Apr 2019	B2
10275614	Barday et al.	Apr 2019	B2
10282370	Barday et al.	May 2019	B1
10282559	Barday et al.	May 2019	B2
10284604	Barday et al.	May 2019	B2
10289584	Chiba	May 2019	B2
10289857	Brinskelle	May 2019	B1
10289866	Barday et al.	May 2019	B2
10289867	Barday et al.	May 2019	B2
10289870	Barday et al.	May 2019	B2
10296504	Hock et al.	May 2019	B2
10304442	Rudden et al.	May 2019	B1
10310723	Rathod	Jun 2019	B2
10311042	Kumar	Jun 2019	B1
10311475	Yuasa	Jun 2019	B2
10311492	Gelfenbeyn et al.	Jun 2019	B2
10318761	Barday et al.	Jun 2019	B2
10320940	Brennan et al.	Jun 2019	B1
10324960	Skvortsov et al.	Jun 2019	B1
10326768	Verweyst et al.	Jun 2019	B2
10326798	Lambert	Jun 2019	B2
10326841	Bradley et al.	Jun 2019	B2
10331689	Sorrentino et al.	Jun 2019	B2
10331904	Sher-Jan et al.	Jun 2019	B2
10333975	Soman et al.	Jun 2019	B2
10346186	Kalyanpur	Jul 2019	B2
10346635	Kumar et al.	Jul 2019	B2
10346637	Barday et al.	Jul 2019	B2
10346638	Barday et al.	Jul 2019	B2
10346849	Ionescu et al.	Jul 2019	B2
10348726	Caluwaert	Jul 2019	B2
10348775	Barday	Jul 2019	B2
10353673	Barday et al.	Jul 2019	B2
10361857	Woo	Jul 2019	B2
10366241	Sartor	Jul 2019	B2
10373119	Driscoll et al.	Aug 2019	B2
10373409	White et al.	Aug 2019	B2
10375115	Mallya	Aug 2019	B2
10387559	Wendt et al.	Aug 2019	B1
10387657	Belfiore, Jr. et al.	Aug 2019	B2
10387952	Sandhu et al.	Aug 2019	B1
10395201	Vescio	Aug 2019	B2
10402545	Gorfein et al.	Sep 2019	B2
10404729	Turgeman	Sep 2019	B2
10417401	Votaw et al.	Sep 2019	B2
10417621	Cassel et al.	Sep 2019	B2
10419476	Parekh	Sep 2019	B2
10423985	Dutta et al.	Sep 2019	B1
10425492	Comstock et al.	Sep 2019	B2
10430608	Peri et al.	Oct 2019	B2
10435350	Ito et al.	Oct 2019	B2
10437412	Barday et al.	Oct 2019	B2
10437860	Barday et al.	Oct 2019	B2
10438016	Barday et al.	Oct 2019	B2
10438273	Burns et al.	Oct 2019	B2
10440062	Barday et al.	Oct 2019	B2
10445508	Sher-Jan et al.	Oct 2019	B2
10445526	Barday et al.	Oct 2019	B2
10452864	Barday et al.	Oct 2019	B2
10452866	Barday et al.	Oct 2019	B2
10453076	Parekh et al.	Oct 2019	B2
10453092	Wang et al.	Oct 2019	B1
10454934	Parimi et al.	Oct 2019	B2
10481763	Bartkiewicz et al.	Nov 2019	B2
10489454	Chen	Nov 2019	B1
10503926	Barday et al.	Dec 2019	B2
10510031	Barday et al.	Dec 2019	B2
10521623	Rodriguez et al.	Dec 2019	B2
10534851	Chan et al.	Jan 2020	B1
10535081	Ferreira et al.	Jan 2020	B2
10536475	McCorkle, Jr. et al.	Jan 2020	B1
10536478	Kirti et al.	Jan 2020	B2
10541938	Timmerman et al.	Jan 2020	B1
10546135	Kassoumeh et al.	Jan 2020	B1
10552462	Hart	Feb 2020	B1
10558809	Joyce et al.	Feb 2020	B1
10558821	Barday et al.	Feb 2020	B2
10564815	Soon-Shiong	Feb 2020	B2
10564935	Barday et al.	Feb 2020	B2
10564936	Barday et al.	Feb 2020	B2
10565161	Barday et al.	Feb 2020	B2
10565236	Barday et al.	Feb 2020	B1
10567439	Barday	Feb 2020	B2
10567517	Weinig et al.	Feb 2020	B2
10572684	Lafever et al.	Feb 2020	B2
10572686	Barday et al.	Feb 2020	B2
10574705	Barday et al.	Feb 2020	B2
10581825	Poschel et al.	Mar 2020	B2
10592648	Barday et al.	Mar 2020	B2
10592692	Brannon et al.	Mar 2020	B2
10606916	Brannon et al.	Mar 2020	B2
10613971	Vasikarla	Apr 2020	B1
10628553	Murrish et al.	Apr 2020	B1
10645102	Hamdi	May 2020	B2
10645548	Reynolds et al.	May 2020	B2
10649630	Vora et al.	May 2020	B1
10650408	Andersen et al.	May 2020	B1
10657469	Bade et al.	May 2020	B2
10657504	Zimmerman et al.	May 2020	B1
10659566	Luah et al.	May 2020	B1
10671749	Felice-Steele et al.	Jun 2020	B2
10671760	Esmailzadeh et al.	Jun 2020	B2
10678945	Barday et al.	Jun 2020	B2
10685140	Barday et al.	Jun 2020	B2
10706176	Brannon et al.	Jul 2020	B2
10706226	Byun et al.	Jul 2020	B2
10708305	Barday et al.	Jul 2020	B2
10713387	Brannon et al.	Jul 2020	B2
10726145	Duminy et al.	Jul 2020	B2
10726153	Nerurkar et al.	Jul 2020	B2
10726158	Brannon et al.	Jul 2020	B2
10732865	Jain et al.	Aug 2020	B2
10735388	Rose et al.	Aug 2020	B2
10740487	Barday et al.	Aug 2020	B2
10747893	Kiriyama et al.	Aug 2020	B2
10747897	Cook	Aug 2020	B2
10749870	Brouillette et al.	Aug 2020	B2
10762213	Rudek et al.	Sep 2020	B2
10762236	Brannon et al.	Sep 2020	B2
10769302	Barday et al.	Sep 2020	B2
10769303	Brannon et al.	Sep 2020	B2
10776510	Antonelli et al.	Sep 2020	B2
10776518	Barday et al.	Sep 2020	B2
10778792	Handy Bosma et al.	Sep 2020	B1
10783256	Brannon et al.	Sep 2020	B2
10785173	Willett et al.	Sep 2020	B2
10785299	Gupta et al.	Sep 2020	B2
10791150	Barday et al.	Sep 2020	B2
10795527	Legge et al.	Oct 2020	B1
10796020	Barday et al.	Oct 2020	B2
10796260	Brannon et al.	Oct 2020	B2
10798133	Barday et al.	Oct 2020	B2
10803196	Bodegas Martinez et al.	Oct 2020	B2
10805331	Boyer et al.	Oct 2020	B2
10831831	Greene	Nov 2020	B2
10834590	Turgeman et al.	Nov 2020	B2
10846433	Brannon et al.	Nov 2020	B2
10853501	Brannon	Dec 2020	B2
10860721	Gentile	Dec 2020	B1
10860742	Joseph et al.	Dec 2020	B2
10860979	Geffen et al.	Dec 2020	B2
10878127	Brannon et al.	Dec 2020	B2
10885485	Brannon et al.	Jan 2021	B2
10891393	Currier et al.	Jan 2021	B2
10893074	Sartor	Jan 2021	B2
10896394	Brannon et al.	Jan 2021	B2
10902490	He et al.	Jan 2021	B2
10909488	Hecht et al.	Feb 2021	B2
10924514	Altman et al.	Feb 2021	B1
10949555	Rattan et al.	Mar 2021	B2
10949565	Barday et al.	Mar 2021	B2
10957326	Bhaya et al.	Mar 2021	B2
10963571	Bar Joseph et al.	Mar 2021	B2
10963572	Belfiore, Jr. et al.	Mar 2021	B2
10965547	Esposito et al.	Mar 2021	B1
10970418	Durvasula et al.	Apr 2021	B2
10972509	Barday et al.	Apr 2021	B2
10976950	Trezzo et al.	Apr 2021	B1
10983963	Venkatasubramanian et al.	Apr 2021	B1
10984458	Gutierrez	Apr 2021	B1
10997318	Barday et al.	May 2021	B2
11003748	Oliker et al.	May 2021	B2
11012475	Patnala et al.	May 2021	B2
11023528	Lee et al.	Jun 2021	B1
11037168	Lee et al.	Jun 2021	B1
11057356	Malhotra et al.	Jul 2021	B2
11057427	Wright et al.	Jul 2021	B2
11062051	Barday et al.	Jul 2021	B2
11068318	Kuesel et al.	Jul 2021	B2
11068584	Burriesci et al.	Jul 2021	B2
11068618	Brannon et al.	Jul 2021	B2
11068797	Bhide et al.	Jul 2021	B2
11068847	Boutros et al.	Jul 2021	B2
11093950	Hersh et al.	Aug 2021	B2
11138299	Brannon et al.	Oct 2021	B2
11144622	Brannon et al.	Oct 2021	B2
11144678	Dondini et al.	Oct 2021	B2
11144862	Jackson et al.	Oct 2021	B1
11195134	Brannon et al.	Dec 2021	B2
11201929	Dudmesh et al.	Dec 2021	B2
11210420	Brannon et al.	Dec 2021	B2
11238390	Brannon et al.	Feb 2022	B2
11240273	Barday et al.	Feb 2022	B2
11252159	Kannan et al.	Feb 2022	B2
11256777	Brannon et al.	Feb 2022	B2
11263262	Chen	Mar 2022	B2
11327996	Reynolds et al.	May 2022	B2
20020004736	Roundtree et al.	Jan 2002	A1
20020049907	Woods et al.	Apr 2002	A1
20020055932	Wheeler et al.	May 2002	A1
20020077941	Halligan et al.	Jun 2002	A1
20020103854	Okita	Aug 2002	A1
20020129216	Collins	Sep 2002	A1
20020161594	Bryan et al.	Oct 2002	A1
20020161733	Grainger	Oct 2002	A1
20030041250	Proudler	Feb 2003	A1
20030065641	Chaloux	Apr 2003	A1
20030093680	Astley et al.	May 2003	A1
20030097451	Bjorksten et al.	May 2003	A1
20030097661	Li et al.	May 2003	A1
20030115142	Brickell et al.	Jun 2003	A1
20030130893	Farmer	Jul 2003	A1
20030131001	Matsuo	Jul 2003	A1
20030131093	Aschen et al.	Jul 2003	A1
20030140150	Kemp et al.	Jul 2003	A1
20030167216	Brown et al.	Sep 2003	A1
20030212604	Cullen	Nov 2003	A1
20040002818	Kulp et al.	Jan 2004	A1
20040025053	Hayward	Feb 2004	A1
20040088235	Ziekle et al.	May 2004	A1
20040098366	Sinclair et al.	May 2004	A1
20040098493	Rees	May 2004	A1
20040111359	Hudock	Jun 2004	A1
20040186912	Harlow et al.	Sep 2004	A1
20040193907	Patanella	Sep 2004	A1
20050022198	Olapurath et al.	Jan 2005	A1
20050033616	Vavul et al.	Feb 2005	A1
20050076294	Dehamer et al.	Apr 2005	A1
20050114343	Wesinger, Jr. et al.	May 2005	A1
20050144066	Cope et al.	Jun 2005	A1
20050197884	Mullen, Jr.	Sep 2005	A1
20050198177	Black	Sep 2005	A1
20050198646	Kortela	Sep 2005	A1
20050246292	Sarcanin	Nov 2005	A1
20050278538	Fowler	Dec 2005	A1
20060031078	Pizzinger et al.	Feb 2006	A1
20060035204	Lamarche et al.	Feb 2006	A1
20060075122	Lindskog et al.	Apr 2006	A1
20060149730	Curtis	Jul 2006	A1
20060156052	Bodnar et al.	Jul 2006	A1
20060190280	Hoebel et al.	Aug 2006	A1
20060206375	Scott et al.	Sep 2006	A1
20060224422	Cohen	Oct 2006	A1
20060253597	Mujica	Nov 2006	A1
20060259416	Johnson	Nov 2006	A1
20070011058	Dev	Jan 2007	A1
20070027715	Gropper et al.	Feb 2007	A1
20070061125	Bhatt et al.	Mar 2007	A1
20070061393	Moore	Mar 2007	A1
20070130101	Anderson et al.	Jun 2007	A1
20070130323	Landsman et al.	Jun 2007	A1
20070157311	Meier et al.	Jul 2007	A1
20070173355	Klein	Jul 2007	A1
20070179793	Bagchi et al.	Aug 2007	A1
20070180490	Renzi et al.	Aug 2007	A1
20070192438	Goei	Aug 2007	A1
20070266420	Hawkins et al.	Nov 2007	A1
20070283171	Breslin et al.	Dec 2007	A1
20080015927	Ramirez	Jan 2008	A1
20080028065	Caso et al.	Jan 2008	A1
20080028435	Strickland et al.	Jan 2008	A1
20080047016	Spoonamore	Feb 2008	A1
20080120699	Spear	May 2008	A1
20080140696	Mathuria	Jun 2008	A1
20080189306	Hewett et al.	Aug 2008	A1
20080195436	Whyte	Aug 2008	A1
20080222271	Spires	Sep 2008	A1
20080235177	Kim et al.	Sep 2008	A1
20080270203	Holmes et al.	Oct 2008	A1
20080270351	Thomsen	Oct 2008	A1
20080270381	Thomsen	Oct 2008	A1
20080270382	Thomsen et al.	Oct 2008	A1
20080270451	Thomsen et al.	Oct 2008	A1
20080270462	Thomsen	Oct 2008	A1
20080281649	Morris	Nov 2008	A1
20080282320	Denovo et al.	Nov 2008	A1
20080288271	Faust	Nov 2008	A1
20080288299	Schultz	Nov 2008	A1
20090012896	Arnold	Jan 2009	A1
20090022301	Mudaliar	Jan 2009	A1
20090037975	Ishikawa et al.	Feb 2009	A1
20090119500	Roth et al.	May 2009	A1
20090132419	Grammer et al.	May 2009	A1
20090138276	Hayashida et al.	May 2009	A1
20090140035	Miller	Jun 2009	A1
20090144702	Atkin et al.	Jun 2009	A1
20090158249	Tomkins et al.	Jun 2009	A1
20090172705	Cheong	Jul 2009	A1
20090182818	Krywaniuk	Jul 2009	A1
20090187764	Astakhov et al.	Jul 2009	A1
20090204452	Iskandar et al.	Aug 2009	A1
20090204820	Brandenburg et al.	Aug 2009	A1
20090210347	Sarcanin	Aug 2009	A1
20090216610	Chorny	Aug 2009	A1
20090249076	Reed et al.	Oct 2009	A1
20090303237	Liu et al.	Dec 2009	A1
20100010912	Jones	Jan 2010	A1
20100010968	Redlich	Jan 2010	A1
20100077484	Paretti et al.	Mar 2010	A1
20100082533	Nakamura et al.	Apr 2010	A1
20100094650	Tran et al.	Apr 2010	A1
20100100398	Auker et al.	Apr 2010	A1
20100121773	Currier et al.	May 2010	A1
20100192201	Shimoni et al.	Jul 2010	A1
20100205057	Hook et al.	Aug 2010	A1
20100223349	Thorson	Sep 2010	A1
20100228786	Török	Sep 2010	A1
20100234987	Benschop et al.	Sep 2010	A1
20100235297	Mamorsky	Sep 2010	A1
20100235915	Memon et al.	Sep 2010	A1
20100250497	Redlich	Sep 2010	A1
20100262624	Pullikottil	Oct 2010	A1
20100268628	Pitkow et al.	Oct 2010	A1
20100268932	Bhattacharjee	Oct 2010	A1
20100281313	White et al.	Nov 2010	A1
20100287114	Bartko et al.	Nov 2010	A1
20100333012	Adachi et al.	Dec 2010	A1
20110006996	Smith et al.	Jan 2011	A1
20110010202	Neale	Jan 2011	A1
20110082794	Blechman	Apr 2011	A1
20110137696	Meyer et al.	Jun 2011	A1
20110145154	Rivers et al.	Jun 2011	A1
20110153396	Marcuvitz et al.	Jun 2011	A1
20110191664	Sheleheda et al.	Aug 2011	A1
20110208850	Sheleheda et al.	Aug 2011	A1
20110209067	Bogess et al.	Aug 2011	A1
20110231896	Tovar	Sep 2011	A1
20110238573	Varadarajan	Sep 2011	A1
20110252456	Hatakeyama	Oct 2011	A1
20110302643	Pichna et al.	Dec 2011	A1
20120041939	Amsterdamski	Feb 2012	A1
20120084151	Kozak et al.	Apr 2012	A1
20120084349	Lee et al.	Apr 2012	A1
20120102411	Sathish	Apr 2012	A1
20120102543	Kohli et al.	Apr 2012	A1
20120110674	Belani et al.	May 2012	A1
20120116923	Irving et al.	May 2012	A1
20120131438	Li et al.	May 2012	A1
20120143650	Crowley et al.	Jun 2012	A1
20120144499	Tan et al.	Jun 2012	A1
20120191596	Kremen et al.	Jul 2012	A1
20120226621	Petran et al.	Sep 2012	A1
20120239557	Weinflash et al.	Sep 2012	A1
20120254320	Dove et al.	Oct 2012	A1
20120259752	Agee	Oct 2012	A1
20120323700	Aleksandrovich et al.	Dec 2012	A1
20120330769	Arceo	Dec 2012	A1
20120330869	Durham	Dec 2012	A1
20130004933	Bhaskaran	Jan 2013	A1
20130018954	Cheng	Jan 2013	A1
20130085801	Sharpe et al.	Apr 2013	A1
20130091156	Raiche et al.	Apr 2013	A1
20130103485	Postrel	Apr 2013	A1
20130111323	Taghaddos et al.	May 2013	A1
20130124257	Schubert	May 2013	A1
20130144901	Ho	Jun 2013	A1
20130159351	Hamann et al.	Jun 2013	A1
20130171968	Wang	Jul 2013	A1
20130179982	Bridges et al.	Jul 2013	A1
20130179988	Bekker et al.	Jul 2013	A1
20130185806	Hatakeyama	Jul 2013	A1
20130218829	Martinez	Aug 2013	A1
20130219459	Bradley	Aug 2013	A1
20130254649	Oneill	Sep 2013	A1
20130254699	Bashir et al.	Sep 2013	A1
20130262328	Federgreen	Oct 2013	A1
20130282466	Hampton	Oct 2013	A1
20130290169	Bathula et al.	Oct 2013	A1
20130298071	Wine	Nov 2013	A1
20130311224	Heroux et al.	Nov 2013	A1
20130318207	Dotter	Nov 2013	A1
20130326112	Park et al.	Dec 2013	A1
20130332362	Ciurea	Dec 2013	A1
20130340086	Blom	Dec 2013	A1
20140006355	Kirihata	Jan 2014	A1
20140006616	Aad et al.	Jan 2014	A1
20140012833	Humprecht	Jan 2014	A1
20140019561	Belity et al.	Jan 2014	A1
20140032259	Lafever et al.	Jan 2014	A1
20140032265	Paprocki	Jan 2014	A1
20140040134	Ciurea	Feb 2014	A1
20140040161	Berlin	Feb 2014	A1
20140040979	Barton et al.	Feb 2014	A1
20140041048	Goodwin et al.	Feb 2014	A1
20140047551	Nagasundaram et al.	Feb 2014	A1
20140052463	Cashman et al.	Feb 2014	A1
20140067973	Eden	Mar 2014	A1
20140074645	Ingram	Mar 2014	A1
20140089027	Brown	Mar 2014	A1
20140089039	McClellan	Mar 2014	A1
20140108173	Cooper et al.	Apr 2014	A1
20140108968	Vishria	Apr 2014	A1
20140137257	Martinez et al.	May 2014	A1
20140142988	Grosso et al.	May 2014	A1
20140143011	Mudugu et al.	May 2014	A1
20140164476	Thomson	Jun 2014	A1
20140188956	Subba et al.	Jul 2014	A1
20140196143	Fliderman et al.	Jul 2014	A1
20140208418	Libin	Jul 2014	A1
20140222468	Araya et al.	Aug 2014	A1
20140244309	Francois	Aug 2014	A1
20140244325	Cartwright	Aug 2014	A1
20140244375	Kim	Aug 2014	A1
20140244399	Orduna et al.	Aug 2014	A1
20140257917	Spencer et al.	Sep 2014	A1
20140258093	Gardiner et al.	Sep 2014	A1
20140278539	Edwards	Sep 2014	A1
20140278663	Samuel et al.	Sep 2014	A1
20140278730	Muhart et al.	Sep 2014	A1
20140283027	Orona et al.	Sep 2014	A1
20140283106	Stahura et al.	Sep 2014	A1
20140288971	Whibbs, III	Sep 2014	A1
20140289681	Wielgosz	Sep 2014	A1
20140289862	Gorfein et al.	Sep 2014	A1
20140317171	Fox et al.	Oct 2014	A1
20140324480	Dufel et al.	Oct 2014	A1
20140337041	Madden et al.	Nov 2014	A1
20140337466	Li et al.	Nov 2014	A1
20140344015	Puértolas-Montañés et al.	Nov 2014	A1
20150006514	Hung	Jan 2015	A1
20150012363	Grant et al.	Jan 2015	A1
20150019530	Felch	Jan 2015	A1
20150026056	Calman et al.	Jan 2015	A1
20150026260	Worthley	Jan 2015	A1
20150033112	Norwood et al.	Jan 2015	A1
20150066577	Christiansen et al.	Mar 2015	A1
20150066865	Yara et al.	Mar 2015	A1
20150088598	Acharyya et al.	Mar 2015	A1
20150106264	Johnson	Apr 2015	A1
20150106867	Liang	Apr 2015	A1
20150106948	Holman et al.	Apr 2015	A1
20150106949	Holman et al.	Apr 2015	A1
20150121462	Courage et al.	Apr 2015	A1
20150143258	Carolan et al.	May 2015	A1
20150149362	Baum et al.	May 2015	A1
20150154520	Federgreen et al.	Jun 2015	A1
20150169318	Nash	Jun 2015	A1
20150172296	Fujioka	Jun 2015	A1
20150178740	Borawski et al.	Jun 2015	A1
20150199534	Francis et al.	Jul 2015	A1
20150199541	Koch et al.	Jul 2015	A1
20150199702	Singh	Jul 2015	A1
20150229664	Hawthorn et al.	Aug 2015	A1
20150235049	Cohen et al.	Aug 2015	A1
20150235050	Wouhaybi et al.	Aug 2015	A1
20150235283	Nishikawa	Aug 2015	A1
20150242778	Wilcox et al.	Aug 2015	A1
20150242858	Smith et al.	Aug 2015	A1
20150248391	Watanabe	Sep 2015	A1
20150254597	Jahagirdar	Sep 2015	A1
20150261887	Joukov	Sep 2015	A1
20150262189	Vergeer	Sep 2015	A1
20150264417	Spitz et al.	Sep 2015	A1
20150269384	Holman et al.	Sep 2015	A1
20150271167	Kalai	Sep 2015	A1
20150309813	Patel	Oct 2015	A1
20150310227	Ishida et al.	Oct 2015	A1
20150310575	Shelton	Oct 2015	A1
20150348200	Fair et al.	Dec 2015	A1
20150356362	Demos	Dec 2015	A1
20150379430	Dirac et al.	Dec 2015	A1
20160006760	Lala et al.	Jan 2016	A1
20160012465	Sharp	Jan 2016	A1
20160026394	Goto	Jan 2016	A1
20160034918	Bjelajac et al.	Feb 2016	A1
20160048700	Stransky-Heilkron	Feb 2016	A1
20160050213	Storr	Feb 2016	A1
20160063523	Nistor et al.	Mar 2016	A1
20160063567	Srivastava	Mar 2016	A1
20160071112	Unser	Mar 2016	A1
20160080405	Schler et al.	Mar 2016	A1
20160099963	Mahaffey et al.	Apr 2016	A1
20160103963	Mishra	Apr 2016	A1
20160110352	Bendersky	Apr 2016	A1
20160125550	Joao et al.	May 2016	A1
20160125749	Delacroix et al.	May 2016	A1
20160125751	Barker et al.	May 2016	A1
20160140466	Sidebottom et al.	May 2016	A1
20160143570	Valacich et al.	May 2016	A1
20160148143	Anderson et al.	May 2016	A1
20160162269	Pogorelik et al.	Jun 2016	A1
20160164915	Cook	Jun 2016	A1
20160180386	Konig	Jun 2016	A1
20160188450	Appusamy et al.	Jun 2016	A1
20160189156	Kim et al.	Jun 2016	A1
20160196189	Miyagi et al.	Jul 2016	A1
20160225000	Glasgow	Aug 2016	A1
20160232465	Kurtz et al.	Aug 2016	A1
20160232534	Lacey et al.	Aug 2016	A1
20160234319	Griffin	Aug 2016	A1
20160253497	Christodorescu et al.	Sep 2016	A1
20160255139	Rathod	Sep 2016	A1
20160261631	Vissamsetty et al.	Sep 2016	A1
20160262163	Gonzalez Garrido et al.	Sep 2016	A1
20160292453	Patterson et al.	Oct 2016	A1
20160292621	Ciccone et al.	Oct 2016	A1
20160321582	Broudou et al.	Nov 2016	A1
20160321748	Mahatma et al.	Nov 2016	A1
20160330237	Edlabadkar	Nov 2016	A1
20160335531	Mullen et al.	Nov 2016	A1
20160342811	Whitcomb et al.	Nov 2016	A1
20160364736	Maugans, III	Dec 2016	A1
20160370954	Burningham et al.	Dec 2016	A1
20160378762	Rohter	Dec 2016	A1
20160381064	Chan et al.	Dec 2016	A1
20160381560	Margaliot	Dec 2016	A1
20170004055	Horan et al.	Jan 2017	A1
20170032395	Kaufman et al.	Feb 2017	A1
20170032408	Kumar et al.	Feb 2017	A1
20170034101	Kumar et al.	Feb 2017	A1
20170041324	Ionutescu et al.	Feb 2017	A1
20170046399	Sankaranarasimhan et al.	Feb 2017	A1
20170046753	Deupree, IV	Feb 2017	A1
20170061501	Horwich	Mar 2017	A1
20170068785	Experton et al.	Mar 2017	A1
20170070495	Cherry et al.	Mar 2017	A1
20170093917	Chandra et al.	Mar 2017	A1
20170115864	Thomas et al.	Apr 2017	A1
20170124570	Nidamanuri et al.	May 2017	A1
20170140174	Lacey et al.	May 2017	A1
20170140467	Neag et al.	May 2017	A1
20170142158	Laoutaris et al.	May 2017	A1
20170142177	Hu	May 2017	A1
20170154188	Meier et al.	Jun 2017	A1
20170161520	Lockhart, III et al.	Jun 2017	A1
20170171235	Mulchandani et al.	Jun 2017	A1
20170171325	Perez	Jun 2017	A1
20170177324	Frank et al.	Jun 2017	A1
20170180378	Tyler et al.	Jun 2017	A1
20170180505	Shaw et al.	Jun 2017	A1
20170193017	Migliori	Jul 2017	A1
20170193624	Tsai	Jul 2017	A1
20170201518	Holmqvist et al.	Jul 2017	A1
20170206707	Guay et al.	Jul 2017	A1
20170208084	Steelman et al.	Jul 2017	A1
20170220685	Yan et al.	Aug 2017	A1
20170220964	Datta Ray	Aug 2017	A1
20170249710	Guillama et al.	Aug 2017	A1
20170269791	Meyerzon et al.	Sep 2017	A1
20170270318	Ritchie	Sep 2017	A1
20170278004	McElhinney et al.	Sep 2017	A1
20170278117	Wallace et al.	Sep 2017	A1
20170286719	Krishnamurthy et al.	Oct 2017	A1
20170287031	Barday	Oct 2017	A1
20170289199	Barday	Oct 2017	A1
20170308875	O'Regan et al.	Oct 2017	A1
20170316400	Venkatakrishnan et al.	Nov 2017	A1
20170330197	DiMaggio et al.	Nov 2017	A1
20170353404	Hodge	Dec 2017	A1
20180032757	Michael	Feb 2018	A1
20180039975	Hefetz	Feb 2018	A1
20180041498	Kikuchi	Feb 2018	A1
20180046753	Shelton	Feb 2018	A1
20180046939	Meron et al.	Feb 2018	A1
20180063174	Grill et al.	Mar 2018	A1
20180063190	Wright et al.	Mar 2018	A1
20180082368	Weinflash et al.	Mar 2018	A1
20180083843	Sambandam	Mar 2018	A1
20180091476	Jakobsson et al.	Mar 2018	A1
20180131574	Jacobs et al.	May 2018	A1
20180131658	Bhagwan et al.	May 2018	A1
20180165637	Romero et al.	Jun 2018	A1
20180198614	Neumann	Jul 2018	A1
20180204281	Painter et al.	Jul 2018	A1
20180219917	Chiang	Aug 2018	A1
20180239500	Allen et al.	Aug 2018	A1
20180248914	Sartor	Aug 2018	A1
20180285887	Maung	Oct 2018	A1
20180301222	Dew, Sr. et al.	Oct 2018	A1
20180307859	Lafever et al.	Oct 2018	A1
20180336509	Guttmann	Nov 2018	A1
20180349583	Turgeman et al.	Dec 2018	A1
20180351888	Howard	Dec 2018	A1
20180352003	Winn et al.	Dec 2018	A1
20180357243	Yoon	Dec 2018	A1
20180365720	Goldman et al.	Dec 2018	A1
20180374030	Barday et al.	Dec 2018	A1
20180375814	Hart	Dec 2018	A1
20190005210	Wiederspohn et al.	Jan 2019	A1
20190012211	Selvaraj	Jan 2019	A1
20190012672	Francesco	Jan 2019	A1
20190019184	Lacey et al.	Jan 2019	A1
20190050547	Welsh et al.	Feb 2019	A1
20190087570	Sloane	Mar 2019	A1
20190096020	Barday et al.	Mar 2019	A1
20190108353	Sadeh et al.	Apr 2019	A1
20190130132	Barbas et al.	May 2019	A1
20190138496	Yamaguchi	May 2019	A1
20190139087	Dabbs et al.	May 2019	A1
20190148003	Van Hoe	May 2019	A1
20190156053	Vogel et al.	May 2019	A1
20190156058	Van Dyne et al.	May 2019	A1
20190171801	Barday et al.	Jun 2019	A1
20190179652	Hesener et al.	Jun 2019	A1
20190180051	Barday et al.	Jun 2019	A1
20190182294	Rieke et al.	Jun 2019	A1
20190188402	Wang et al.	Jun 2019	A1
20190266200	Francolla	Aug 2019	A1
20190266201	Barday et al.	Aug 2019	A1
20190266350	Barday et al.	Aug 2019	A1
20190268343	Barday et al.	Aug 2019	A1
20190268344	Barday et al.	Aug 2019	A1
20190272492	Elledge et al.	Sep 2019	A1
20190294818	Barday et al.	Sep 2019	A1
20190332802	Barday et al.	Oct 2019	A1
20190332807	Lafever et al.	Oct 2019	A1
20190333118	Crimmins et al.	Oct 2019	A1
20190354709	Brinskelle	Nov 2019	A1
20190356684	Sinha et al.	Nov 2019	A1
20190362169	Lin et al.	Nov 2019	A1
20190362268	Fogarty et al.	Nov 2019	A1
20190377901	Balzer et al.	Dec 2019	A1
20190378073	Lopez et al.	Dec 2019	A1
20190384934	Kim	Dec 2019	A1
20190392162	Stern et al.	Dec 2019	A1
20190392170	Barday et al.	Dec 2019	A1
20190392171	Barday et al.	Dec 2019	A1
20200020454	McGarvey et al.	Jan 2020	A1
20200050966	Enuka et al.	Feb 2020	A1
20200051117	Mitchell	Feb 2020	A1
20200057781	McCormick	Feb 2020	A1
20200074471	Adjaoute	Mar 2020	A1
20200081865	Farrar et al.	Mar 2020	A1
20200082270	Gu et al.	Mar 2020	A1
20200090197	Rodriguez et al.	Mar 2020	A1
20200092179	Chieu et al.	Mar 2020	A1
20200110589	Bequet et al.	Apr 2020	A1
20200110904	Shinde et al.	Apr 2020	A1
20200117737	Gopalakrishnan et al.	Apr 2020	A1
20200137097	Zimmermann et al.	Apr 2020	A1
20200143301	Bowers	May 2020	A1
20200143797	Manoharan et al.	May 2020	A1
20200159952	Dain	May 2020	A1
20200159955	Barlik et al.	May 2020	A1
20200167653	Manjunath et al.	May 2020	A1
20200175424	Kursun	Jun 2020	A1
20200183655	Barday et al.	Jun 2020	A1
20200186355	Davies	Jun 2020	A1
20200193018	Van Dyke	Jun 2020	A1
20200193022	Lunsford et al.	Jun 2020	A1
20200210558	Barday et al.	Jul 2020	A1
20200210620	Haletky	Jul 2020	A1
20200211002	Steinberg	Jul 2020	A1
20200220901	Barday et al.	Jul 2020	A1
20200226156	Borra et al.	Jul 2020	A1
20200226196	Brannon et al.	Jul 2020	A1
20200242259	Chirravuri et al.	Jul 2020	A1
20200242719	Lee	Jul 2020	A1
20200250342	Miller et al.	Aug 2020	A1
20200252413	Buzbee et al.	Aug 2020	A1
20200252817	Brouillette et al.	Aug 2020	A1
20200272764	Brannon et al.	Aug 2020	A1
20200293679	Handy Bosma et al.	Sep 2020	A1
20200296171	Mocanu et al.	Sep 2020	A1
20200302089	Barday et al.	Sep 2020	A1
20200310917	Tkachev et al.	Oct 2020	A1
20200311310	Barday et al.	Oct 2020	A1
20200344243	Brannon et al.	Oct 2020	A1
20200356695	Brannon et al.	Nov 2020	A1
20200364369	Brannon et al.	Nov 2020	A1
20200372178	Barday et al.	Nov 2020	A1
20200394327	Childress et al.	Dec 2020	A1
20200401380	Jacobs et al.	Dec 2020	A1
20200401962	Gottemukkala et al.	Dec 2020	A1
20200410117	Barday et al.	Dec 2020	A1
20200410131	Barday et al.	Dec 2020	A1
20200410132	Brannon et al.	Dec 2020	A1
20210012341	Garg et al.	Jan 2021	A1
20210056569	Silberman et al.	Feb 2021	A1
20210075775	Cheng et al.	Mar 2021	A1
20210081567	Park et al.	Mar 2021	A1
20210099449	Frederick et al.	Apr 2021	A1
20210110047	Fang	Apr 2021	A1
20210125089	Nickl et al.	Apr 2021	A1
20210152496	Kim et al.	May 2021	A1
20210233157	Crutchfield, Jr.	Jul 2021	A1
20210243595	Buck et al.	Aug 2021	A1
20210248247	Poothokaran et al.	Aug 2021	A1
20210256163	Fleming et al.	Aug 2021	A1
20210279360	Gimenez Palop et al.	Sep 2021	A1
20210297441	Olalere	Sep 2021	A1
20210303828	Lafreniere et al.	Sep 2021	A1
20210312061	Schroeder et al.	Oct 2021	A1
20210326786	Sun et al.	Oct 2021	A1
20210328969	Gaddam et al.	Oct 2021	A1
20210382949	Yastrebenetsky et al.	Dec 2021	A1
20210397735	Samatov et al.	Dec 2021	A1
20210400018	Vettaikaran et al.	Dec 2021	A1
20210406712	Bhide et al.	Dec 2021	A1
20220137850	Boddu et al.	May 2022	A1

Foreign Referenced Citations (15)

Number	Date	Country
111496802	Aug 2020	CN
112115859	Dec 2020	CN
1394698	Mar 2004	EP
2031540	Mar 2009	EP
20130062500	Jun 2013	KR
2001033430	May 2001	WO
20020067158	Aug 2002	WO
20030050773	Jun 2003	WO
2005008411	Jan 2005	WO
2007002412	Jan 2007	WO
2008134203	Nov 2008	WO
2012174659	Dec 2012	WO
2015116905	Aug 2015	WO
2020146028	Jul 2020	WO
2022006421	Jan 2022	WO

Non-Patent Literature Citations (872)

Entry
Amar et al, “Privacy-Aware Infrastructure for Managing Personal Data,” ACM, pp. 571-572, Aug. 22-26, 2016 (Year: 2016).
Banerjee et al, “Link Before You Share: Managing Privacy Policies through Blockchain,” IEEE, pp. 4438-4447 (Year: 2017).
Civili et al, “Mastro Studio: Managing Ontology-Based Data Access Applications,” ACM, pp. 1314-1317, Aug. 26-30, 2013 (Year: 2013).
Degeling et al, “We Value Your Privacy . . . Now Take Some Cookies: Measuring the GDPRs Impact on Web Privacy,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University, Ithaca, NY 14853, Aug. 15, 2018, pp. 1-15 (Year: 2019).
Geko et al, “An Ontology Capturing the Interdependence of the General Data Protection Regulation (GDPR) and Information Security,” ACM, pp. 1-6, Nov. 15-16, 2018 (Year: 2018).
International Search Report, dated Jan. 5, 2022, from corresponding International Application No. PCT/US2021/050497.
Lu, “How Machine Learning Mitigates Racial Bias in the US Housing Market,” Available as SSRN 3489519, pp. 1-73, Nov. 2019 (Year: 2019).
Notice of Allowance, dated Dec. 30, 2021, from corresponding U.S. Appl. No. 16/938,520.
Notice of Allowance, dated Jan. 11, 2022, from corresponding U.S. Appl. No. 17/371,350.
Notice of Allowance, dated Jan. 12, 2022, from corresponding U.S. Appl. No. 17/334,948.
Notice of Allowance, dated Jan. 12, 2022, from corresponding U.S. Appl. No. 17/463,775.
Notice of Allowance, dated Jan. 24, 2022, from corresponding U.S. Appl. No. 17/340,699.
Notice of Allowance, dated Jan. 26, 2022, from corresponding U.S. Appl. No. 17/491,906.
Notice of Allowance, dated Jan. 5, 2022, from corresponding U.S. Appl. No. 17/475,241.
Notice of Allowance, dated Jan. 6, 2022, from corresponding U.S. Appl. No. 17/407,765.
Notice of Allowance, dated Jan. 7, 2022, from corresponding U.S. Appl. No. 17/222,725.
Office Action, dated Dec. 30, 2021, from corresponding U.S. Appl. No. 17/149,421.
Office Action, dated Jan. 14, 2022, from corresponding U.S. Appl. No. 17/499,595.
Office Action, dated Jan. 21, 2022, from corresponding U.S. Appl. No. 17/499,624.
Office Action, dated Jan. 25, 2022, from corresponding U.S. Appl. No. 17/494,220.
Office Action, dated Jan. 4, 2022, from corresponding U.S. Appl. No. 17/480,377.
Office Action, dated Jan. 7, 2022, from corresponding U.S. Appl. No. 17/387,421.
Rakers, “Managing Professional and Personal Sensitive Information,” ACM, pp. 9-13, Oct. 24-27, 2010 (Year: 2010).
Sachinopoulou et al, “Ontology-Based Approach for Managing Personal Health and Wellness Information,” IEEE, pp. 1802-1805 (Year: 2007).
Shankar et al, “Doppleganger: Better Browser Privacy Without the Bother,” Proceedings of the 13th ACM Conference on Computer and Communications Security; [ACM Conference on Computer and Communications Security], New York, NY : ACM, US, Oct. 30, 2006, pp. 154-167 (Year: 2006).
Written Opinion of the International Searching Authority, dated Jan. 5, 2022, from corresponding International Application No. PCT/US2021/050497.
Yue et al, “An Automatic HTTP Cookie Management System,” Computer Networks, Elsevier, Amsterdam, NL, vol. 54, No. 13, Sep. 15, 2010, pp. 2182-2198 (Year: 2010).
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036893.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036901.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036913.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036920.
International Search Report, dated Dec. 14, 2018, from corresponding International Application No. PCT/US2018/045296.
International Search Report, dated Jan. 14, 2019, from corresponding International Application No. PCT/US2018/046949.
International Search Report, dated Jan. 7, 2019, from corresponding International Application No. PCT/US2018/055772.
International Search Report, dated Jun. 21, 2017, from corresponding International Application No. PCT/US2017/025600.
International Search Report, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025605.
International Search Report, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025611.
International Search Report, dated Mar. 14, 2019, from corresponding International Application No. PCT/US2018/055736.
International Search Report, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055773.
International Search Report, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055774.
International Search Report, dated Nov. 19, 2018, from corresponding International Application No. PCT/US2018/046939.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043975.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043976.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043977.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/044026.
International Search Report, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/045240.
International Search Report, dated Oct. 12, 2017, from corresponding International Application No. PCT/US2017/036888.
International Search Report, dated Oct. 12, 2018, from corresponding International Application No. PCT/US2018/044046.
International Search Report, dated Oct. 16, 2018, from corresponding International Application No. PCT/US2018/045243.
International Search Report, dated Oct. 18, 2018, from corresponding International Application No. PCT/US2018/045249.
International Search Report, dated Oct. 20, 2017, from corresponding International Application No. PCT/US2017/036917.
International Search Report, dated Oct. 3, 2017, from corresponding International Application No. PCT/US2017/036912.
International Search Report, dated Sep. 1, 2017, from corresponding International Application No. PCT/US2017/036896.
International Search Report, dated Sep. 12, 2018, from corresponding International Application No. PCT/US2018/037504.
Invitation to Pay Additional Search Fees, dated Aug. 10, 2017, from corresponding International Application No. PCT/US2017/036912.
Invitation to Pay Additional Search Fees, dated Aug. 10, 2017, from corresponding International Application No. PCT/US2017/036917.
Invitation to Pay Additional Search Fees, dated Aug. 24, 2017, from corresponding International Application No. PCT/US2017/036888.
Invitation to Pay Additional Search Fees, dated Jan. 18, 2019, from corresponding International Application No. PCT/US2018/055736.
Invitation to Pay Additional Search Fees, dated Jan. 7, 2019, from corresponding International Application No. PCT/US2018/055773.
Invitation to Pay Additional Search Fees, dated Jan. 8, 2019, from corresponding International Application No. PCT/US2018/055774.
Invitation to Pay Additional Search Fees, dated Oct. 23, 2018, from corresponding International Application No. PCT/US2018/045296.
Written Opinion of the International Searching Authority, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025611.
Written Opinion of the International Searching Authority, dated Aug. 15, 2017, from corresponding International Application No. PCT/US2017/036919.
Written Opinion of the International Searching Authority, dated Aug. 21, 2017, from corresponding International Application No. PCT/US2017/036914.
Written Opinion of the International Searching Authority, dated Aug. 29, 2017, from corresponding International Application No. PCT/US2017/036898.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036889.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036890.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036893.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036901.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036913.
Written Opinion of the International Searching Authority, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036920.
Written Opinion of the International Searching Authority, dated Dec. 14, 2018, from corresponding International Application No. PCT/US2018/045296.
Written Opinion of the International Searching Authority, dated Jan. 14, 2019, from corresponding International Application No. PCT/US2018/046949.
Written Opinion of the International Searching Authority, dated Jan. 7, 2019, from corresponding International Application No. PCT/US2018/055772.
Written Opinion of the International Searching Authority, dated Jun. 21, 2017, from corresponding International Application No. PCT/US2017/025600.
Written Opinion of the International Searching Authority, dated Jun. 6, 2017, from corresponding International Application No. PCT/US2017/025605.
Written Opinion of the International Searching Authority, dated Mar. 14, 2019, from corresponding International Application No. PCT/US2018/055736.
Tsai et al, “Determinants of Intangible Assets Value: The Data Mining Approach,” Knowledge Based System, pp. 67-77 http://www.elsevier.com/locate/knosys (Year: 2012).
Tuomas Aura et al., Scanning Electronic Documents for Personally Identifiable Information, ACM, Oct. 30, 2006, retrieved online on Jun. 13, 2019, pp. 41-49. Retrieved from the Internet: URL: http://delivery.acm.org/10.1145/1180000/1179608/p41-aura.pdf? (Year: 2006).
Wang et al, “Revealing Key Non-Financial Factors for Online Credit-Scoring in E-Financing,” 2013, IEEE, pp. 1-6 (Year: 2013).
Wang et al, “Secure and Efficient Access to Outsourced Data,” ACM, pp. 55-65 (Year: 2009).
Weaver et al, “Understanding Information Preview in Mobile Email Processing”, ACM, pp. 303-312, 2011 (Year: 2011).
Wu et al, “Data Mining with Big Data,” IEEE, Jan. 2014, pp. 97-107, vol. 26, No. 1, (Year: 2014).
www.truste.com (1), 200150207, Internet Archive Wayback Machine, www.archive.org,2_7_2015.
Xu, et al, “GatorShare: A File System Framework for High-Throughput Data Management,” ACM, pp. 776-786 (Year: 2010).
Yang et al, “DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems,” IEEE, pp. 1790-1801 (Year: 2013).
Yang et al, “Mining Web Access Sequence with Improved Apriori Algorithm,” IEEE, 2017, pp. 780-784 (Year: 2017).
Ye et al, “An Evolution-Based Cache Scheme for Scalable Mobile Data Access,” ACM, pp. 1-7 (Year: 2007).
Yin et al, “Multibank Memory Optimization for Parallel Data Access in Multiple Data Arrays”, ACM, pp. 1-8 (Year: 2016).
Yiu et al, “Outsourced Similarity Search on Metric Data Assets”, IEEE, pp. 338-352 (Year: 2012).
Yu, “Using Data from Social Media Websites to Inspire the Design of Assistive Technology”, ACM, pp. 1-2 (Year: 2016).
Yu, et al, “Performance and Fairness Issues in Big Data Transfers,” ACM, pp. 9-11 (Year: 2014).
Zannone, et al, “Maintaining Privacy on Derived Objects,” ACM, pp. 10-19 (Year: 2005).
Zeldovich, Nickolai, et al, Making Information Flow Explicit in HiStar, OSDI '06: 7th USENIX Symposium on Operating Systems Design and Implementation, USENIX Association, p. 263-278.
Zhang et al, “Data Transfer Performance Issues for a Web Services Interface to Synchrotron Experiments”, ACM, pp. 59-65 (Year: 2007).
Zhang et al, “Dynamic Topic Modeling for Monitoring Market Competition from Online Text and Image Data”, ACM, pp. 1425-1434 (Year: 2015).
Zheng, et al, “Methodologies for Cross-Domain Data Fusion: An Overview,” IEEE, pp. 16-34 (Year: 2015).
Zheng, et al, “Toward Assured Data Deletion in Cloud Storage,” IEEE, vol. 34, No. 3, pp. 101-107 May/Jun. 2020 (Year: 2020).
Zhu, et al, “Dynamic Data Integration Using Web Services,” IEEE, pp. 1-8 (Year: 2004).
Bin, et al, “Research on Data Mining Models for the Internet of Things,” IEEE, pp. 1-6 (Year: 2010).
Borgida, “Description Logics in Data Management,” IEEE Transactions on Knowledge and Data Engineering, vol. 7, No. 5, Oct. 1995, pp. 671-682 (Year: 1995).
Final Office Action, dated Aug. 9, 2021, from corresponding U.S. Appl. No. 17/119,080.
Golab, et al, “Issues in Data Stream Management,” ACM, SIGMOD Record, vol. 32, No. 2, Jun. 2003, pp. 5-14 (Year: 2003).
Halevy, et al, “Schema Mediation in Peer Data Management Systems,” IEEE, Proceedings of the 19th International Conference on Data Engineering, 2003, pp. 505-516 (Year: 2003).
Jensen, et al, “Temporal Data Management,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, No. 1, Jan./Feb. 1999, pp. 36-44 (Year: 1999).
Notice of Allowance, dated Aug. 4, 2021, from corresponding U.S. Appl. No. 16/895,278.
Notice of Allowance, dated Aug. 9, 2021, from corresponding U.S. Appl. No. 16/881,699.
Notice of Allowance, dated Jul. 26, 2021, from corresponding U.S. Appl. No. 17/151,399.
Notice of Allowance, dated Jul. 26, 2021, from corresponding U.S. Appl. No. 17/207,316.
Pearson, et al, “A Model-Based Privacy Compliance Checker,” IJEBR, vol. 5, No. 2, pp. 63-83, 2009, Nov. 21, 2008. [Online]. Available: http://dx.doi.org/10.4018/jebr.2009040104 (Year: 2008).
Czeskis et al, “Lightweight Server Support for Browser-based CSRF Protection,” Proceedings of the 22nd International Conference on World Wide Web, 2013, pp. 273-284 (Year: 2013).
Final Office Action, dated Feb. 25, 2022, from corresponding U.S. Appl. No. 17/346,586.
Final Office Action, dated Mar. 21, 2022, from corresponding U.S. Appl. No. 17/373,444.
Final Office Action, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/380,485.
Matte et al, “Do Cookie Banners Respect my Choice?: Measuring Legal Compliance of Banners from IAB Europe's Transparency and Consent Framework,” 2020 IEEE Symposium on Security and Privacy (SP), 2020, pp. 791-809 (Year: 2020).
Notice of Allowance, dated Feb. 24, 2022, from corresponding U.S. Appl. No. 17/234,205.
Notice of Allowance, dated Feb. 24, 2022, from corresponding U.S. Appl. No. 17/549,170.
Notice of Allowance, dated Mar. 16, 2022, from corresponding U.S. Appl. No. 17/486,350.
Notice of Allowance, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 16/872,130.
Notice of Allowance, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/535,098.
Notice of Allowance, dated Mar. 21, 2022, from corresponding U.S. Appl. No. 17/366,754.
Notice of Allowance, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/475,244.
Notice of Allowance, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/504,102.
Notice of Allowance, dated Mar. 28, 2022, from corresponding U.S. Appl. No. 17/499,609.
Notice of Allowance, dated Mar. 4, 2022, from corresponding U.S. Appl. No. 17/409,999.
Office Action, dated Mar. 1, 2022, from corresponding U.S. Appl. No. 17/119,080.
Office Action, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/020,275.
Office Action, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/161,159.
Office Action, dated Mar. 2, 2022, from corresponding U.S. Appl. No. 17/200,698.
Office Action, dated Mar. 21, 2022, from corresponding U.S. Appl. No. 17/571,871.
Office Action, dated Mar. 22, 2022, from corresponding U.S. Appl. No. 17/187,329.
Sanchez-Rola et al, “Can I Opt Out Yet?: GDPR and the Global Illusion of Cookie Control,” Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, 2019, pp. 340-351 (Year: 2019).
Chowdhury et al, “Managing Data Transfers in Computer Clusters with Orchestra,” ACM, pp. 98-109 (Year: 2011).
Decision Regarding Institution of Post-Grant Review in Case PGR2018-00056 for U.S. Pat. No. 9,691,090 B1, Oct. 11, 2018.
Dimou et al, “Machine-Interpretable Dataset and Service Descriptions for Heterogeneous Data Access and Retrieval”, ACM, pp. 145-152 (Year: 2015).
Dokholyan et al, “Regulatory and Ethical Considerations for Linking Clinical and Administrative Databases,” American Heart Journal 157.6 (2009), pp. 971-982 (Year: 2009).
Dunkel et al, “Data Organization and Access for Efficient Data Mining”, IEEE, pp. 522-529 (Year: 1999).
Dwork, Cynthia, Differential Privacy, Microsoft Research, p. 1-12.
Emerson, et al, “A Data Mining Driven Risk Profiling Method for Road Asset Management,” ACM, pp. 1267-1275 (Year: 2013).
Enck, William, et al, TaintDroid: An Information-Flow Tracking System for Realtime Privacy Monitoring on Smartphones, ACM Transactions on Computer Systems, vol. 32, No. 2, Article 5, Jun. 2014, p. 5:1-5:29.
Falahrastegar, Marjan, et al, Tracking Personal Identifiers Across the Web, Medical Image Computing and Computer-Assisted Intervention—Miccai 2015, 18th International Conference, Oct. 5, 2015, Munich, Germany.
Final Written Decision Regarding Post-Grant Review in Case PGR2018-00056 for U.S. Pat. No. 9,691,090 B1, Oct. 10, 2019.
Francis, Andre, Business Mathematics and Statistics, South-Western Cengage Learning, 2008, Sixth Edition.
Friedman et al, “Data Mining with Differential Privacy,” ACM, Jul. 2010, pp. 493-502 (Year: 2010).
Friedman et al, “Informed Consent in the Mozilla Browser: Implementing Value-Sensitive Design,” Proceedings of the 35th Annual Hawaii International Conference on System Sciences, 2002, IEEE, pp. 1-10 (Year: 2002).
Frikken, Keith B., et al, Yet Another Privacy Metric for Publishing Micro-data, Miami University, Oct. 27, 2008, p. 117-121.
Fung et al, “Discover Information and Knowledge from Websites using an Integrated Summarization and Visualization Framework”, IEEE, pp. 232-235 (Year: 2010).
Gajare et al, “Improved Automatic Feature Selection Approach for Health Risk Prediction,” Feb. 16, 2018, IEEE, pp. 816-819 (Year: 2018).
Ghiglieri, Marco et al.; Personal DLP for Facebook, 2014 IEEE International Conference on Pervasive Computing and Communication Workshops (Percom Workshops); IEEE; Mar. 24, 2014; pp. 629-634.
Gilda, et al, “Blockchain for Student Data Privacy and Consent,” 2018 International Conference on Computer Communication and Informatics, Jan. 4-6, 2018, IEEE, pp. 1-5 (Year: 2018).
Golfarelli et al, “Beyond Data Warehousing: What's Next in Business Intelligence?,” ACM, pp. 1-6 (Year: 2004).
Goni, Kyriaki, “Deletion Process_Only you can see my history: Investigating Digital Privacy, Digital Oblivion, and Control on Personal Data Through an Interactive Art Installation,” ACM, 2016, retrieved online on Oct. 3, 2019, pp. 324-333. Retrieved from the Internet URL: http://delivery.acm.org/10.1145/2920000/291.
Gowadia et al, “RDF Metadata for XML Access Control,” ACM, pp. 31-48 (Year: 2003).
Grolinger, et al, “Data Management in Cloud Environments: NoSQL and NewSQL Data Stores,” Journal of Cloud Computing: Advances, Systems and Applications, pp. 1-24 (Year: 2013).
Guo, et al, “OPAL: A Passe-partout for Web Forms,” ACM, pp. 353-356 (Year: 2012).
Gustarini, et al, “Evaluation of Challenges in Human Subject Studies “In-the-Wild” Using Subjects' Personal Smartphones,” ACM, pp. 1447-1456 (Year: 2013).
Hacigümüs, Hakan, et al, Executing SQL over Encrypted Data in the Database-Service-Provider Model, ACM, Jun. 4, 2002, pp. 216-227.
Hauch, et al, “Information Intelligence: Metadata for Information Discovery, Access, and Integration,” ACM, pp. 793-798 (Year: 2005).
Hernandez, et al, “Data Exchange with Data-Metadata Translations,” ACM, pp. 260-273 (Year: 2008).
Hinde, “A Model to Assess Organisational Information Privacy Maturity Against the Protection of Personal Information Act” Dissertation University of Cape Town 2014, pp. 1-121 (Year: 2014).
Hodge, et al, “Managing Virtual Data Marts with Metapointer Tables,” pp. 1-7 (Year: 2002).
Horrall et al, “Evaluating Risk: IBM's Country Financial Risk and Treasury Risk Scorecards,” Jul. 21, 2014, IBM, vol. 58, issue 4, pp. 2:1-2:9 (Year: 2014).
Hu, et al, “Attribute Considerations for Access Control Systems,” NIST Special Publication 800-205, Jun. 2019, pp. 1-42 (Year: 2019).
Hu, et al, “Guide to Attribute Based Access Control (ABAC) Definition and Considerations (Draft),” NIST Special Publication 800-162, pp. 1-54 (Year: 2013).
Huang, et al, “A Study on Information Security Management with Personal Data Protection,” IEEE, Dec. 9, 2011, pp. 624-630 (Year: 2011).
Huner et al, “Towards a Maturity Model for Corporate Data Quality Management”, ACM, pp. 231-238, 2009 (Year: 2009).
Hunton & Williams LLP, The Role of Risk Management in Data Protection, Privacy Risk Framework and the Risk-based Approach to Privacy, Centre for Information Policy Leadership, Workshop II, Nov. 23, 2014.
Huo et al, “A Cloud Storage Architecture Model for Data-lntensive Applications,” IEEE, pp. 1-4 (Year: 2011).
IAPP, Daily Dashboard, PIA Tool Stocked With New Templates for DPI, Infosec, International Association of Privacy Professionals, Apr. 22, 2014.
IAPP, ISO/IEC 27001 Information Security Management Template, Resource Center, International Association of Privacy Professionals.
Imran et al, “Searching in Cloud Object Storage by Using a Metadata Model”, IEEE, 2014, retrieved online on Apr. 1, 2020, pp. 121-128. Retrieved from the Internet: URL: https://ieeeexplore.ieee.org/stamp/stamp.jsp? (Year: 2014).
Islam, et al, “Mixture Model Based Label Association Techniques for Web Accessibility,” ACM, pp. 67-76 (Year: 2010).
Joel Reardon et al., Secure Data Deletion from Persistent Media, ACM, Nov. 4, 2013, retrieved online on Jun. 13, 2019, pp. 271-283. Retrieved from the Internet: URL: http://delivery.acm.org/10.1145/2520000/2516699/p271-reardon.pdf? (Year: 2013).
Joonbakhsh et al, “Mining and Extraction of Personal Software Process measures through IDE Interaction logs,” ACM/IEEE, 2018, retrieved online on Dec. 2, 2019, pp. 78-81. Retrieved from the Internet: URL: http://delivery.acm.org/10.1145/3200000/3196462/p78-joonbakhsh.pdf? (Year: 2018).
Jun et al, “Scalable Multi-Access Flash Store for Big Data Analytics,” ACM, pp. 55-64 (Year: 2014).
Kirkham, et al, “A Personal Data Store for an Internet of Subjects,” IEEE, pp. 92-97 (Year: 2011).
Korba, Larry et al.; “Private Data Discovery for Privacy Compliance in Collaborative Environments”; Cooperative Design, Visualization, and Engineering; Springer Berlin Heidelberg; Sep. 21, 2008; pp. 142-150.
Krol, Kat, et al, Control versus Effort in Privacy Warnings for Webforms, ACM, Oct. 24, 2016, pp. 13-23.
Lamb et al, “Role-Based Access Control for Data Service Integration”, ACM, pp. 3-11 (Year: 2006).
Leadbetter, et al, “Where Big Data Meets Linked Data: Applying Standard Data Models to Environmental Data Streams,” IEEE, pp. 2929-2937 (Year: 2016).
Lebeau, Franck, et al, “Model-Based Vulnerability Testing for Web Applications,” 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops, pp. 445-452, IEEE, 2013 (Year: 2013).
Li, Ninghui, et al, t-Closeness: Privacy Beyond k-Anonymity and I-Diversity, IEEE, 2014, p. 106-115.
Final Office Action, dated Apr. 23, 2020, from corresponding U.S. Appl. No. 16/572,347.
Final Office Action, dated Apr. 27, 2021, from corresponding U.S. Appl. No. 17/068,454.
Final Office Action, dated Apr. 7, 2020, from corresponding U.S. Appl. No. 16/595,327.
Final Office Action, dated Aug. 10, 2020, from corresponding U.S. Appl. No. 16/791,589.
Final Office Action, dated Aug. 28, 2020, from corresponding U.S. Appl. No. 16/410,336.
Final Office Action, dated Aug. 5, 2020, from corresponding U.S. Appl. No. 16/719,071.
Final Office Action, dated Dec. 7, 2020, from corresponding U.S. Appl. No. 16/862,956.
Final Office Action, dated Dec. 9, 2019, from corresponding U.S. Appl. No. 16/410,336.
Final Office Action, dated Feb. 19, 2020, from corresponding U.S. Appl. No. 16/404,491.
Final Office Action, dated Feb. 3, 2020, from corresponding U.S. Appl. No. 16/557,392.
Final Office Action, dated Feb. 8, 2021, from corresponding U.S. Appl. No. 16/927,658.
Final Office Action, dated Jan. 17, 2018, from corresponding U.S. Appl. No. 15/619,278.
Final Office Action, dated Jan. 21, 2020, from corresponding U.S. Appl. No. 16/410,762.
Final Office Action, dated Jan. 23, 2018, from corresponding U.S. Appl. No. 15/619,479.
Final Office Action, dated Jan. 23, 2020, from corresponding U.S. Appl. No. 16/505,430.
Final Office Action, dated Jul. 21, 2021, from corresponding U.S. Appl. No. 17/151,334.
Final Office Action, dated Jul. 7, 2021, from corresponding U.S. Appl. No. 17/149,421.
Final Office Action, dated Mar. 26, 2021, from corresponding U.S. Appl. No. 17/020,275.
Final Office Action, dated Mar. 5, 2019, from corresponding U.S. Appl. No. 16/055,961.
Final Office Action, dated Mar. 6, 2020, from corresponding U.S. Appl. No. 16/595,342.
Final Office Action, dated May 14, 2021, from corresponding U.S. Appl. No. 17/013,756.
Final Office Action, dated Nov. 29, 2017, from corresponding U.S. Appl. No. 15/619,237.
Final Office Action, dated Sep. 21, 2020, from corresponding U.S. Appl. No. 16/808,493.
Final Office Action, dated Sep. 21, 2020, from corresponding U.S. Appl. No. 16/862,944.
Final Office Action, dated Sep. 22, 2020, from corresponding U.S. Appl. No. 16/808,497.
Final Office Action, dated Sep. 23, 2020, from corresponding U.S. Appl. No. 16/862,948.
Final Office Action, dated Sep. 24, 2020, from corresponding U.S. Appl. No. 16/862,952.
Final Office Action, dated Sep. 25, 2019, from corresponding U.S. Appl. No. 16/278,119.
Final Office Action, dated Sep. 28, 2020, from corresponding U.S. Appl. No. 16/565,395.
Final Office Action, dated Sep. 8, 2020, from corresponding U.S. Appl. No. 16/410,866.
Office Action, dated Apr. 1, 2021, from corresponding U.S. Appl. No. 17/119,080.
Office Action, dated Apr. 15, 2021, from corresponding U.S. Appl. No. 17/161,159.
Office Action, dated Apr. 18, 2018, from corresponding U.S. Appl. No. 15/894,819.
Office Action, dated Apr. 2, 2021, from corresponding U.S. Appl. No. 17/151,334.
Office Action, dated Apr. 20, 2020, from corresponding U.S. Appl. No. 16/812,795.
Office Action, dated Apr. 22, 2019, from corresponding U.S. Appl. No. 16/241,710.
Office Action, dated Apr. 22, 2020, from corresponding U.S. Appl. No. 16/811,793.
Office Action, dated Apr. 28, 2020, from corresponding U.S. Appl. No. 16/798,818.
Office Action, dated Apr. 28, 2020, from corresponding U.S. Appl. No. 16/808,500.
Office Action, dated Apr. 28, 2021, from corresponding U.S. Appl. No. 16/808,497.
Office Action, dated Apr. 29, 2020, from corresponding U.S. Appl. No. 16/791,337.
Office Action, dated Apr. 5, 2019, from corresponding U.S. Appl. No. 16/278,119.
Office Action, dated Apr. 7, 2020, from corresponding U.S. Appl. No. 16/788,633.
Office Action, dated Apr. 7, 2020, from corresponding U.S. Appl. No. 16/791,589.
Office Action, dated Aug. 13, 2019, from corresponding U.S. Appl. No. 16/505,430.
Office Action, dated Aug. 13, 2019, from corresponding U.S. Appl. No. 16/512,033.
Office Action, dated Aug. 15, 2019, from corresponding U.S. Appl. No. 16/505,461.
Office Action, dated Aug. 19, 2019, from corresponding U.S. Appl. No. 16/278,122.
Office Action, dated Aug. 20, 2020, from corresponding U.S. Appl. No. 16/817,136.
Office Action, dated Aug. 23, 2017, from corresponding U.S. Appl. No. 15/626,052.
Barr, “Amazon Rekognition Update—Estimated Age Range for Faces,” AWS News Blog, Feb. 10, 2017, pp. 1-5 (Year: 2017).
Everypixel Team, “A New Age Recognition API Detects the Age of People on Photos,” May 20, 2019, pp. 1-5 (Year: 2019).
Final Office Action, dated Aug. 27, 2021, from corresponding U.S. Appl. No. 17/161,159.
Final Office Action, dated Sep. 17, 2021, from corresponding U.S. Appl. No. 17/200,698.
International Search Report, dated Sep. 15, 2021, from corresponding International Application No. PCT/US2021/033631.
Ma Ziang, et al, “LibRadar: Fast and Accurate Detection of Third-Party Libraries in Android Apps,” 2016 IEEE/ACM 38th IEEE International Conference on Software Engineering Companion (ICSE-C), ACM, May 14, 2016, pp. 653-656, DOI: http://dx.doi.org/10.1145/2889160.2889178, p. 653, r.col., par. 1-3; figure 3 (Year: 2016).
Mandal, et al, “Automated Age Prediction Using Wrinkles Features of Facial Images and Neural Network,” International Journal of Emerging Engineering Research and Technology, vol. 5, Issue 2, Feb. 2017, pp. 12-20 (Year: 2017).
Martin, et al, “Hidden Surveillance by Web Sites: Web Bugs in Contemporary Use,” Communications of the ACM, vol. 46, No. 12, Dec. 2003, pp. 258-264. Internet source https://doi.org/10.1145/953460.953509 (Year: 2003).
Notice of Allowance, dated Aug. 12, 2021, from corresponding U.S. Appl. No. 16/881,832.
Notice of Allowance, dated Aug. 31, 2021, from corresponding U.S. Appl. No. 17/326,901.
Notice of Allowance, dated Sep. 1, 2021, from corresponding U.S. Appl. No. 17/196,570.
Notice of Allowance, dated Sep. 1, 2021, from corresponding U.S. Appl. No. 17/222,556.
Notice of Allowance, dated Sep. 14, 2021, from corresponding U.S. Appl. No. 16/808,497.
Notice of Allowance, dated Sep. 23, 2021, from corresponding U.S. Appl. No. 17/068,454.
Notice of Allowance, dated Sep. 24, 2021, from corresponding U.S. Appl. No. 17/334,939.
Notice of Allowance, dated Sep. 27, 2021, from corresponding U.S. Appl. No. 17/222,523.
Notice of Allowance, dated Sep. 29, 2021, from corresponding U.S. Appl. No. 17/316,179.
Notice of Allowance, dated Sep. 9, 2021, from corresponding U.S. Appl. No. 17/334,909.
Office Action, dated Aug. 18, 2021, from corresponding U.S. Appl. No. 17/222,725.
Office Action, dated Aug. 27, 2021, from corresponding U.S. Appl. No. 17/187,329.
Office Action, dated Aug. 27, 2021, from corresponding U.S. Appl. No. 17/334,948.
Office Action, dated Aug. 30, 2021, from corresponding U.S. Appl. No. 16/938,520.
Office Action, dated Sep. 15, 2021, from corresponding U.S. Appl. No. 16/623,157.
Office Action, dated Sep. 24, 2021, from corresponding U.S. Appl. No. 17/342,153.
Regulation (EU) 2016/679, “On the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing Directive 95/46/EC (General Data Protection Regulation),” Official Journal of the European Union, May 4, 2016, pp. L 119/1-L 119/88 (Year: 2016).
Stack Overflow, “Is there a way to force a user to scroll to the bottom of a div?,” Stack Overflow, pp. 1-11, Nov. 2013. [Online]. Available: https://stackoverflow.com/questions/2745935/is-there-a-way-to-force-a-user-to-scroll-to-the-bottom-of-a-div (Year: 2013).
Tanwar, et al, “Live Forensics Analysis: Violations of Business Security Policy,” 2014 International Conference on Contemporary Computing and Informatics (IC31), 2014, pp. 971-976 (Year: 2014).
Written Opinion of the International Searching Authority, dated Sep. 15, 2021, from corresponding International Application No. PCT/US2021/033631.
Notice of Allowance, dated Aug. 7, 2020, from corresponding U.S. Appl. No. 16/901,973.
Notice of Allowance, dated Aug. 9, 2018, from corresponding U.S. Appl. No. 15/882,989.
Notice of Allowance, dated Dec. 10, 2018, from corresponding U.S. Appl. No. 16/105,602.
Notice of Allowance, dated Dec. 11, 2019, from corresponding U.S. Appl. No. 16/278,122.
Notice of Allowance, dated Dec. 11, 2019, from corresponding U.S. Appl. No. 16/593,634.
Notice of Allowance, dated Dec. 12, 2017, from corresponding U.S. Appl. No. 15/169,643.
Notice of Allowance, dated Dec. 12, 2017, from corresponding U.S. Appl. No. 15/619,212.
Notice of Allowance, dated Dec. 12, 2017, from corresponding U.S. Appl. No. 15/619,382.
Notice of Allowance, dated Dec. 13, 2019, from corresponding U.S. Appl. No. 16/512,033.
Notice of Allowance, dated Dec. 15, 2020, from corresponding U.S. Appl. No. 16/989,086.
Notice of Allowance, dated Dec. 16, 2019, from corresponding U.S. Appl. No. 16/505,461.
Notice of Allowance, dated Dec. 17, 2020, from corresponding U.S. Appl. No. 17/034,772.
Notice of Allowance, dated Dec. 18, 2019, from corresponding U.S. Appl. No. 16/659,437.
Notice of Allowance, dated Dec. 23, 2019, from corresponding U.S. Appl. No. 16/656,835.
Notice of Allowance, dated Dec. 23, 2020, from corresponding U.S. Appl. No. 17/068,557.
Notice of Allowance, dated Dec. 3, 2019, from corresponding U.S. Appl. No. 16/563,749.
Notice of Allowance, dated Dec. 31, 2018, from corresponding U.S. Appl. No. 16/159,634.
Notice of Allowance, dated Dec. 31, 2019, from corresponding U.S. Appl. No. 16/404,399.
Notice of Allowance, dated Dec. 4, 2019, from corresponding U.S. Appl. No. 16/594,670.
Notice of Allowance, dated Dec. 5, 2017, from corresponding U.S. Appl. No. 15/633,703.
Notice of Allowance, dated Dec. 6, 2017, from corresponding U.S. Appl. No. 15/619,451.
Notice of Allowance, dated Dec. 6, 2017, from corresponding U.S. Appl. No. 15/619,459.
Notice of Allowance, dated Dec. 7, 2020, from corresponding U.S. Appl. No. 16/817,136.
Notice of Allowance, dated Dec. 9, 2019, from corresponding U.S. Appl. No. 16/565,261.
Notice of Allowance, dated Dec. 9, 2020, from corresponding U.S. Appl. No. 16/404,491.
Notice of Allowance, dated Feb. 10, 2020, from corresponding U.S. Appl. No. 16/552,765.
Notice of Allowance, dated Feb. 11, 2021, from corresponding U.S. Appl. No. 17/086,732.
Notice of Allowance, dated Feb. 12, 2020, from corresponding U.S. Appl. No. 16/572,182.
Notice of Allowance, dated Feb. 13, 2019, from corresponding U.S. Appl. No. 16/041,563.
Notice of Allowance, dated Feb. 14, 2019, from corresponding U.S. Appl. No. 16/226,272.
Notice of Allowance, dated Feb. 19, 2019, from corresponding U.S. Appl. No. 16/159,632.
Notice of Allowance, dated Feb. 19, 2021, from corresponding U.S. Appl. No. 16/832,451.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/034,355.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/068,198.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/101,106.
Notice of Allowance, dated Feb. 24, 2021, from corresponding U.S. Appl. No. 17/101,253.
Notice of Allowance, dated Feb. 25, 2020, from corresponding U.S. Appl. No. 16/714,355.
Notice of Allowance, dated Feb. 25, 2021, from corresponding U.S. Appl. No. 17/106,469.
Notice of Allowance, dated Feb. 26, 2021, from corresponding U.S. Appl. No. 17/139,650.
Notice of Allowance, dated Feb. 27, 2019, from corresponding U.S. Appl. No. 16/041,468.
Notice of Allowance, dated Feb. 27, 2019, from corresponding U.S. Appl. No. 16/226,290.
Notice of Allowance, dated Feb. 3, 2021, from corresponding U.S. Appl. No. 16/827,039.
Notice of Allowance, dated Feb. 3, 2021, from corresponding U.S. Appl. No. 17/068,558.
Notice of Allowance, dated Jan. 1, 2021, from corresponding U.S. Appl. No. 17/026,727.
Notice of Allowance, dated Jan. 14, 2020, from corresponding U.S. Appl. No. 16/277,715.
Notice of Allowance, dated Jan. 15, 2021, from corresponding U.S. Appl. No. 17/030,714.
Notice of Allowance, dated Jan. 18, 2018, from corresponding U.S. Appl. No. 15/619,478.
Notice of Allowance, dated Jan. 18, 2019 from corresponding U.S. Appl. No. 16/159,635.
Notice of Allowance, dated Jan. 2, 2020, from corresponding U.S. Appl. No. 16/410,296.
Notice of Allowance, dated Jan. 23, 2018, from corresponding U.S. Appl. No. 15/619,251.
Bjorn Greif, “Cookie Pop-up Blocker: Cliqz Automatically Denies Consent Requests,” Cliqz.com, pp. 1-9, Aug. 11, 2019 (Year: 2019).
Final Office Action, dated Dec. 10, 2021, from corresponding U.S. Appl. No. 17/187,329.
He et al, “A Crowdsourcing Framework for Detecting of Cross-Browser Issues in Web Application,” ACM, pp. 1-4, Nov. 6, 2015 (Year: 2015).
International Search Report, dated Dec. 22, 2021, from corresponding International Application No. PCT/US2021/051217.
Jones et al, “AI and the Ethics of Automating Consent,” IEEE, pp. 64-72, May 2018 (Year: 2018).
Liu et al, “A Novel Approach for Detecting Browser-based Silent Miner,” IEEE, pp. 490-497 (Year: 2018).
Lu et al, “An HTTP Flooding Detection Method Based on Browser Behavior,” IEEE, pp. 1151-1154 (Year: 2006).
Notice of Allowance, dated Dec. 13, 2021, from corresponding U.S. Appl. No. 16/908,081.
Notice of Allowance, dated Dec. 13, 2021, from corresponding U.S. Appl. No. 17/347,853.
Notice of Allowance, dated Dec. 2, 2021, from corresponding U.S. Appl. No. 16/901,654.
Notice of Allowance, dated Dec. 8, 2021, from corresponding U.S. Appl. No. 17/397,472.
Nouwens et al, “Dark Patterns after the GDPR: Scraping Consent Pop-ups and Demonstrating their Influence,” ACM, pp. 1-13, Apr. 25, 2020 (Year: 2020).
Office Action, dated Dec. 13, 2021, from corresponding U.S. Appl. No. 17/476,209.
Office Action, dated Dec. 17, 2021, from corresponding U.S. Appl. No. 17/499,582.
Office Action, dated Dec. 2, 2021, from corresponding U.S. Appl. No. 17/504,102.
Office Action, dated Dec. 27, 2021, from corresponding U.S. Appl. No. 17/493,332.
Office Action, dated Dec. 29, 2021, from corresponding U.S. Appl. No. 17/479,807.
Office Action, dated Dec. 7, 2021, from corresponding U.S. Appl. No. 17/499,609.
Paes, “Student Research Abstract: Automatic Detection of Cross-Browser Incompatibilities using Machine Learning and Screenshot Similarity,” ACM, pp. 697-698, Apr. 3, 2017 (Year: 2017).
Restriction Requirement, dated Dec. 17, 2021, from corresponding U.S. Appl. No. 17/475,244.
Shahriar et al, “A Model-Based Detection of Vulnerable and Malicious Browser Extensions,” IEEE, pp. 198-207 (Year: 2013).
Sjosten et al, “Discovering Browser Extensions via Web Accessible Resources,” ACM, pp. 329-336, Mar. 22, 2017 (Year: 2017).
Written Opinion of the International Searching Authority, dated Dec. 22, 2021, from corresponding International Application No. PCT/US2021/051217.
Office Action, dated Jul. 19, 2021, from corresponding U.S. Appl. No. 17/316,179.
Office Action, dated Jul. 21, 2017, from corresponding U.S. Appl. No. 15/256,430.
Office Action, dated Jul. 21, 2021, from corresponding U.S. Appl. No. 16/901,654.
Office Action, dated Jul. 23, 2019, from corresponding U.S. Appl. No. 16/436,616.
Office Action, dated Jul. 24, 2020, from corresponding U.S. Appl. No. 16/404,491.
Office Action, dated Jul. 27, 2020, from corresponding U.S. Appl. No. 16/595,342.
Office Action, dated Jun. 1, 2020, from corresponding U.S. Appl. No. 16/862,952.
Office Action, dated Jun. 24, 2019, from corresponding U.S. Appl. No. 16/410,336.
Office Action, dated Jun. 24, 2021, from corresponding U.S. Appl. No. 17/234,205.
Office Action, dated Jun. 27, 2019, from corresponding U.S. Appl. No. 16/404,405.
Office Action, dated Jun. 7, 2021, from corresponding U.S. Appl. No. 17/200,698.
Office Action, dated Jun. 9, 2021, from corresponding U.S. Appl. No. 17/222,523.
Office Action, dated Mar. 11, 2019, from corresponding U.S. Appl. No. 16/220,978.
Office Action, dated Mar. 12, 2019, from corresponding U.S. Appl. No. 16/221,153.
Office Action, dated Mar. 15, 2021, from corresponding U.S. Appl. No. 17/149,421.
Office Action, dated Mar. 16, 2020, from corresponding U.S. Appl. No. 16/719,488.
Office Action, dated Mar. 17, 2020, from corresponding U.S. Appl. No. 16/565,395.
Office Action, dated Mar. 17, 2020, from corresponding U.S. Appl. No. 16/719,071.
Office Action, dated Mar. 20, 2020, from corresponding U.S. Appl. No. 16/778,709.
Office Action, dated Mar. 23, 2020, from corresponding U.S. Appl. No. 16/671,444.
Office Action, dated Mar. 25, 2019, from corresponding U.S. Appl. No. 16/278,121.
Office Action, dated Mar. 25, 2020, from corresponding U.S. Appl. No. 16/701,043.
Office Action, dated Mar. 25, 2020, from corresponding U.S. Appl. No. 16/791,006.
Office Action, dated Mar. 27, 2019, from corresponding U.S. Appl. No. 16/278,120.
Office Action, dated Mar. 30, 2018, from corresponding U.S. Appl. No. 15/894,890.
Office Action, dated Mar. 30, 2018, from corresponding U.S. Appl. No. 15/896,790.
Office Action, dated Mar. 30, 2021, from corresponding U.S. Appl. No. 17/151,399.
Office Action, dated Mar. 4, 2019, from corresponding U.S. Appl. No. 16/237,083.
Office Action, dated May 14, 2020, from corresponding U.S. Appl. No. 16/808,497.
Office Action, dated May 14, 2020, from corresponding U.S. Appl. No. 16/808,503.
Office Action, dated May 15, 2020, from corresponding U.S. Appl. No. 16/808,493.
Office Action, dated May 16, 2018, from corresponding U.S. Appl. No. 15/882,989.
Office Action, dated May 17, 2019, from corresponding U.S. Appl. No. 16/277,539.
Office Action, dated May 18, 2021, from corresponding U.S. Appl. No. 17/196,570.
Office Action, dated May 2, 2018, from corresponding U.S. Appl. No. 15/894,809.
Office Action, dated May 2, 2019, from corresponding U.S. Appl. No. 16/104,628.
Office Action, dated May 29, 2020, from corresponding U.S. Appl. No. 16/862,944.
Office Action, dated May 29, 2020, from corresponding U.S. Appl. No. 16/862,948.
Office Action, dated May 29, 2020, from corresponding U.S. Appl. No. 16/863,226.
Office Action, dated May 5, 2020, from corresponding U.S. Appl. No. 16/410,336.
Office Action, dated Nov. 1, 2017, from corresponding U.S. Appl. No. 15/169,658.
Office Action, dated Nov. 12, 2020, from corresponding U.S. Appl. No. 17/034,355.
Office Action, dated Nov. 12, 2020, from corresponding U.S. Appl. No. 17/034,772.
Office Action, dated Nov. 15, 2018, from corresponding U.S. Appl. No. 16/059,911.
Office Action, dated Nov. 15, 2019, from corresponding U.S. Appl. No. 16/552,758.
Office Action, dated Nov. 18, 2019, from corresponding U.S. Appl. No. 16/560,885.
Office Action, dated Nov. 18, 2019, from corresponding U.S. Appl. No. 16/560,889.
Office Action, dated Nov. 18, 2019, from corresponding U.S. Appl. No. 16/572,347.
Office Action, dated Nov. 19, 2019, from corresponding U.S. Appl. No. 16/595,342.
Office Action, dated Nov. 20, 2019, from corresponding U.S. Appl. No. 16/595,327.
Office Action, dated Nov. 23, 2018, from corresponding U.S. Appl. No. 16/042,673.
Office Action, dated Nov. 24, 2020, from corresponding U.S. Appl. No. 16/925,628.
Office Action, dated Oct. 10, 2018, from corresponding U.S. Appl. No. 16/041,563.
Office Action, dated Oct. 10, 2018, from corresponding U.S. Appl. No. 16/055,083.
Office Action, dated Oct. 10, 2018, from corresponding U.S. Appl. No. 16/055,944.
Office Action, dated Oct. 14, 2020, from corresponding U.S. Appl. No. 16/927,658.
Office Action, dated Oct. 15, 2018, from corresponding U.S. Appl. No. 16/054,780.
Office Action, dated Oct. 16, 2019, from corresponding U.S. Appl. No. 16/557,392.
Office Action, dated Oct. 16, 2020, from corresponding U.S. Appl. No. 16/808,489.
Office Action, dated Oct. 23, 2018, from corresponding U.S. Appl. No. 16/055,961.
Office Action, dated Oct. 26, 2018, from corresponding U.S. Appl. No. 16/041,468.
Office Action, dated Oct. 8, 2019, from corresponding U.S. Appl. No. 16/552,765.
Office Action, dated Sep. 1, 2017, from corresponding U.S. Appl. No. 15/619,459.
Office Action, dated Sep. 11, 2017, from corresponding U.S. Appl. No. 15/619,375.
Office Action, dated Sep. 11, 2017, from corresponding U.S. Appl. No. 15/619,478.
Office Action, dated Sep. 16, 2019, from corresponding U.S. Appl. No. 16/277,715.
Office Action, dated Sep. 19, 2017, from corresponding U.S. Appl. No. 15/671,073.
Office Action, dated Sep. 22, 2017, from corresponding U.S. Appl. No. 15/619,278.
Office Action, dated Sep. 4, 2020, from corresponding U.S. Appl. No. 16/989,086.
Office Action, dated Sep. 5, 2017, from corresponding U.S. Appl. No. 15/619,469.
Office Action, dated Sep. 6, 2017, from corresponding U.S. Appl. No. 15/619,479.
Office Action, dated Sep. 7, 2017, from corresponding U.S. Appl. No. 15/633,703.
Office Action, dated Sep. 8, 2017, from corresponding U.S. Appl. No. 15/619,251.
Notice of Allowance, dated Apr. 12, 2017, from corresponding U.S. Appl. No. 15/256,419.
Notice of Allowance, dated Apr. 17, 2020, from corresponding U.S. Appl. No. 16/593,639.
Notice of Allowance, dated Apr. 19, 2021, from corresponding U.S. Appl. No. 17/164,029.
Notice of Allowance, dated Apr. 2, 2019, from corresponding U.S. Appl. No. 16/160,577.
Notice of Allowance, dated Apr. 2, 2021, from corresponding U.S. Appl. No. 17/162,006.
Notice of Allowance, dated Apr. 22, 2021, from corresponding U.S. Appl. No. 17/163,701.
Notice of Allowance, dated Apr. 25, 2018, from corresponding U.S. Appl. No. 15/883,041.
Notice of Allowance, dated Apr. 28, 2021, from corresponding U.S. Appl. No. 17/135,445.
Notice of Allowance, dated Apr. 28, 2021, from corresponding U.S. Appl. No. 17/181,828.
Notice of Allowance, dated Apr. 29, 2020, from corresponding U.S. Appl. No. 16/700,049.
Notice of Allowance, dated Apr. 30, 2020, from corresponding U.S. Appl. No. 16/565,265.
Notice of Allowance, dated Apr. 30, 2020, from corresponding U.S. Appl. No. 16/820,346.
Notice of Allowance, dated Apr. 30, 2021, from corresponding U.S. Appl. No. 16/410,762.
Notice of Allowance, dated Apr. 8, 2019, from corresponding U.S. Appl. No. 16/228,250.
Notice of Allowance, dated Apr. 8, 2020, from corresponding U.S. Appl. No. 16/791,348.
Notice of Allowance, dated Apr. 9, 2020, from corresponding U.S. Appl. No. 16/791,075.
Notice of Allowance, dated Aug. 10, 2020, from corresponding U.S. Appl. No. 16/671,444.
Notice of Allowance, dated Aug. 10, 2020, from corresponding U.S. Appl. No. 16/788,633.
Notice of Allowance, dated Aug. 12, 2020, from corresponding U.S. Appl. No. 16/719,488.
Notice of Allowance, dated Aug. 14, 2018, from corresponding U.S. Appl. No. 15/989,416.
Notice of Allowance, dated Aug. 18, 2017, from corresponding U.S. Appl. No. 15/619,455.
Notice of Allowance, dated Aug. 20, 2019, from corresponding U.S. Appl. No. 16/241,710.
Notice of Allowance, dated Aug. 24, 2018, from corresponding U.S. Appl. No. 15/619,479.
Notice of Allowance, dated Aug. 26, 2019, from corresponding U.S. Appl. No. 16/443,374.
Notice of Allowance, dated Aug. 26, 2020, from corresponding U.S. Appl. No. 16/808,503.
Notice of Allowance, dated Aug. 28, 2019, from corresponding U.S. Appl. No. 16/278,120.
Notice of Allowance, dated Aug. 30, 2018, from corresponding U.S. Appl. No. 15/996,208.
Notice of Allowance, dated Oct. 21, 2019, from corresponding U.S. Appl. No. 16/404,405.
Notice of Allowance, dated Oct. 21, 2020, from corresponding U.S. Appl. No. 16/834,812.
Notice of Allowance, dated Oct. 3, 2019, from corresponding U.S. Appl. No. 16/511,700.
Notice of Allowance, dated Sep. 12, 2019, from corresponding U.S. Appl. No. 16/512,011.
Notice of Allowance, dated Sep. 13, 2018, from corresponding U.S. Appl. No. 15/894,809.
Notice of Allowance, dated Sep. 13, 2018, from corresponding U.S. Appl. No. 15/894,890.
Notice of Allowance, dated Sep. 16, 2020, from corresponding U.S. Appl. No. 16/915,097.
Notice of Allowance, dated Sep. 17, 2020, from corresponding U.S. Appl. No. 16/863,226.
Notice of Allowance, dated Sep. 18, 2018, from corresponding U.S. Appl. No. 15/,894,819.
Notice of Allowance, dated Sep. 18, 2018, from corresponding U.S. Appl. No. 16/041,545.
Notice of Allowance, dated Sep. 18, 2020, from corresponding U.S. Appl. No. 16/812,795.
Notice of Allowance, dated Sep. 23, 2020, from corresponding U.S. Appl. No. 16/811,793.
Notice of Allowance, dated Sep. 25, 2020, from corresponding U.S. Appl. No. 16/983,536.
Notice of Allowance, dated Sep. 27, 2017, from corresponding U.S. Appl. No. 15/626,052.
Notice of Allowance, dated Sep. 28, 2018, from corresponding U.S. Appl. No. 16/041,520.
Notice of Allowance, dated Sep. 4, 2018, from corresponding U.S. Appl. No. 15/883,041.
Notice of Allowance, dated Sep. 4, 2020, from corresponding U.S. Appl. No. 16/808,500.
Notice of Allowance, dated Sep. 4, 2020, from corresponding U.S. Appl. No. 16/901,662.
Restriction Requirement, dated Apr. 10, 2019, from corresponding U.S. Appl. No. 16/277,715.
Restriction Requirement, dated Apr. 13, 2020, from corresponding U.S. Appl. No. 16/817,136.
Restriction Requirement, dated Apr. 24, 2019, from corresponding U.S. Appl. No. 16/278,122.
Restriction Requirement, dated Aug. 7, 2019, from corresponding U.S. Appl. No. 16/410,866.
Restriction Requirement, dated Aug. 9, 2019, from corresponding U.S. Appl. No. 16/404,399.
Restriction Requirement, dated Dec. 31, 2018, from corresponding U.S. Appl. No. 15/169,668.
Restriction Requirement, dated Dec. 9, 2019, from corresponding U.S. Appl. No. 16/565,395.
Restriction Requirement, dated Jan. 18, 2017, from corresponding U.S. Appl. No. 15/256,430.
Restriction Requirement, dated Jul. 28, 2017, from corresponding U.S. Appl. No. 15/169,658.
Restriction Requirement, dated Jun. 15, 2021, from corresponding U.S. Appl. No. 17/187,329.
Restriction Requirement, dated Jun. 15, 2021, from corresponding U.S. Appl. No. 17/222,556.
Restriction Requirement, dated Jun. 9, 2021, from corresponding U.S. Appl. No. 17/222,725.
Restriction Requirement, dated May 5, 2020, from corresponding U.S. Appl. No. 16/808,489.
Restriction Requirement, dated Nov. 15, 2019, from corresponding U.S. Appl. No. 16/586,202.
Restriction Requirement, dated Nov. 21, 2016, from corresponding U.S. Appl. No. 15/254,901.
Restriction Requirement, dated Nov. 5, 2019, from corresponding U.S. Appl. No. 16/563,744.
Restriction Requirement, dated Oct. 17, 2018, from corresponding U.S. Appl. No. 16/055,984.
Restriction Requirement, dated Sep. 15, 2020, from corresponding U.S. Appl. No. 16/925,628.
Restriction Requirement, dated Sep. 9, 2019, from corresponding U.S. Appl. No. 16/505,426.
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/808,493.
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/862,944.
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/862,948.
Advisory Action, dated Jan. 13, 2021, from corresponding U.S. Appl. No. 16/862,952.
Advisory Action, dated Jan. 6, 2021, from corresponding U.S. Appl. No. 16/808,497.
Advisory Action, dated Jun. 19, 2020, from corresponding U.S. Appl. No. 16/595,342.
Advisory Action, dated Jun. 2, 2020, from corresponding U.S. Appl. No. 16/404,491.
Advisory Action, dated May 21, 2020, from corresponding U.S. Appl. No. 16/557,392.
International Search Report, dated Aug. 15, 2017, from corresponding International Application No. PCT/US2017/036919.
International Search Report, dated Aug. 21, 2017, from corresponding International Application No. PCT/US2017/036914.
International Search Report, dated Aug. 29, 2017, from corresponding International Application No. PCT/US2017/036898.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036889.
International Search Report, dated Aug. 8, 2017, from corresponding International Application No. PCT/US2017/036890.
Final Office Action, dated Apr. 1, 2022, from corresponding U.S. Appl. No. 17/370,650.
Final Office Action, dated Apr. 5, 2022, from corresponding U.S. Appl. No. 17/013,756.
International Search Report, dated Apr. 12, 2022, from corresponding International Application No. PCT/US2022/016735.
International Search Report, dated Feb. 14, 2022, from corresponding International Application No. PCT/US2021/058274.
International Search Report, dated Mar. 18, 2022, from corresponding International Application No. PCT/US2022/013733.
Lewis, James et al, “Microservices,” Mar. 25, 2014 (Mar. 25, 2014),XP055907494, Retrieved from the Internet: https://martinfowler.com/articles/micr oservices.html. [retrieved on Mar. 31, 2022].
Notice of Allowance, dated Apr. 4, 2022, from corresponding U.S. Appl. No. 17/493,332.
Notice of Allowance, dated Apr. 4, 2022, from corresponding U.S. Appl. No. 17/572,298.
Notice of Allowance, dated Mar. 31, 2022, from corresponding U.S. Appl. No. 17/476,209.
Office Action, dated Apr. 8, 2022, from corresponding U.S. Appl. No. 16/938,509.
Written Opinion of the International Searching Authority, dated Apr. 12, 2022, from corresponding International Application No. PCT/US2022/016735.
Written Opinion of the International Searching Authority, dated Feb. 14, 2022, from corresponding International Application No. PCT/US2021/058274.
Written Opinion of the International Searching Authority, dated Mar. 18, 2022, from corresponding International Application No. PCT/US2022/013733.
Restriction Requirement, dated Apr. 12, 2022, from corresponding U.S. Appl. No. 17/584,187.
Ali et al, “Age Estimation from Facial Images Using Biometric Ratios and Wrinkle Analysis,” IEEE, 2015, pp. 1-5 (Year: 2015).
Chang et al, “A Ranking Approach for Human Age Estimation Based on Face Images,” IEEE, 2010, pp. 3396-3399 (Year: 2010).
Edinger et al, “Age and Gender Estimation of Unfiltered Faces,” IEEE, 2014, pp. 2170-2179 (Year: 2014).
Final Office Action, dated Apr. 25, 2022, from corresponding U.S. Appl. No. 17/149,421.
Han et al, “Demographic Estimation from Face Images: Human vs. Machine Performance,” IEEE, 2015, pp. 1148-1161 (Year: 2015).
Huettner, “Digital Risk Management: Protecting Your Privacy, Improving Security, and Preparing for Emergencies,” IEEE, pp. 136-138 (Year: 2006).
Jayasinghe et al, “Matching Facial Images Using Age Related Morphing Changes,” ISSRI, 2009, pp. 2901-2907 (Year: 2009).
Khan et al, “Wrinkles Energy Based Age Estimation Using Discrete Cosine Transform,” IEEE, 2015, pp. 1-4 (Year: 2015).
Kristian et al, “Human Facial Age Classification Using Active Shape Module, Geometrical Feature, and Support Vendor Machine on Early Growth Stage,” ISICO, 2015, pp. 1-8 (Year: 2015).
Liu et al, “Overview on Ontology Mapping and Approach,” IEEE, pp. 592-595 (Year: 2011).
Milic et al, “Comparative Analysis of Metadata Models on e-Government Open Data Platforms,” IEEE, pp. 119-130 (Year: 2021).
Notice of Allowance, dated Apr. 12, 2022, from corresponding U.S. Appl. No. 17/479,807.
Notice of Allowance, dated Apr. 14, 2022, from corresponding U.S. Appl. No. 17/572,276.
Notice of Allowance, dated Apr. 20, 2022, from corresponding U.S. Appl. No. 17/573,808.
Notice of Allowance, dated Apr. 27, 2022, from corresponding U.S. Appl. No. 17/573,999.
Notice of Allowance, dated Apr. 28, 2022, from corresponding U.S. Appl. No. 17/670,352.
Office Action, dated Apr. 12, 2022, from corresponding U.S. Appl. No. 17/670,341.
Office Action, dated Apr. 18, 2022, from corresponding U.S. Appl. No. 17/670,349.
Office Action, dated Apr. 25, 2022, from corresponding U.S. Appl. No. 17/588,645.
Office Action, dated Apr. 26, 2022, from corresponding U.S. Appl. No. 17/151,334.
Qu et al, “Metadata Type System: Integrate Presentation, Data Models and Extraction to Enable Exploratory Browsing Interfaces,” ACM, pp. 107-116 (Year: 2014).
Shulz et al, “Generative Data Models for Validation and Evaluation of Visualization Techniques,” ACM, pp. 1-13 (Year: 2016).
Final Office Action, dated Apr. 28, 2022, from corresponding U.S. Appl. No. 16/925,550.
Notice of Allowance, dated Apr. 28, 2022, from corresponding U.S. Appl. No. 17/592,922.
Notice of Allowance, dated Apr. 29, 2022, from corresponding U.S. Appl. No. 17/387,421.
Liu et al, “Cross-Geography Scientific Data Transferring Trends and Behavior,” ACM, pp. 267-278 (Year: 2018).
Liu, Kun, et al, A Framework for Computing the Privacy Scores of Users in Online Social Networks, ACM Transactions on Knowledge Discovery from Data, vol. 5, No. 1, Article 6, Dec. 2010, 30 pages.
Liu, Yandong, et al, “Finding the Right Consumer: Optimizing for Conversion in Display Advertising Campaigns,” Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, Feb. 2, 2012, pp. 473-428 (Year: 2012).
Lizar et al, “Usable Consents: Tracking and Managing Use of Personal Data with a Consent Transaction Receipt,” Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing: Adjunct Publication, 2014, pp. 647-652 (Year: 2014).
Luu, et al, “Combined Local and Holistic Facial Features for Age-Determination,” 2010 11th Int. Conf. Control, Automation, Robotics and Vision, Singapore, Dec. 7, 2010, IEEE, pp. 900-904 (Year: 2010).
Maret et al, “Multimedia Information Interchange: Web Forms Meet Data Servers”, IEEE, pp. 499-505 (Year: 1999).
McGarth et al, “Digital Library Technology for Locating and Accessing Scientific Data”, ACM, pp. 188-194 (Year: 1999).
Mesbah et al, “Crawling Ajax-Based Web Applications Through Dynamic Analysis of User Interface State Changes,” ACM Transactions on the Web (TWEB) vol. 6, No. 1, Article 3, Mar. 2012, pp. 1-30 (Year: 2012).
Moiso et al, “Towards a User-Centric Personal Data Ecosystem the Role of the Bank of Individual's Data,” 2012 16th International Conference on Intelligence in Next Generation Networks, Berlin, 2012, pp. 202-209 (Year: 2012).
Moscoso-Zea et al, “Datawarehouse Design for Educational Data Mining,” IEEE, pp. 1-6 (Year: 2016).
Mudepalli et al, “An efficient data retrieval approach using blowfish encryption on cloud CipherText Retrieval in Cloud Computing” IEEE, pp. 267-271 (Year: 2017).
Mundada et al, “Half-Baked Cookies: Hardening Cookie-Based Authentication for the Modern Web,” Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, 2016, pp. 675-685 (Year: 2016).
Newman et al, “High Speed Scientific Data Transfers using Software Defined Networking,” ACM, pp. 1-9 (Year: 2015).
Newman, “Email Archive Overviews using Subject Indexes”, ACM, pp. 652-653, 2002 (Year: 2002).
Nishikawa, Taiji, English Translation of JP 2019154505, Aug. 27, 2019 (Year: 2019).
Notice of Filing Date for Petition for Post-Grant Review of related U.S. Pat. No. 9,691,090 dated Apr. 12, 2018.
O'Keefe et al, “Privacy-Preserving Data Linkage Protocols,” Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, 2004, pp. 94-102 (Year: 2004).
Olenski, Steve, For Consumers, Data Is a Matter of Trust, CMO Network, Apr. 18, 2016, https://www.forbes.com/sites/steveolenski/2016/04/18/for-consumers-data-is-a-matter-of-trust/#2e48496278b3.
Pechenizkiy et al, “Process Mining Online Assessment Data,” Educational Data Mining, pp. 279-288 (Year: 2009).
Petition for Post-Grant Review of related U.S. Pat. No. 9,691,090 dated Mar. 27, 2018.
Petrie et al, “The Relationship between Accessibility and Usability of Websites”, ACM, pp. 397-406 (Year: 2007).
Pfeifle, Sam, The Privacy Advisor, IAPP and AvePoint Launch New Free PIA Tool, International Association of Privacy Professionals, Mar. 5, 2014.
Pfeifle, Sam, The Privacy Advisor, IAPP Heads to Singapore with APIA Template in Tow, International Association of Privacy Professionals, https://iapp.org/news/a/iapp-heads-to-singapore-with-apia-template_in_tow/, Mar. 28, 2014, p. 1-3.
Ping et al, “Wide Area Placement of Data Replicas for Fast and Highly Available Data Access,” ACM, pp. 1-8 (Year: 2011).
Popescu-Zeletin, “The Data Access and Transfer Support in a Local Heterogeneous Network (HMINET)”, IEEE, pp. 147-152 (Year: 1979).
Porter, “De-Identified Data and Third Party Data Mining: The Risk of Re-Identification of Personal Information,” Shidler JL Com. & Tech. 5, 2008, pp. 1-9 (Year: 2008).
Pretorius, et al, “Attributing Users Based on Web Browser History,” 2017 IEEE Conference on Application, Information and Network Security (AINS), 2017, pp. 69-74 (Year: 2017).
Qing-Jiang et al, “The (P, a, K) Anonymity Model for Privacy Protection of Personal Information in the Social Networks,” 2011 6th IEEE Joint International Information Technology and Artificial Intelligence Conference, vol. 2 IEEE, 2011, pp. 420-423 (Year: 2011).
Qiu, et al, “Design and Application of Data Integration Platform Based on Web Services and XML,” IEEE, pp. 253-256 (Year: 2016).
Radu, et al, “Analyzing Risk Evaluation Frameworks and Risk Assessment Methods,” IEEE, Dec. 12, 2020, pp. 1-6 (Year: 2020).
Reardon et al., User-Level Secure Deletion on Log-Structured File Systems, ACM, 2012, retrieved online on Apr. 22, 2021, pp. 1-11. Retrieved from the Internet: URL: http://citeseerx.ist.psu.edu/viewdoc/download; isessionid=450713515DC7F19F8ED09AE961D4B60E. (Year: 2012).
Rozepz, “What is Google Privacy Checkup? Everything You Need to Know,” Tom's Guide web post, Apr. 26, 2018, pp. 1-11 (Year: 2018).
Salim et al, “Data Retrieval and Security using Lightweight Directory Access Protocol”, IEEE, pp. 685-688 (Year: 2009).
Santhisree, et al, “Web Usage Data Clustering Using Dbscan Algorithm and Set Similarities,” IEEE, pp. 220-224 (Year: 2010).
Sanzo et al, “Analytical Modeling of Lock-Based Concurrency Control with Arbitrary Transaction Data Access Patterns,” ACM, pp. 69-78 (Year: 2010).
Schwartz, Edward J., et al, 2010 IEEE Symposium on Security and Privacy: All You Ever Wanted to Know About Dynamic Analysis and forward Symbolic Execution (but might have been afraid to ask), Carnegie Mellon University, IEEE Computer Society, 2010, p. 317-331.
Sedinic et al, “Security Risk Management in Complex Organization,” May 29, 2015, IEEE, pp. 1331-1337 (Year: 2015).
Singh, et al, “A Metadata Catalog Service for Data Intensive Applications,” ACM, pp. 1-17 (Year: 2003).
Slezak, et al, “Brighthouse: An Analytic Data Warehouse for Ad-hoc Queries,” ACM, pp. 1337-1345 (Year: 2008).
Soceanu, et al, “Managing the Privacy and Security of eHealth Data,” May 29, 2015, IEEE, pp. 1-8 (Year: 2015).
Srinivasan et al, “Descriptive Data Analysis of File Transfer Data,” ACM, pp. 1-8 (Year: 2014).
Srivastava, Agrima, et al, Measuring Privacy Leaks in Online Social Networks, International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2013.
Stern, Joanna, “iPhone Privacy Is Broken . . . and Apps Are to Blame”, The Wall Street Journal, wsj.com, May 31, 2019.
Strodl, et al, “Personal & SOHO Archiving,” Vienna University of Technology, Vienna, Austria, JCDL '08, Jun. 16-20, 2008, Pittsburgh, Pennsylvania, USA, pp. 115-123 (Year: 2008).
Sukumar et al, “Review on Modern Data Preprocessing Techniques in Web Usage Mining (WUM),” IEEE, 2016, pp. 64-69 (Year: 2016).
Symantec, Symantex Data Loss Prevention—Discover, monitor, and protect confidential data; 2008; Symantec Corporation; http://www.mssuk.com/images/Symantec%2014552315_IRC_BR_DLP_03.09_sngl.pdf.
Tanasa et al, “Advanced Data Preprocessing for Intersites Web Usage Mining,” IEEE, Mar. 2004, pp. 59-65 (Year: 2004).
The Cookie Collective, Optanon Cookie Policy Generator, The Cookie Collective, Year 2016, http://web.archive.org/web/20160324062743/https:/optanon.com/.
Thuraisingham, “Security Issues for the Semantic Web,” Proceedings 27th Annual International Computer Software and Applications Conference, COMPSAC 2003, Dallas, TX, USA, 2003, pp. 633-638 (Year: 2003).
TRUSTe Announces General Availability of Assessment Manager for Enterprises to Streamline Data Privacy Management with Automation, PRNewswire, Mar. 4, 2015.
International Search Report, dated Feb. 11, 2022, from corresponding International Application No. PCT/US2021/053518.
Jiahao Chen et al. “Fairness Under Unawareness: Assessing Disparity when Protected Class is Unobserved,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University, Ithaca, NY 14853, Nov. 27, 2018 (Nov. 27, 2018), Section 2, Figure 2. (Year 2018).
Notice of Allowance, dated Feb. 1, 2022, from corresponding U.S. Appl. No. 17/346,509.
Notice of Allowance, dated Feb. 14, 2022, from corresponding U.S. Appl. No. 16/623,157.
Notice of Allowance, dated Feb. 22, 2022, from corresponding U.S. Appl. No. 17/535,065.
Notice of Allowance, dated Feb. 4, 2022, from corresponding U.S. Appl. No. 17/520,272.
Notice of Allowance, dated Feb. 8, 2022, from corresponding U.S. Appl. No. 17/342,153.
Notice of Allowance, dated Jan. 31, 2022, from corresponding U.S. Appl. No. 17/472,948.
Office Action, dated Feb. 16, 2022, from corresponding U.S. Appl. No. 16/872,031.
Office Action, dated Feb. 9, 2022, from corresponding U.S. Appl. No. 17/543,546.
Office Action, dated Jan. 31, 2022, from corresponding U.S. Appl. No. 17/493,290.
Sarkar et al, “Towards Enforcement of the EU GDPR: Enabling Data Erasure,” 2018 IEEE Confs on Internet of Things, Green Computing and Communications, Cyber, Physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology, Congress on Cybermatics, 2018, pp. 222-229, IEEE (Year: 2018).
Written Opinion of the International Searching Authority, dated Feb. 11, 2022, from corresponding International Application No. PCT/US2021/053518.
Written Opinion of the International Searching Authority, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055773.
Written Opinion of the International Searching Authority, dated Mar. 4, 2019, from corresponding International Application No. PCT/US2018/055774.
Written Opinion of the International Searching Authority, dated Nov. 19, 2018, from corresponding International Application No. PCT/US2018/046939.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043975.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043976.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/043977.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/044026.
Written Opinion of the International Searching Authority, dated Oct. 11, 2018, from corresponding International Application No. PCT/US2018/045240.
Written Opinion of the International Searching Authority, dated Oct. 12, 2017, from corresponding International Application No. PCT/US2017/036888.
Written Opinion of the International Searching Authority, dated Oct. 12, 2018, from corresponding International Application No. PCT/US2018/044046.
Written Opinion of the International Searching Authority, dated Oct. 16, 2018, from corresponding International Application No. PCT/US2018/045243.
Written Opinion of the International Searching Authority, dated Oct. 18, 2018, from corresponding International Application No. PCT/US2018/045249.
Written Opinion of the International Searching Authority, dated Oct. 20, 2017, from corresponding International Application No. PCT/US2017/036917.
Written Opinion of the International Searching Authority, dated Oct. 3, 2017, from corresponding International Application No. PCT/US2017/036912.
Written Opinion of the International Searching Authority, dated Sep. 1, 2017, from corresponding International Application No. PCT/US2017/036896.
Written Opinion of the International Searching Authority, dated Sep. 12, 2018, from corresponding International Application No. PCT/US2018/037504.
Abdullah et al, “The Mapping Process of Unstructured Data to the Structured Data”, ACM, pp. 151-155 (Year: 2013).
Acar, Gunes, et al, The Web Never Forgets, Computer and Communications Security, ACM, Nov. 3, 2014, pp. 674-689.
Aghasian, Erfan, et al, Scoring Users' Privacy Disclosure Across Multiple Online Social Networks,IEEE Access, Multidisciplinary Rapid Review Open Access Journal, Jul. 31, 2017, vol. 5, 2017.
Agosti et al, “Access and Exchange of Hierarchically Structured Resources on the Web with the NESTOR Framework”, IEEE, pp. 659-662 (Year: 2009).
Agrawal et al, “Securing Electronic Health Records Without Impeding the Flow of Information,” International Journal of Medical Informatics 76, 2007, pp. 471-479 (Year: 2007).
Ahmad et al, “Task-Oriented Access Model for Secure Data Sharing Over Cloud,” ACM, pp. 1-7 (Year: 2015).
Ahmad, et al, “Performance of Resource Management Algorithms for Processable Bulk Data Transfer Tasks in Grid Environments,” ACM, pp. 177-188 (Year: 2008).
Alaa et al, “Personalized Risk Scoring for Critical Care Prognosis Using Mixtures of Gaussian Processes,” Apr. 27, 2017, IEEE, vol. 65, issue 1, pp. 207-217 (Year: 2017).
Antunes et al, “Preserving Digital Data in Heterogeneous Environments”, ACM, pp. 345-348, 2009 (Year: 2009).
Ardagna, et al, “A Privacy-Aware Access Control System,” Journal of Computer Security, 16:4, pp. 369-397 (Year: 2008).
AvePoint, Automating Privacy Impact Assessments, AvePoint, Inc.
AvePoint, AvePoint Privacy Impact Assessment 1: User Guide, Cumulative Update 2, Revision E, Feb. 2015, AvePoint, Inc.
AvePoint, Installing and Configuring the APIA System, International Association of Privacy Professionals, AvePoint, Inc.
Ball, et al, “Aspects of the Computer-Based Patient Record,” Computers in Healthcare, Springer-Verlag New York Inc., pp. 1-23 (Year: 1992).
Bang et al, “Building an Effective and Efficient Continuous Web Application Security Program,” 2016 International Conference on Cyber Security Situational Awareness, Data Analytics and Assessment (CyberSA), London, 2016, pp. 1-4 (Year: 2016).
Barker, “Personalizing Access Control by Generalizing Access Control,” ACM, pp. 149-158 (Year: 2010).
Bayardo et al, “Technological Solutions for Protecting Privacy,” Computer 36.9 (2003), pp. 115-118, (Year: 2003).
Berezovskiy et al, “A framework for dynamic data source identification and orchestration on the Web”, ACM, pp. 1-8 (Year: 2010).
Bertino et al, “On Specifying Security Policies for Web Documents with an XML-based Language,” ACM, pp. 57-65 (Year: 2001).
Bhargav-Spantzel et al., Receipt Management—Transaction History based Trust Establishment, 2007, ACM, p. 82-91.
Bhuvaneswaran et al, “Redundant Parallel Data Transfer Schemes for the Grid Environment”, ACM, pp. 18 (Year: 2006).
Bieker, et al, “Privacy-Preserving Authentication Solutions—Best Practices for Implementation and EU Regulatory Perspectives,” Oct. 29, 2014, IEEE, pp. 1-10 (Year: 2014).
Binns, et al, “Data Havens, or Privacy Sans Frontieres? A Study of International Personal Data Transfers,” ACM, pp. 273-274 (Year: 2002).
Brandt et al, “Efficient Metadata Management in Large Distributed Storage Systems,” IEEE, pp. 1-9 (Year: 2003).
Byun, Ji-Won, Elisa Bertino, and Ninghui Li. “Purpose based access control of complex data for privacy protection.” Proceedings of the tenth ACM symposium on Access control models and technologies. ACM, 2005. (Year: 2005).
Carminati et al, “Enforcing Access Control Over Data Streams,” ACM, pp. 21-30 (Year: 2007).
Carpineto et al, “Automatic Assessment of Website Compliance to the European Cookie Law with CooLCheck,” Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, 2016, pp. 135-138 (Year: 2016).
Cerpzone, “How to Access Data on Data Archival Storage and Recovery System”, https://www.saj.usace.army.mil/Portals/44/docs/Environmental/Lake%20O%20Watershed/15February2017/How%20To%20Access%20Model%20Data%20on%20DASR.pdf?ver=2017-02-16-095535-633, Feb. 16, 2017.
Cha et al, “A Data-Driven Security Risk Assessment Scheme for Personal Data Protection,” IEEE, pp. 50510-50517 (Year: 2018).
Cha, et al, “Process-Oriented Approach for Validating Asset Value for Evaluating Information Security Risk,” IEEE, Aug. 31, 2009, pp. 379-385 (Year: 2009).
Chapados et al, “Scoring Models for Insurance Risk Sharing Pool Optimization,” 2008, IEEE, pp. 97-105 (Year: 2008).
Cheng, Raymond, et al, “Radiatus: A Shared-Nothing Server-Side Web Architecture,” Proceedings of the Seventh ACM Symposium on Cloud Computing, Oct. 5, 2016, pp. 237-250 (Year: 2016).
Choi et al, “Retrieval Effectiveness of Table of Contents and Subject Headings,” ACM, pp. 103-104 (Year: 2007).
Chowdhury et al, “A System Architecture for Subject-Centric Data Sharing”, ACM, pp. 1-10 (Year: 2018).
Notice of Allowance, dated Oct. 1, 2021, from corresponding U.S. Appl. No. 17/340,395.
Office Action, dated Oct. 12, 2021, from corresponding U.S. Appl. No. 17/346,509.
Restriction Requirement, dated Oct. 6, 2021, from corresponding U.S. Appl. No. 17/340,699.
Office Action, dated Aug. 24, 2017, from corresponding U.S. Appl. No. 15/169,643.
Office Action, dated Aug. 24, 2017, from corresponding U.S. Appl. No. 15/619,451.
Office Action, dated Aug. 24, 2020, from corresponding U.S. Appl. No. 16/595,327.
Office Action, dated Aug. 27, 2019, from corresponding U.S. Appl. No. 16/410,296.
Office Action, dated Aug. 29, 2017, from corresponding U.S. Appl. No. 15/619,237.
Office Action, dated Aug. 30, 2017, from corresponding U.S. Appl. No. 15/619,212.
Office Action, dated Aug. 30, 2017, from corresponding U.S. Appl. No. 15/619,382.
Office Action, dated Aug. 6, 2019, from corresponding U.S. Appl. No. 16/404,491.
Office Action, dated Aug. 6, 2020, from corresponding U.S. Appl. No. 16/862,956.
Office Action, dated Dec. 11, 2019, from corresponding U.S. Appl. No. 16/578,712.
Office Action, dated Dec. 14, 2018, from corresponding U.S. Appl. No. 16/104,393.
Office Action, dated Dec. 15, 2016, from corresponding U.S. Appl. No. 15/256,419.
Office Action, dated Dec. 16, 2019, from corresponding U.S. Appl. No. 16/563,754.
Office Action, dated Dec. 16, 2019, from corresponding U.S. Appl. No. 16/565,265.
Office Action, dated Dec. 16, 2020, from corresponding U.S. Appl. No. 17/020,275.
Office Action, dated Dec. 18, 2020, from corresponding U.S. Appl. No. 17/030,714.
Office Action, dated Dec. 19, 2019, from corresponding U.S. Appl. No. 16/410,866.
Office Action, dated Dec. 2, 2019, from corresponding U.S. Appl. No. 16/560,963.
Office Action, dated Dec. 23, 2019, from corresponding U.S. Appl. No. 16/593,639.
Office Action, dated Dec. 24, 2020, from corresponding U.S. Appl. No. 17/068,454.
Office Action, dated Dec. 3, 2018, from corresponding U.S. Appl. No. 16/055,998.
Office Action, dated Dec. 31, 2018, from corresponding U.S. Appl. No. 16/160,577.
Office Action, dated Dec. 8, 2020, from corresponding U.S. Appl. No. 17/013,758.
Office Action, dated Dec. 8, 2020, from corresponding U.S. Appl. No. 17/068,198.
Office Action, dated Feb. 10, 2021, from corresponding U.S. Appl. No. 16/862,944.
Office Action, dated Feb. 10, 2021, from corresponding U.S. Appl. No. 17/106,469.
Office Action, dated Feb. 15, 2019, from corresponding U.S. Appl. No. 16/220,899.
Office Action, dated Feb. 17, 2021, from corresponding U.S. Appl. No. 16/862,948.
Office Action, dated Feb. 18, 2021, from corresponding U.S. Appl. No. 16/862,952.
Office Action, dated Feb. 2, 2021, from corresponding U.S. Appl. No. 17/101,915.
Office Action, dated Feb. 26, 2019, from corresponding U.S. Appl. No. 16/228,250.
Office Action, dated Feb. 3, 2021, from corresponding U.S. Appl. No. 17/013,757.
Office Action, dated Feb. 5, 2020, from corresponding U.S. Appl. No. 16/586,202.
Office Action, dated Feb. 6, 2020, from corresponding U.S. Appl. No. 16/707,762.
Office Action, dated Feb. 8, 2021, from corresponding U.S. Appl. No. 17/139,650.
Office Action, dated Feb. 9, 2021, from corresponding U.S. Appl. No. 16/808,493.
Office Action, dated Jan. 18, 2019, from corresponding U.S. Appl. No. 16/055,984.
Office Action, dated Jan. 22, 2021, from corresponding U.S. Appl. No. 17/099,270.
Office Action, dated Jan. 24, 2020, from corresponding U.S. Appl. No. 16/505,426.
Office Action, dated Jan. 24, 2020, from corresponding U.S. Appl. No. 16/700,049.
Office Action, dated Jan. 27, 2020, from corresponding U.S. Appl. No. 16/656,895.
Office Action, dated Jan. 28, 2020, from corresponding U.S. Appl. No. 16/712,104.
Office Action, dated Jan. 29, 2021, from corresponding U.S. Appl. No. 17/101,106.
Office Action, dated Jan. 4, 2019, from corresponding U.S. Appl. No. 16/159,566.
Office Action, dated Jan. 4, 2019, from corresponding U.S. Appl. No. 16/159,628.
Office Action, dated Jan. 4, 2021, from corresponding U.S. Appl. No. 17/013,756.
Office Action, dated Jan. 7, 2020, from corresponding U.S. Appl. No. 16/572,182.
Office Action, dated Jul. 13, 2021, from corresponding U.S. Appl. No. 17/306,496.
Office Action, dated Jul. 15, 2021, from corresponding U.S. Appl. No. 17/020,275.
Office Action, dated Jul. 18, 2019, from corresponding U.S. Appl. No. 16/410,762.
Notice of Allowance, dated Jan. 25, 2021, from corresponding U.S. Appl. No. 16/410,336.
Notice of Allowance, dated Jan. 26, 2018, from corresponding U.S. Appl. No. 15/619,469.
Notice of Allowance, dated Jan. 29, 2020, from corresponding U.S. Appl. No. 16/278,119.
Notice of Allowance, dated Jan. 6, 2021, from corresponding U.S. Appl. No. 16/595,327.
Notice of Allowance, dated Jan. 8, 2020, from corresponding U.S. Appl. No. 16/600,879.
Notice of Allowance, dated Jul. 10, 2019, from corresponding U.S. Appl. No. 16/237,083.
Notice of Allowance, dated Jul. 10, 2019, from corresponding U.S. Appl. No. 16/403,358.
Notice of Allowance, dated Jul. 12, 2019, from corresponding U.S. Appl. No. 16/278,121.
Notice of Allowance, dated Jul. 14, 2020, from corresponding U.S. Appl. No. 16/701,043.
Notice of Allowance, dated Jul. 15, 2020, from corresponding U.S. Appl. No. 16/791,006.
Notice of Allowance, dated Jul. 16, 2020, from corresponding U.S. Appl. No. 16/901,979.
Notice of Allowance, dated Jul. 17, 2019, from corresponding U.S. Appl. No. 16/055,961.
Notice of Allowance, dated Jul. 17, 2020, from corresponding U.S. Appl. No. 16/778,709.
Notice of Allowance, dated Jul. 19, 2021, from corresponding U.S. Appl. No. 17/306,252.
Notice of Allowance, dated Jul. 21, 2020, from corresponding U.S. Appl. No. 16/557,392.
Notice of Allowance, dated Jul. 23, 2019, from corresponding U.S. Appl. No. 16/220,978.
Notice of Allowance, dated Jul. 26, 2019, from corresponding U.S. Appl. No. 16/409,673.
Notice of Allowance, dated Jul. 31, 2019, from corresponding U.S. Appl. No. 16/221,153.
Notice of Allowance, dated Jul. 8, 2021, from corresponding U.S. Appl. No. 17/201,040.
Notice of Allowance, dated Jun. 1, 2020, from corresponding U.S. Appl. No. 16/813,321.
Notice of Allowance, dated Jun. 11, 2021, from corresponding U.S. Appl. No. 16/862,948.
Notice of Allowance, dated Jun. 11, 2021, from corresponding U.S. Appl. No. 16/862,952.
Notice of Allowance, dated Jun. 11, 2021, from corresponding U.S. Appl. No. 17/216,436.
Notice of Allowance, dated Jun. 12, 2019, from corresponding U.S. Appl. No. 16/278,123.
Notice of Allowance, dated Jun. 12, 2019, from corresponding U.S. Appl. No. 16/363,454.
Notice of Allowance, dated Jun. 16, 2020, from corresponding U.S. Appl. No. 16/798,818.
Notice of Allowance, dated Jun. 17, 2020, from corresponding U.S. Appl. No. 16/656,895.
Notice of Allowance, dated Jun. 18, 2019, from corresponding U.S. Appl. No. 16/410,566.
Notice of Allowance, dated Jun. 19, 2018, from corresponding U.S. Appl. No. 15/894,890.
Notice of Allowance, dated Jun. 19, 2019, from corresponding U.S. Appl. No. 16/042,673.
Notice of Allowance, dated Jun. 19, 2019, from corresponding U.S. Appl. No. 16/055,984.
Notice of Allowance, dated Jun. 2, 2021, from corresponding U.S. Appl. No. 17/198,581.
Notice of Allowance, dated Jun. 21, 2019, from corresponding U.S. Appl. No. 16/404,439.
Notice of Allowance, dated Jun. 22, 2020, from corresponding U.S. Appl. No. 16/791,337.
Notice of Allowance, dated Jun. 27, 2018, from corresponding U.S. Appl. No. 15/882,989.
Notice of Allowance, dated Jun. 4, 2019, from corresponding U.S. Appl. No. 16/159,566.
Notice of Allowance, dated Jun. 5, 2019, from corresponding U.S. Appl. No. 16/220,899.
Notice of Allowance, dated Jun. 5, 2019, from corresponding U.S. Appl. No. 16/357,260.
Notice of Allowance, dated Jun. 6, 2018, from corresponding U.S. Appl. No. 15/875,570.
Notice of Allowance, dated Jun. 6, 2019, from corresponding U.S. Appl. No. 16/159,628.
Notice of Allowance, dated Jun. 7, 2021, from corresponding U.S. Appl. No. 17/099,270.
Notice of Allowance, dated Jun. 8, 2020, from corresponding U.S. Appl. No. 16/712,104.
Notice of Allowance, dated Mar. 1, 2018, from corresponding U.S. Appl. No. 15/853,674.
Notice of Allowance, dated Mar. 1, 2019, from corresponding U.S. Appl. No. 16/059,911.
Notice of Allowance, dated Mar. 10, 2021, from corresponding U.S. Appl. No. 16/925,628.
Notice of Allowance, dated Mar. 10, 2021, from corresponding U.S. Appl. No. 17/128,666.
Notice of Allowance, dated Mar. 13, 2019, from corresponding U.S. Appl. No. 16/055,083.
Notice of Allowance, dated Mar. 14, 2019, from corresponding U.S. Appl. No. 16/055,944.
Notice of Allowance, dated Mar. 16, 2020, from corresponding U.S. Appl. No. 16/778,704.
Notice of Allowance, dated Mar. 16, 2021, from corresponding U.S. Appl. No. 17/149,380.
Notice of Allowance, dated Mar. 17, 2020, from corresponding U.S. Appl. No. 16/560,885.
Notice of Allowance, dated Mar. 18, 2020, from corresponding U.S. Appl. No. 16/560,963.
Notice of Allowance, dated Mar. 19, 2021, from corresponding U.S. Appl. No. 17/013,757.
Notice of Allowance, dated Mar. 2, 2018, from corresponding U.S. Appl. No. 15/858,802.
Notice of Allowance, dated Mar. 24, 2020, from corresponding U.S. Appl. No. 16/552,758.
Notice of Allowance, dated Mar. 25, 2019, from corresponding U.S. Appl. No. 16/054,780.
Notice of Allowance, dated Mar. 26, 2020, from corresponding U.S. Appl. No. 16/560,889.
Notice of Allowance, dated Mar. 26, 2020, from corresponding U.S. Appl. No. 16/578,712.
Notice of Allowance, dated Mar. 27, 2019, from corresponding U.S. Appl. No. 16/226,280.
Notice of Allowance, dated Mar. 29, 2019, from corresponding U.S. Appl. No. 16/055,998.
Notice of Allowance, dated Mar. 31, 2020, from corresponding U.S. Appl. No. 16/563,744.
Notice of Allowance, dated Mar. 31, 2021, from corresponding U.S. Appl. No. 17/013,758.
Notice of Allowance, dated Mar. 31, 2021, from corresponding U.S. Appl. No. 17/162,205.
Notice of Allowance, dated May 1, 2020, from corresponding U.S. Appl. No. 16/586,202.
Notice of Allowance, dated May 11, 2020, from corresponding U.S. Appl. No. 16/786,196.
Notice of Allowance, dated May 13, 2021, from corresponding U.S. Appl. No. 17/101,915.
Notice of Allowance, dated May 19, 2020, from corresponding U.S. Appl. No. 16/505,430.
Notice of Allowance, dated May 19, 2020, from corresponding U.S. Appl. No. 16/808,496.
Notice of Allowance, dated May 20, 2020, from corresponding U.S. Appl. No. 16/707,762.
Notice of Allowance, dated May 21, 2018, from corresponding U.S. Appl. No. 15/896,790.
Notice of Allowance, dated May 26, 2021, from corresponding U.S. Appl. No. 16/808,493.
Notice of Allowance, dated May 26, 2021, from corresponding U.S. Appl. No. 16/865,874.
Notice of Allowance, dated May 26, 2021, from corresponding U.S. Appl. No. 17/199,514.
Notice of Allowance, dated May 27, 2020, from corresponding U.S. Appl. No. 16/820,208.
Notice of Allowance, dated May 27, 2021, from corresponding U.S. Appl. No. 16/927,658.
Notice of Allowance, dated May 27, 2021, from corresponding U.S. Appl. No. 17/198,757.
Notice of Allowance, dated May 28, 2019, from corresponding U.S. Appl. No. 16/277,568.
Notice of Allowance, dated May 28, 2020, from corresponding U.S. Appl. No. 16/799,279.
Notice of Allowance, dated May 28, 2021, from corresponding U.S. Appl. No. 16/862,944.
Notice of Allowance, dated May 5, 2017, from corresponding U.S. Appl. No. 15/254,901.
Notice of Allowance, dated May 5, 2020, from corresponding U.S. Appl. No. 16/563,754.
Notice of Allowance, dated May 7, 2020, from corresponding U.S. Appl. No. 16/505,426.
Notice of Allowance, dated May 7, 2021, from corresponding U.S. Appl. No. 17/194,662.
Notice of Allowance, dated Nov. 14, 2019, from corresponding U.S. Appl. No. 16/436,616.
Notice of Allowance, dated Nov. 2, 2018, from corresponding U.S. Appl. No. 16/054,762.
Notice of Allowance, dated Nov. 23, 2020, from corresponding U.S. Appl. No. 16/791,589.
Notice of Allowance, dated Nov. 24, 2020, from corresponding U.S. Appl. No. 17/027,019.
Notice of Allowance, dated Nov. 25, 2020, from corresponding U.S. Appl. No. 17/019,771.
Notice of Allowance, dated Nov. 26, 2019, from corresponding U.S. Appl. No. 16/563,735.
Notice of Allowance, dated Nov. 27, 2019, from corresponding U.S. Appl. No. 16/570,712.
Notice of Allowance, dated Nov. 27, 2019, from corresponding U.S. Appl. No. 16/577,634.
Notice of Allowance, dated Nov. 3, 2020, from corresponding U.S. Appl. No. 16/719,071.
Notice of Allowance, dated Nov. 5, 2019, from corresponding U.S. Appl. No. 16/560,965.
Notice of Allowance, dated Nov. 7, 2017, from corresponding U.S. Appl. No. 15/671,073.
Notice of Allowance, dated Nov. 8, 2018, from corresponding U.S. Appl. No. 16/042,642.
Notice of Allowance, dated Nov. 9, 2020, from corresponding U.S. Appl. No. 16/595,342.
Notice of Allowance, dated Oct. 10, 2019, from corresponding U.S. Appl. No. 16/277,539.
Notice of Allowance, dated Oct. 17, 2018, from corresponding U.S. Appl. No. 15/896,790.
Notice of Allowance, dated Oct. 17, 2018, from corresponding U.S. Appl. No. 16/054,672.
Notice of Allowance, dated Oct. 17, 2019, from corresponding U.S. Appl. No. 16/563,741.
Aman et al, “Detecting Data Tampering Attacks in Synchrophasor Networks using Time Hopping,” IEEE, pp. 1-6 (Year: 2016).
Bertino et al, “Towards Mechanisms for Detection and Prevention of Data Exfiltration by Insiders,” Mar. 22, 2011, ACM, pp. 10-19 (Year: 2011).
Bujlow et al, “Web Tracking: Mechanisms, Implications, and Defenses,” Proceedings of the IEEE, Aug. 1, 2017, vol. 5, No. 8, pp. 1476-1510 (Year: 2017).
Fan et al, “Intrusion Investigations with Data-hiding for Computer Log-file Forensics,” IEEE, pp. 1-6 (Year: 2010).
Final Office Action, dated Oct. 26, 2021, from corresponding U.S. Appl. No. 17/306,496.
Final Office Action, dated Oct. 28, 2021, from corresponding U.S. Appl. No. 17/234,205.
Final Office Action, dated Oct. 29, 2021, from corresponding U.S. Appl. No. 17/020,275.
Gonçalves et al, “The XML Log Standard for Digital Libraries: Analysis, Evolution, and Deployment,” IEEE, pp. 312-314 (Year: 2003).
International Search Report, dated Nov. 12, 2021, from corresponding International Application No. PCT/US2021/043481.
International Search Report, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/040893.
International Search Report, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/044910.
Iordanou et al, “Tracing Cross Border Web Tracking,” Oct. 31, 2018, pp. 329-342, ACM (Year: 2018).
Notice of Allowance, dated Nov. 16, 2021, from corresponding U.S. Appl. No. 17/491,871.
Notice of Allowance, dated Nov. 22, 2021, from corresponding U.S. Appl. No. 17/383,889.
Notice of Allowance, dated Oct. 22, 2021, from corresponding U.S. Appl. No. 17/346,847.
Office Action, dated Nov. 10, 2021, from corresponding U.S. Appl. No. 17/380,485.
Office Action, dated Nov. 10, 2021, from corresponding U.S. Appl. No. 17/409,999.
Office Action, dated Nov. 12, 2021, from corresponding U.S. Appl. No. 17/346,586.
Office Action, dated Nov. 12, 2021, from corresponding U.S. Appl. No. 17/373,444.
Office Action, dated Nov. 16, 2021, from corresponding U.S. Appl. No. 17/370,650.
Office Action, dated Nov. 16, 2021, from corresponding U.S. Appl. No. 17/486,350.
Office Action, dated Nov. 23, 2021, from corresponding U.S. Appl. No. 17/013,756.
Office Action, dated Nov. 26, 2021, from corresponding U.S. Appl. No. 16/925,550.
Office Action, dated Nov. 4, 2021, from corresponding U.S. Appl. No. 17/491,906.
Office Action, dated Nov. 8, 2021, from corresponding U.S. Appl. No. 16/872,130.
Office Action, dated Oct. 15, 2021, from corresponding U.S. Appl. No. 16/908,081.
Restriction Requirement, dated Nov. 10, 2021, from corresponding U.S. Appl. No. 17/366,754.
Roesner et al, “Detecting and Defending Against Third-Party Tracking on the Web,” 9th USENIX Symposium on Networked Systems Design and Implementation, Apr. 11, 2013, pp. 1-14, ACM (Year: 2013).
Van Eijk et al, “The Impact of User Location on Cookie Notices (Inside and Outside of the European Union,” IEEE Security & Privacy Workshop on Technology and Consumer Protection (CONPRO '19), Jan. 1, 2019 (Year: 2019).
Written Opinion of the International Searching Authority, dated Nov. 12, 2021, from corresponding International Application No. PCT/US2021/043481.
Written Opinion of the International Searching Authority, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/040893.
Written Opinion of the International Searching Authority, dated Nov. 3, 2021, from corresponding International Application No. PCT/US2021/044910.
Bansal et al., “Integrating Big Data: A Semantic Extract-Transform-Load Framework,” IEEE, pp. 42-50 (Year: 2015).
Bao et al., “Performance Modeling and Workflow Scheduling of Microservice-Based Applications in Clouds,” IEEE Transactions on Parallel and Distributed Systems, vol. 30, No. 9, Sep. 2019, pp. 2101-2116 (Year: 2019).
Bindschaedler et al., “Privacy Through Fake Yet Semantically Real Traces,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, May 27, 2015 (Year: 2015).
Castro et al., “Creating Lightweight Ontologies for Dataset Description,” IEEE, pp. 1-4 (Year: 2014).
Ex Parte Quayle Action, dated May 10, 2022, from corresponding U.S. Appl. No. 17/668,714.
Final Office Action, dated May 12, 2022, from corresponding U.S. Appl. No. 17/499,624.
Final Office Action, dated May 16, 2022, from corresponding U.S. Appl. No. 17/480,377.
Final Office Action, dated May 2, 2022, from corresponding U.S. Appl. No. 17/499,595.
Final Office Action, dated May 24, 2022, from corresponding U.S. Appl. No. 17/499,582.
International Search Report, dated May 12, 2022, from corresponding International Application No. PCT/US2022/015929.
International Search Report, dated May 17, 2022, from corresponding International Application No. PCT/US2022/015241.
International Search Report, dated May 19, 2022, from corresponding International Application No. PCT/US2022/015637.
Lasierra et al., “Data Management in Home Scenarios Using an Autonomic Ontology-Based Approach,” IEEE, pp. 94-99 (Year: 2012).
Lenzerini et al., “Ontology-based Data Management,” ACM, pp. 5-6 (Year: 2011).
Niu, et al., “Achieving Data Truthfulness and Privacy Preservation in Data Markets”, IEEE Transactions On Knowledge and Data Engineering, IEEE Service Centre, Los Alamitos, CA, US, vol. 31, No. 1, Jan. 1, 2019, pp. 105-119 (Year 2019).
Notice of Allowance, dated May 18, 2022, from corresponding U.S. Appl. No. 17/670,354.
Notice of Allowance, dated May 25, 2022, from corresponding U.S. Appl. No. 16/872,031.
Notice of Allowance, dated May 6, 2022, from corresponding U.S. Appl. No. 17/666,886.
Office Action, dated May 12, 2022, from corresponding U.S. Appl. No. 17/509,974.
Office Action, dated May 16, 2022, from corresponding U.S. Appl. No. 17/679,750.
Office Action, dated May 24, 2022, from corresponding U.S. Appl. No. 17/674,187.
Office Action, dated May 9, 2022, from corresponding U.S. Appl. No. 16/840,943.
Preuveneers et al., “Access Control with Delegated Authorization Policy Evaluation for Data-Driven Microservice Workflows,” Future Internet 2017, MDPI, pp. 1-21 (Year: 2017).
Thomas et al., “MooM—A Prototype Framework for Management of Ontology Mappings,” IEEE, pp. 548-555 (Year: 2011).
Written Opinion of the International Searching Authority, dated May 12, 2022, from corresponding International Application No. PCT/US2022/015929.
Written Opinion of the International Searching Authority, dated May 17, 2022, from corresponding International Application No. PCT/US2022/015241.
Written Opinion of the International Searching Authority, dated May 19, 2022, from corresponding International Application No. PCT/US2022/015637.
Choi et al., “A Survey on Ontology Mapping,” ACM, pp. 34-41 (Year: 2006).
Cui et al., “Domain Ontology Management Environment,” IEEE, pp. 1-9 (Year: 2000).
Falbo et al., “An Ontological Approach to Domain Engineering,” ACM, pp. 351-358 (Year: 2002).
International Search Report, dated Jun. 1, 2022, from corresponding International Application No. PCT/US2022/016930.
International Search Report, dated Jun. 22, 2022, from corresponding International Application No. PCT/US2022/019358.
Nemec et al., “Assessment of Query Execution Performance Using Selected Business Intelligence Tools and Experimental Agile Oriented Data Modeling Approach,” Sep. 16, 2015, IEEE, pp. 1327-1333. (Year: 2015).
Notice of Allowance, dated Jun. 14, 2022, from corresponding U.S. Appl. No. 17/679,734.
Notice of Allowance, dated Jun. 2, 2022, from corresponding U.S. Appl. No. 17/493,290.
Notice of Allowance, dated Jun. 23, 2022, from corresponding U.S. Appl. No. 17/588,645.
Office Action, dated Jun. 14, 2022, from corresponding U.S. Appl. No. 17/346,586.
Office Action, dated Jun. 16, 2022, from corresponding U.S. Appl. No. 17/689,683.
Ozdikis et al., “Tool Support for Transformation from an OWL Ontology to an HLA Object Model,” ACM, pp. 1-6 (Year: 2010).
Vukovic et al., “Managing Enterprise IT Systems Using Online Communities,” Jul. 9, 2011, IEEE, pp. 552-559. (Year 2011).
Wong et al., “Ontology Mapping for the Interoperability Problem in Network Management,” IEEE, pp. 2058-2068 (Year: 2005).
Written Opinion of the International Searching Authority, dated Jun. 1, 2022, from corresponding International Application No. PCT/US2022/016930.
Written Opinion of the International Searching Authority, dated Jun. 22, 2022, from corresponding International Application No. PCT/US2022/019358.
Cruz et al., “Interactive User Feedback in Ontology Matching Using Signature Vectors,” IEEE, pp. 1321-1324 (Year 2012).
Cudre-Mauroux, “ESWC 2008 Ph.D. Symposium,” The ESWC 2008 PhD. Symposium is sponsored by the Okkam project (http://fp7.okkam.org/), MIT, pp. 1-92 (Year: 2008).
Dowling, “Auditing Global HR Compliance,” published May 23, 2014, retrieved from https://www.shrm.org/resourcesandtools/hr-topics/ global-hr/pages/auditing-global-hr-compliance.aspx Jul. 2, 2022 (Year: 2014).
Neil et al., “Downsizing and Rightsizing,” https://web.archive.org/web/20130523153311/https://www.referenceforbusiness.com/management/De-Ele/Downsizing-and-Rightsizing.html (Year: 2013).
Notice of Allowance, dated Jul. 20, 2022, from corresponding U.S. Appl. No. 16/938,509.
Notice of Allowance, dated Jul. 7, 2022, from corresponding U.S. Appl. No. 17/571,871.
Notice of Allowance, dated Jun. 29, 2022, from corresponding U.S. Appl. No. 17/675,118.
Office Action, dated Aug. 2, 2022, from corresponding U.S. Appl. No. 17/670,354.
Office Action, dated Aug. 4, 2022, from corresponding U.S. Appl. No. 17/828,953.

Related Publications (1)

	Number	Date	Country
	20220043935 A1	Feb 2022	US

Provisional Applications (1)

	Number	Date	Country
	63061894	Aug 2020	US

Data processing systems and methods for automatically redacting unstructured data from a data subject access request

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

CPC

International Classifications

Abstract