US 9,202,249 B1Grant
Data item clustering and analysis
Issue Date:2015-12-01
•14 Claims
•28 Drawing Sheets
Abstract
Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyzes (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
Metadata
Assignee
- Palantir Technologies Inc.
Inventors
- David Cohen
- Jason Ma
- Bing Jie Fu
- Ilya Nepomnyashchiy
- Steven Berler
- Alex Smaliy
- Jack Grossman
- James Thompson
- Julia Boortz
- Matthew Sprague
- Parvathy Menon
- Michael Kross
- Michael Harris
- Adam Borochoff
Application Information
Application Number:US 14/473,552
Filing Date:2014-08-29
Priority Date:2014-07-03
Art Unit:3691
Classifications
IPC:
G06Q40/00
Patent Drawings (28 sheets)
Description
Cross-Reference to Related Applications
[0001] Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57.
[0002] This application claims benefit of U.S. Provisional Patent Application No. 62/020,876, filed Jul. 3, 2014, titled “DATA ITEM CLUSTERING AND ANALYSIS.” The entire disclosure of each of the above items is hereby made part of this specification as if set forth fully herein and incorporated by reference for all purposes, for all that it contains.
[0003] This application is also related to the following U.S. Patent Applications:
[0004]
The entire disclosure of each of the above items is hereby made part of this specification as if set forth fully herein and incorporated by reference for all purposes, for all that it contains.
| Ser. No. | Title | Filed |
|---|---|---|
| 13/968,265 | GENERATING DATA | Mar. 15, 2013 |
| CLUSTERS WITH | ||
| CUSTOMIZABLE | ||
| ANALYSIS STRATEGIES | ||
| 13/968,213 | PRIORITIZING DATA | Mar. 15, 2013 |
| CLUSTERS WITH | ||
| CUSTOMIZABLE SCORING | ||
| STRATEGIES | ||
| 14/139,628 | TAX DATA CLUSTERING | Dec. 23, 2013 |
| 14/139,603 | MALWARE DATA | Dec. 23, 2013 |
| CLUSTERING | ||
| 14/139,713 | USER-AGENT DATA | Dec. 23, 2013 |
| CLUSTERING | ||
| 14/139,640 | TREND DATA | Dec. 23, 2013 |
| CLUSTERING | ||
| 14/251,485 | FRAUD DETECTION AND | Apr. 11, 2014 |
| SCORING | ||
| 14/278,963 | CLUSTERING DATA | |
| BASED ON INDICATIONS | May 15, 2014 | |
| OF FINANCIAL | ||
| MALFEASANCE | ||
| 62/036,519 | MONEY LAUNDERING | Aug. 12, 2014 |
| DETECTION AND | ||
| SCORING | ||
| 14/473,860 | MALWARE DATA ITEM | Aug. 29, 2014 |
| ANALYSIS | ||
The entire disclosure of each of the above items is hereby made part of this specification as if set forth fully herein and incorporated by reference for all purposes, for all that it contains.
Background
[0005] Embodiments of the present disclosure generally related to automatic generation of memory-efficient clustered data structures and automatic analysis of those generated clustered data structures.
[0006] In a fraud investigation an analyst may have to make decisions regarding selection of electronic data items within an electronic collection of data. Such a collection of data may include a large number of data items that may or may not be related to one another, and which may be stored in an electronic data store or memory. For example, such a collection of data may include hundreds of thousands, millions, tens of millions, hundreds of millions, or even billions of data items, and may consume significant storage and/or memory. Determination and selection of relevant data items within such a collection of data may be extremely difficult for the analyst. Further, processing of such a large collection of data (for example, as an analyst uses a computer to sift and/or search through huge numbers of data items) may be extremely inefficient and consume significant processing and/or memory resources.
Summary
[0007] The systems, methods, and devices described herein each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure, several non-limiting features will now be discussed briefly.
[0008] Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as “data item clusters,” “data clusters,” or simply “clusters”) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “conclusions” or “summaries”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures. The interactive user interface may be updated based on the scoring, directing the human analyst to more critical data clusters (for example, data clusters more likely to be associated with fraud) in response to the analyst's inputs.
[0009] As described below, data clusters may include one or more data items. A data item may include any data, information, or things, such as a person, a place, an organization, an account, a computer, an activity, and event, and/or the like. In an example application, a human analyst may be tasked with deciding whether an account data item represents a fraudulent bank account. However, an individual data item oftentimes includes insufficient information for the analyst to make such decisions. Rather, the analyst may make better decisions based upon a collection of related data items. For instance, two financial transactions may be related by an identical account identifier or two accounts belonging to one customer may be related by an identical customer identifier or other attribute (e.g., a shared phone number or address). Some currently available systems assist the analyst by identifying data items that are directly related to an initial data item. For example, the analyst could initiate an investigation with a single suspicious data item or “seed,” such as a fraudulent credit card account. If the analyst examined this data item by itself, then the analyst would not observe any suspicious characteristics. However, the analyst could request a list of data items related to the seed by a shared attribute, such as a customer identifier. In doing so, the analyst could discover an additional data item, such as an additional credit card account, which relates to the original fraudulent account because of a shared customer identifier. The analyst could then mark the additional credit card account as potentially fraudulent, based upon the relationship of the shared customer identifier.
[0010] Although these currently available systems can be helpful in discovering related data items, they typically require the analyst to manually repeat the same series of searches for many investigations. Repeating the same investigation process consumes time and resources, such that there are oftentimes more investigations than can be performed. Thus, analysts typically prioritize investigations based upon the characteristics of the seeds. However, there may be insignificant differences between the seeds, so the analyst may not be able to determine the correct priority for investigations. For instance, the analyst could have to choose between two potential investigations based upon separate fraudulent credit card accounts. One investigation could reveal more potentially fraudulent credit card accounts than the other, and therefore could be more important to perform. Yet, the characteristics of the two original credit card accounts could be similar, so the analyst would not be able to choose the more important investigation. Without more information, prioritizing investigations, and evaluating data items, is difficult and error prone.
[0011] In contrast with these currently available systems, and as described above, according to various embodiments the data analysis system of the present disclosure automatically creates clusters of related data items, generates human-readable conclusions of the clusters, scores those clusters, and generates an interactive user interface in which, in response to inputs from the analyst, information related to the clusters may be efficiently provided to the analyst. Accordingly, the analyst may be enabled to efficiently evaluate the clusters.
[0012] Generation of the memory-efficient clustered data structures may be accomplished by automatic selection of an initial data item of interest (also referred to herein as a “seed”), adding of the initial data item to the memory-efficient clustered data structure (or, alternatively, designating the initial data item as the clustered data structure, or an initial iteration of the clustered data structure), and determining and adding one or more related data items to the cluster. In various embodiments, a generated cluster may include far fewer data items than the collection of data described above, and the data items included in the cluster may only include those data items that are relevant to a particular investigation (for example, a fraud investigation). Accordingly, in an embodiment, processing of the generated cluster may be highly efficient as compared to the collection of data described above. This may be because, for example, a given fraud investigation by an analyst (for example, as the analyst sifts and/or searches through data items of a cluster) may only require storage in memory of a single cluster data structure. Further, a number of data items in a cluster may be several orders of magnitude smaller than in the entire electronic collection of data described above because only data items related to each other are included in the cluster.
[0013] Additionally, the automated analysis and scoring of clusters (as mentioned above) may enable highly efficient evaluation of the various data clusters by a human analyst. For example, the interactive user interface is generated so as to enable an analyst to quickly view critical data clusters (as determined by the automated scoring), and then in response to analyst inputs, view and interact with the generated information (including, for example, the human-readable conclusions) associated with the clusters. In response to user inputs the user interface may be updated to display raw data associated with each of the generated clusters if the analyst desires to dive deeper into data associated with a given cluster.
[0014] In various embodiments, seeds may be automatically selected/generated according to various seed determination strategies, and clusters of related data items may be generated based on those seeds and according to cluster generation strategies (also referred to herein as “cluster strategies”). Also, as mentioned above, the system may generate a score, multiple scores, and/or metascores for each generated cluster, and may optionally rank or prioritize the generated clusters based on the generated scores and/or metascores. High priority clusters may be of greater interest to an analyst as they may contain related data items that meet particular criteria related to the analyst's investigation. In an embodiment, the system may enable an analyst to advantageously start an investigation with a prioritized cluster including many related data items rather than a single randomly selected data item. Further, as described above, the cluster prioritization and summary generation may enable the processing requirements of the analyst's investigation to be highly efficient as compared to processing of the huge collection of data described above. As mentioned above, this is because, for example, a given investigation by an analyst may only require storage in memory of a limited number of data items associated with a small number of clusters, and further, a number of data items in a cluster may be several orders of magnitude smaller than in the entire electronic collection of data described above because only data items related to each other are included in the cluster. Further, an analyst may not need to view many (or, alternatively, any) data items associated with a cluster to evaluate the cluster, but rather may evaluate the cluster based on the automatically generated cluster information.
[0015] According to an embodiment, a computer system comprises: one or more computer readable storage devices configured to store: a plurality of computer executable instructions; a plurality of data cluster types, each data cluster type associated with a data clustering strategy and a plurality of data cluster analysis rules; and a plurality of data clusters, each data cluster associated with a data cluster type and previously generated according to the associated respective data clustering strategy, each data cluster further including one or more data items and associated metadata; and one or more hardware computer processors in communication with the one or more computer readable storage devices and configured to execute the plurality of computer executable instructions in order to cause the computer system to, for each particular data cluster of the plurality of data clusters: access the particular data cluster from the one or more computer readable storage devices; determine the data cluster type associated with the particular data cluster; analyze the particular data cluster based on the data cluster analysis rules associated with the determined data cluster type; determine an alert score for the particular data cluster based on the analysis of the particular data cluster; and generate one or more human-readable conclusions regarding the particular data cluster.
[0016] According to another embodiment, the alert score indicates a degree of correlation between characteristics of the particular data cluster and the accessed data cluster analysis rules.
[0017] According to yet another embodiment, the degree of correlation is based on both an assessment of risk associated with the particular data cluster and a confidence level in accuracy of the assessment of risk.
[0018] According to another embodiment, a relatively higher alert score indicates a data cluster that is relatively more important for a human analyst to evaluate, and a relatively lower alert score indicates a data cluster that is relatively less important for the human analyst to evaluate.
[0019] According to yet another embodiment, each alert score for respective data clusters is assigned to a category indicating a high degree of correlation, a medium degree of correlation, or a low degree of correlation.
[0020] According to another embodiment, the high degree of correlation is associated with a first color, the medium degree of correlation is associated with a second color, and the low degree of correlation is associated with a third color.
[0021] According to yet another embodiment, the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions in order to cause the computer system to: for each particular data cluster of the plurality of data clusters: generate an alert, the alert comprising the alert score, the one or more human-readable conclusions, the one or more data items associated with the cluster, and the metadata associated with each of the one or more data items.
[0022] According to another embodiment, the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions in order to cause the computer system to: generate a user interface including a list of user-selectable alert indicators, an alert indicator being provided for each of the generated alerts, each of the alert indicators providing a summary of information associated with respective generated alerts.
[0023] According to yet another embodiment, the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions in order to cause the computer system to: in response to a selection of an alert indicator by a human analyst: generate an alert display, the alert display including at least an indication of the alert score and a list of the one or more human-readable conclusions.
[0024] According to another embodiment, the alert display further includes a table of information associated with the one or more data items and associated metadata of the particular data cluster, and wherein the table of information includes a mixture of information of various types.
[0025] According to yet another embodiment, the table of information includes one or more user interface controls selectable by a human analysis in order to filter according information type and/or time period.
[0026] According to another embodiment, the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions in order to cause the computing system to: for each particular data cluster of the plurality of data clusters: determine whether any other data cluster having a data cluster type different from the data cluster type of the particular data cluster is associated with a data item that is also associated with the particular data cluster.
[0027] According to yet another embodiment, the alert display further indicates and provides a link to any of the other data clusters having the data cluster type different from the data cluster type of the particular data cluster and determined to be associated with the data item that is also associated with the particular data cluster of the alert display.
[0028] According to another embodiment, a notification is provided to a human analyst via the alert display when the data cluster associated with the alert display has been regenerated such that the data cluster is changed.
[0029] In various embodiments, computer-implemented methods are disclosed in which, under control of one or more hardware computing devices configured with specific computer executable instructions, one or more aspects of the above-described embodiments are implemented and/or performed.
[0030] In various embodiments, a non-transitory computer-readable storage medium storing software instructions is disclosed that, in response to execution by a computer system having one or more hardware processors, configure the computer system to perform operations comprising one or more aspects of the above-described embodiments.
[0031] Advantageously, according to various embodiments, the disclosed techniques provide a more effective starting point and/or summary for an investigation of data items of various types. An analyst may be able to start an investigation from a cluster of related data items instead of an individual data item, which may reduce the amount of time and effort required to perform the investigation. The disclosed techniques may also, according to various embodiments, provide a prioritization of multiple clusters, and human-readable conclusions related to each of those clusters. For example, the analyst may also be able to start the investigation from a high priority cluster, which may allow the analyst to focus on the most important investigations, and may quickly evaluate that cluster based on the human-readable conclusions generated by the system. In each case, the processing and memory requirements of such an investigation may be significantly reduced due to the creation and use of highly efficient cluster data structures of related data items.
Brief Description of the Drawings
[0032] The following drawings and the associated descriptions are provided to illustrate embodiments of the present disclosure and do not limit the scope of the claims. Aspects and many of the attendant advantages of this disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:
[0033] FIG. 1 is a block diagram illustrating an example data analysis system, according to an embodiment of the present disclosure.
[0034] FIG. 2 is a block diagram illustrating an example generation of clusters by the data analysis system, according to an embodiment of the present disclosure.
[0035] FIGS. 3A-3C illustrate an example growth of a cluster of related data items, according to an embodiment of the present disclosure.
[0036] FIG. 4 illustrates an example ranking of clusters by the data analysis system, according to an embodiment of the present disclosure.
[0037] FIG. 5 illustrates an example cluster analysis user interface, according to an embodiment of the present disclosure.
[0038] FIG. 6 is a flowchart of an example method of generating clusters, according to an embodiment of the present disclosure.
[0039] FIG. 7 is a flowchart of an example method of scoring clusters, according to an embodiment of the present disclosure.
[0040] FIG. 8 illustrates components of an illustrative server computing system, according to an embodiment of the present disclosure.
[0041] FIG. 9 is a flowchart of an example generalized method of the data analysis system, according to an embodiment of the present disclosure.
Cluster Analysis
[0042] FIG. 10A is a flowchart for an example method of data cluster analysis, according to an embodiment of the present disclosure.
[0043] FIG. 10B is a flowchart of an example method of alert generation, according to an embodiment of the present disclosure.
[0044] FIG. 10C illustrates various example conclusions associated with various types of data clusters, according to various embodiments of the present disclosure.
[0045] FIGS. 11-20 illustrate example data cluster analysis user interfaces of the data analysis system, according to embodiments of the present disclosure.
[0046] FIG. 21 is a flowchart of an example method of linking related alerts or data clusters, according to an embodiment of the present disclosure.
[0047] FIG. 22 illustrates an example data cluster analysis user interface in which related alerts or data clusters are linked to one another, according to an embodiment of the present disclosure.
[0048] FIG. 23 is a flowchart of an example method of updating alerts in response to cluster regeneration, according to an embodiment of the present disclosure.
Detailed Description
[0049] Although certain preferred embodiments and examples are disclosed below, inventive subject matter extends beyond the specifically disclosed embodiments to other alternative embodiments and/or uses and to modifications and equivalents thereof. Thus, the scope of the claims appended hereto is not limited by any of the particular embodiments described below. For example, in any method or process disclosed herein, the acts or operations of the method or process may be performed in any suitable sequence and are not necessarily limited to any particular disclosed sequence. Various operations may be described as multiple discrete operations in turn, in a manner that may be helpful in understanding certain embodiments; however, the order of description should not be construed to imply that these operations are order dependent. Additionally, the structures, systems, and/or devices described herein may be embodied as integrated components or as separate components. For purposes of comparing various embodiments, certain aspects and advantages of these embodiments are described. Not necessarily all such aspects or advantages are achieved by any particular embodiment. Thus, for example, various embodiments may be carried out in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other aspects or advantages as may also be taught or suggested herein.
Terms
[0050] In order to facilitate an understanding of the systems and methods discussed herein, a number of terms are defined below. The terms defined below, as well as other terms used herein, should be construed broadly to include, without limitation, the provided definitions, the ordinary and customary meanings of the terms, and/or any other implied meanings for the respective terms. Thus, the definitions below do not limit the meaning of these terms, but only provide example definitions.
[0051] Ontology: Stored information that provides a data model for storage of data in one or more databases. For example, the stored data may comprise definitions for object types and property types for data in a database, and how objects and properties may be related.
[0052] Database: A broad term for any data structure for storing and/or organizing data, including, but not limited to, relational databases (for example, Oracle database, mySQL database, and the like), spreadsheets, XML files, and text file, among others. The various terms “database,” “data store,” and “data source” may be used interchangeably in the present disclosure.
[0053] Data Item (Item), Data Object (Object), or Data Entity (Entity): A data container for information representing specific things in the world that have a number of definable properties. For example, a data item may represent an item such as a person, a place, an organization, an account, a computer, an activity, a market instrument, or other noun. A data item may represent an event that happens at a point in time or for a duration. A data item may represent a document or other unstructured data source such as an e-mail message, a news report, or a written paper or article. Each data item may be associated with a unique identifier that uniquely identifies the data item. The data item's attributes (for example, metadata about the data item) may be represented in one or more properties. The terms “data item,” “data object,” “data entity,” “item,” “object,” and “entity” may be used interchangeably and/or synonymously in the present disclosure.
[0054] Item (or Entity or Object) Type: Type of a data item (for example, Person, Event, or Document). Data item types may be defined by an ontology and may be modified or updated to include additional data item types. An data item definition (for example, in an ontology) may include how the data item is related to other data items, such as being a sub-data item type of another data item type (for example, an agent may be a sub-data item of a person data item type), and the properties the data item type may have.
[0055] Properties: Also referred to as “metadata,” includes attributes of a data item that represent individual data items. At a minimum, each property of a data item has a property type and a value or values. Properties/metadata associated with data items may include any information relevant to that object. For example, properties associated with a person data item may include a name (for example, John Doe), an address (for example, 123 S. Orange Street), and/or a phone number (for example, 800-0000), among other properties. In another example, metadata associated with a computer data item may include a list of users (for example, user1, user 2, and the like), and/or an IP (internet protocol) address, among other properties.
[0056] Property Type: The type of data a property is, such as a string, an integer, or a double. Property types may include complex property types, such as a series data values associated with timed ticks (for example, a time series), and the like.
[0057] Property Value: The value associated with a property, which is of the type indicated in the property type associated with the property. A property may have multiple values.
[0058] Link: A connection between two data objects, based on, for example, a relationship, an event, and/or matching properties. Links may be directional, such as one representing a payment from person A to B, or bidirectional.
[0059] Link Set: Set of multiple links that are shared between two or more data objects.
[0060] Seed: One or more data items that may be used as a basis, or starting point, for generating a cluster. A seed may be generated, determined, and/or selected from one or more sets of data items according to a seed generation strategy. For example, seeds may be generated from data items accessed from various databases and data sources including, for example, databases maintained by financial institutions, government items, private items, public items, and/or publicly available data sources.
[0061] Cluster: A group or set of one or more related data items/objects/items. A cluster may be generated, determined, and/or selected from one or more sets of data items according to a cluster generation strategy. A cluster may further be generated, determined, and/or selected based on a seed. For example, a seed may comprise an initial data item of a cluster. Data items related to the seed may be determined and added to the cluster. Further, additional data items related to any clustered data item may also be added to the cluster iteratively as indicated by a cluster generation strategy. Data items may be related by any common and/or similar properties, metadata, types, relationships, and/or the like. Clusters may also be referred to herein as “clustered data structures,” “data item clusters,” and “data clusters.”
[0062] Seed/Cluster Generation Strategy (also referred to herein as Seed/Cluster Generation Rule(s)): Seed and cluster generation strategies/rules indicate processes, methods, and/or strategies for generating seeds and generating clusters, respectively. For example, a seed generation strategy may indicate that data items having a particular property (for example, data items that are credit card accounts) are to be designated as seeds. In another example, a cluster generation strategy may indicate that data items having particular properties in common with (or similar to) a seed or other data item in a cluster are to be added to the cluster. Seed and/or cluster generation strategies may specify particular searches and/or rule matches to perform on one or more sets of data items. Execution of a seed and/or cluster generation strategy may produce layers of related data items. Additionally, a seed/cluster generation strategy/rule may include multiple strategies, sub-strategies, rules, and/or sub-rules.
Overview
[0063] This disclosure relates to a data analysis system (also referred to herein as the “system”) in which memory-efficient clustered data structures (also referred to herein as “clusters”) of related data items may be automatically generated and analyzed, and results may be provided for interaction from an analyst, for example. Generation of clusters may begin by automatic generation, determination, and/or selection of an initial data item of interest, called a “seed.” As mentioned above, a data item may include any data, information, or things, such as a person, a place, an organization, an account, a computer, an activity, and event, and/or the like. Seeds may be automatically selected/generated according to various seed determination strategies, and clusters of related data items may be generated based on those seeds and according to cluster generation strategies (also referred to herein as “cluster strategies,” “clustering strategies,” and/or “cluster generation rules”). Seeds and related data items may be accessed from various databases and data sources including, for example, databases maintained by financial institutions, government entities, private entities, public entities, and/or publicly available data sources. Such databases and data sources may include a variety of information and data, such as, for example, personal information, financial information, tax-related information, computer network-related data, and/or computer-related activity data, among others. Further, the databases and data sources may include various relationships that link and/or associate data items with one another. Various data items and relationships may be stored across different systems controlled by different items and/or institutions. According to various embodiments, the data analysis system may bring together data from multiple data sources in order to build clusters.
[0064] The automated analysis of the clusters may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also disclose automated scoring of the clustered data structures by the data analysis system. The interactive user interface may be updated based on the scoring, directing the human analyst to more critical data clusters (for example, data clusters more likely to be associated with fraud) in response to the analyst's inputs.
[0065] In various embodiments, the data analysis system may enable an analyst (and/or other user) to efficiently perform analysis and investigations of various data clusters and related data items. For example, the system may enable an analyst to perform various financial and security investigations of data clusters of related data items. In such an investigation, the system may automatically create clusters of related data items, generate human-readable conclusions of the clusters, score those clusters, and generates an interactive user interface in which, in response to inputs from the analyst, information related to the clusters may be efficiently provided to the analyst. For example, a credit card account may be a seed that is linked by the system to various data items including, for example, customer identifiers and/or phone numbers associated with the credit card account. Further, the system may link, for example, various other credit card accounts related to the customer identifiers, to the seed credit card account. Accordingly, in various embodiments, the system may automatically cluster of various layers of data items related to the seed credit card account. One or more rules or criteria may then automatically be applied to the cluster so as to generate one or more compact, human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters. The human-readable analyses may comprise phrases or sentences that provide highly relevant, and easily evaluated (by a human), information regarding the data in the cluster (for example, data items and metadata). For example, a conclusion in the current example may be “4 customer identifiers are associated with the current cluster,” or “The 2 credit card accounts in the cluster have been used in 3 different countries.” Such conclusions in an investigation may, in an embodiment, enable the analyst to determine a likelihood of fraudulent activity associated with the cluster. Further, the data items of the cluster may then be linked to possible fraudulent activity. For example, the seed credit card account and the additional credit card accounts may all be linked to the potentially fraudulent activity. As mentioned above, in such an investigation the analyst may efficiently determine likely fraud, as well as discover relationships between the additional credit card accounts and the seed credit card account through several layers of related data items. Such techniques, enabled by various embodiments of the data analysis system, may be particularly valuable for investigations in which relationships between data items may include several layers, and in which such relationships may be otherwise very difficult or impossible to manually identify.
[0066] In various embodiments, the data analysis system may automatically generate, or determine, seeds based on a seed generation strategy (also referred to as “seed generation rules”). For example, for a particular set of data items, the data analysis system may automatically generate, based on a seed generation strategy, seeds by designating particular data items (and/or groups of data items) as seeds. Examples of various seed generation strategies are described below.
[0067] Further, in various embodiments, the data analysis system may automatically discover data items related to a seed, and store the resulting relationships and related data items together in a “cluster” (or, alternatively, designating the seed as the initial cluster (or initial data item of the cluster) and adding the discovered data items of the cluster). A cluster generation strategy may specify particular searches to perform at each step of an investigation, or cluster generation, process. Such searches may produce layers of related data items to add to the cluster. Further, according to an embodiment, multiple clusters may be merged and/or collapsed into a single cluster when the multiple clusters share one or more common data items and/or properties. Thus, according to an embodiment, an analyst may start an investigation with the resulting cluster, rather than the seed alone. Starting with the cluster, and associated human-readable conclusions, the analyst may form opinions regarding the related data items, conduct further analysis of the related data items, and/or may query for additional related data items.
[0068] According to various embodiments, the data analysis system may further generate various “cluster scores.” Cluster scores may include scores based on various characteristics and/or attributes associated with the cluster and/or the various data items of the cluster. In various embodiments, the data analysis system may also generate “cluster metascores” which may include, for example, an overall cluster score. Cluster metascores may, for example, be based on a combination of cluster scores of a cluster associated with a seed. In an embodiment, the system may further generate “alert scores.” Alert scores may be the same as, similar to, and/or based on any of the cluster scores, metascores, and/or conclusions described herein. In an embodiment, the alert score may be a metascore, and may be one of multiple values corresponding to, for example, a high alert, a medium alert, or a low alert. The alert score is described in further detail below. Further, cluster scores may be based on one or more generated conclusions related to the cluster, and/or the conclusions may be generated based on cluster scores.
[0069] Further, in various embodiments, for a particular set of data items, multiple clusters may be generated by the data analysis system. For example, the data analysis system may generate multiple seeds according to a seed generation strategy, and then multiple clusters based on those seeds (and based on a cluster generation strategy). In such embodiments, the data analysis system may prioritize the multiple generated clusters based upon cluster scores and/or cluster metascores. In an embodiment, the data analysis system may provide a user interface including a display of human-readable conclusions of the clusters, cluster scores, cluster metascores, and/or various other cluster information. Such a user interface may be organized according to a prioritization of clusters. In various embodiments, cluster prioritization may assist an analyst in selecting particular clusters to investigate.
[0070] In various embodiments, the interactive user interface generated by the system may provide a list of clusters according to one or more alert scores (as mentioned above and described in detail below). Further, in response to an analyst selecting a cluster, information associated with the cluster may be provided to the analyst. For example, the analyst may be provided with a name of the cluster, a cluster strategy by which the cluster was generated, a list of generated conclusions, and/or one or more lists or tables of data related to the cluster. For example, the one or more lists or tables of data related to the cluster may be drawn from the data items of the cluster, and may be filtered by the analyst according to time and/or type of data. In an embodiment, various generated clusters in the interactive user interface may be organized according to clustering strategies whereby each of the clusters were generated. In an embodiment, a cluster type may be associated with each cluster, and may be determined according to the cluster strategy that generated the cluster.
[0071] As mentioned above, in various embodiments, a generated cluster may include far fewer data items than are included in a full source database, and the data items included in the cluster may only include those data items that are relevant to a particular investigation (for example, a fraud investigation). Accordingly, in an embodiment, processing of the generated cluster may be highly efficient as compared to the collection of data described above. This may be because, for example, a given fraud investigation by an analyst (for example, as the analyst sifts and/or searches through data items of a cluster) may only require storage in memory of a single cluster data structure. Further, a number of data items in a cluster may be several orders of magnitude smaller than in the entire electronic collection of data described above because only data items related to each other are included in the cluster.
[0072] Additionally, the automated analysis and scoring of clusters (as mentioned above) may enable highly efficient evaluation of the various data clusters by a human analyst. For example, the interactive user interface us generated so as to enable an analyst to quickly view critical data clusters (as determined by the automated scoring), and then in response to analyst inputs, view and interact with the generated information (including, for example, the human-readable conclusions) associated with the clusters. In response to user inputs the user interface may be updated to display raw data associated with each of the generated clusters if the analyst desires to dive deeper into data associated with a given cluster.
[0073] In various embodiments, the data analysis system may be used in various data analysis applications. Such applications may include, for example, financial fraud detection, tax fraud detection, beaconing malware detection, malware user-agent detection, other types of malware detection, activity trend detection, health insurance fraud detection, financial account fraud detection, detection of activity by networks of individuals, criminal activity detection, network intrusion detection, detection of phishing efforts, money laundering detection, and/or financial malfeasance detection. Examples of many of the above-mentioned data analysis applications, including methods and systems for identifying data items, generating data clusters, and analyzing/scoring clusters, are disclosed in the various related applications listed above and previously incorporated by reference herein.
[0074] In the following description, numerous specific details are set forth to provide a more thorough understanding of various embodiments of the present disclosure. However, it will be apparent to one of skill in the art that the systems and methods of the present disclosure may be practiced without one or more of these specific details.
Examples of Data Items, Properties, and Links
[0075] In various embodiments, different types of data items may have different property types. For example, a “Person” data item may have an “Eye Color” property type and an “Event” data item may have a “Date” property type. Each property as represented by data in a database may have a property type defined by an ontology used by the database. Further, data items may be instantiated in a database in accordance with a corresponding object definition for the particular data item in the ontology. For example, a specific monetary payment (for example, an item of type “event”) of US$30.00 (for example, a property of type “currency” having a property value of “US$30.00”) taking place on Mar. 27, 2009 (for example, a property of type “date” having a property value of “Mar. 27, 2009”) may be stored in the database as an event object with associated currency and date properties as defined within the ontology.
[0076] Data objects defined in an ontology may support property multiplicity. In particular, a data item may be allowed to have more than one property of the same property type. For example, a “Person” data object may have multiple “Address” properties or multiple “Name” properties.
[0077] A link represents a connection between two data items and may be through any of a relationship, an event, and/or matching properties. A link may be asymmetrical or symmetrical. For example, “Person” data item A may be connected to “Person” data item B by a “Child Of” relationship (where “Person” data item B has an asymmetric “Parent Of” relationship to “Person” data item A), a “Kin Of” symmetric relationship to “Person” data item C, and an asymmetric “Member Of” relationship to “Organization” data item X. The type of relationship between two data items may vary depending on the types of the data items. For example, “Person” data item A may have an “Appears In” relationship with “Document” data item Y or have a “Participate In” relationship with “Event” data item E. As an example of an event connection, two “Person” data items may be connected by an “Airline Flight” data item representing a particular airline flight if they traveled together on that flight, or by a “Meeting” data item representing a particular meeting if they both attended that meeting. In one embodiment, when two data items are connected by an event, they are also connected by relationships, in which each data item has a specific relationship to the event, such as, for example, an “Appears In” relationship.
[0078] As an example of a matching properties connection, two “Person” data items representing a brother and a sister may both have an “Address” property that indicates where they live. If the brother and the sister live in the same home, then their “Address” properties likely contain similar, if not identical property values. In one embodiment, a link between two data item may be established based on similar or matching properties (for example, property types and/or property values) of the data item. These are just some examples of the types of connections that may be represented by a link and other types of connections may be represented; embodiments are not limited to any particular types of connections between data items. For example, a document may contain references to two different items. For example, a document may contain a reference to a payment (one data item), and a person (a second data item). A link between these two data items may represent a connection between these two items through their co-occurrence within the same document.
[0079] Each data item may have multiple links with another data item to form a link set. For example, two “Person” data items representing a husband and a wife may be linked through a “Spouse Of” relationship, a matching “Address” property, and/or one or more matching “Event” properties (for example, a wedding). Each link, as represented by data in a database, may have a link type defined by the database ontology used by the database.
[0080] In various embodiments, the data analysis system may access various data items and associated properties from various databases and data sources. Such databases and data sources may include a variety of information and data, such as, for example, personal information (for example, names, addresses, phone numbers, personal identifiers, and the like), financial information (for example, financial account information, transaction information, balance information, and the like), tax-related information (for example, tax return data, and the like), computer network-related data (for example, network traffic information, IP (Internet Protocol) addresses, user account information, domain information, network connection information, and the like), and/or computer-related activity data (for example, computer events, user actions, and the like), among others.
Description of the Figures
[0081] Embodiments of the disclosure will now be described with reference to the accompanying Figures, wherein like numerals refer to like elements throughout. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of certain specific embodiments of the disclosure. Furthermore, embodiments of the disclosure described above and/or below may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the embodiments of the disclosure herein described.
[0082] I. Example Data Analysis System
[0083] FIG. 1 is a block diagram illustrating an example data analysis system 100, according to one embodiment. As shown in the embodiment of FIG. 1 , the data analysis system 100 includes an application server 115 running on a server computing system 110, a client 135 running on a client computer system 130, and at least one database 140. Further, the client 135, application server 115, and database 140 may communicate over a network 150, for example, to access data sources 160.
[0084] The application server 115 may include a cluster engine (also referred to as a “rules engine”) 120, a workflow engine 125, and a user interface engine 126. The cluster engine 120, a workflow engine 125, and user interface engine 126 may be software modules as described below in reference to FIG. 8 . According to an embodiment, the cluster/rules engine 120 is configured to build one or more clusters of related data items according to a defined cluster generation strategy (including generating seeds according to seed generation strategies/rules), score clusters according to a scoring strategy, and/or analyze clusters including generating human-readable conclusions according to analysis rules/criteria. The cluster/rules engine 120 may read data from a variety of data sources 160 to generate seeds, generate clusters from seeds, score clusters, and analyze clusters. Once created, the resulting clusters may be stored on the server computing system 110 and/or on the database 140. The operations of the cluster/rules engine 120 are discussed in detail below.
[0085] As mentioned, in an embodiment, the cluster/rules engine 120 is configured to score the clusters, according to a defined scoring strategy. The score may indicate the importance of analyzing the cluster. For instance, the cluster/rules engine 120 may execute a scoring strategy that aggregates the account balances of credit card accounts within the cluster. Because, for example, a large aggregated total balance may indicate a large liability for a financial institution, a cluster with such a large total balance may be considered to have a higher score relative to other clusters with lower aggregated total balances (and, therefore, lower scores). Thus, a cluster with a higher score relative to a cluster with a lower score may be considered more important to analyze.
[0086] As described below, in an embodiment the cluster/rules engine 120 is configured to apply one or more analysis rules or criteria to the generated cluster to generate one or more human-readable conclusions (as mentioned above, also referred to herein as “summaries”). In various embodiments the one or more analysis rules/criteria may be based on one or more scoring strategies. Also, in various embodiments the scoring strategies may be based on one or more analysis rules/criteria. As described below, the cluster/rules engine 120 may generate an “alert score” for a given cluster. The alert score may be the same as, similar to, and/or based on any of the cluster scores, metascores, and/or conclusions described herein. In an embodiment, the alert score may be a metascore, and may be one of multiple values corresponding to, for example, a high alert, a medium alert, or a low alert. The alert score is described in further detail below.
[0087] In an embodiment, the user interface engine 126 generates various user interfaces of the data analysis system as described below. In one embodiment, the cluster engine 120, in conjunction with the user interface engine 126, organizes and presents the clusters according to the assigned scores. The cluster engine 120 and the user interface engine 126 may present information associated with the clusters and/or interactive representations of the clusters within a user interface presented to the analyst, as described below. For example, the representations may provide visual indications (e.g., graphs or other visualizations) of the related data items within the clusters. The cluster engine 120 and/or the user interface engine 126 may generate the user interface, such as a web application and/or a dynamic web page displayed within the client 135. The cluster engine 120 and/or the user interface engine 126 may also allow an analyst to create tasks associated with the clusters. Example operations of the cluster engine 120 and/or the user interface engine 126 are discussed in detail below in conjunction with various figures. In one embodiment, the cluster engine 120 generates clusters automatically, for example, for subsequent review by analysts.
[0088] Analysts may also assign tasks to themselves or one another via a workflow user interface generated by the workflow engine 125 and/or the user interface engine 126, for example. The workflow engine 125 and/or the user interface engine 126 may consume scores generated by the cluster engine 120. For example, the workflow engine 125 and/or the user interface engine 126 may present an analyst with clusters generated, scored, and ordered by the cluster engine 120.
[0089] The client 135 may represent one or more software applications or modules configured to present data and translate input, from the analyst, into requests for data analyses by the application server 115. In one embodiment, the client 135 and the application server 115 may be embodied in the same software module and/or may be included in the same computing system. However, several clients 135 may execute on the client computer 130, and/or several clients 135 on several client computers 130 may interact with the application server 115. In one embodiment, the client 135 may be a browser accessing a web service.
[0090] While the client 135 and application server 115 are shown running on distinct computing systems, the client 135 and application server 115 may run on the same computing system. Further, the cluster engine 120 and the workflow engine 125 may run on separate applications servers 115, on separate server computing systems, or some combination thereof. Additionally, a history service may store the results generated by an analyst relative to a given cluster
[0091] In one embodiment, the data sources 160 provide data available to the cluster engine to create or generate seeds and/or to create or generate clusters from a seed or a set of seeds. Such data sources may include relational data sources, web services data, XML data, and the like. Further, such data sources may include a variety of information and data, for example, personal information, financial information, tax-related information, computer network-related data, and/or computer-related activity data, among others. For example, the data sources may be related to customer account records stored by a financial institution. In such a case, the data sources may include a credit card account data, bank account data, customer data, and transaction data. The data may include data attributes such as account numbers, account balances, phone numbers, addresses, and transaction amounts, and the like. Of course, data sources 160 is included to be representative of a variety of data available to the server computer system 110 over network 150, as well as locally available data sources.
[0092] The database 140 may be a Relational Database Management System (RDBMS) that stores the data as rows in relational tables. The term “database,” as used herein, may refer to an database (e.g., RDBMS or SQL database), or may refer to any other data structure, such as, for example a comma separated values (CSV), extensible markup language (XML), text (TXT) file, flat file, spreadsheet file, and/or any other widely used or proprietary format. While the database 140 is shown as a distinct computing system, the database 140 may operate on the same server computing system 110 as the application server 115.
[0093] II. Example Cluster Generation
[0094] FIG. 2 is a block diagram illustrating an example generation of clusters by data analysis system 200, according to an embodiment. As shown, in an embodiment the cluster engine 120 (FIG. 1 ) interacts with a seed list 210, a cluster list 250, a cluster strategy store 230, and data bindings 237. The seed list 210 may include seeds 212-1, 212-2 . . . 212-S, and the cluster list 250 may include clusters 252-1, 252-2 . . . 252-C. The cluster engine 120 may be configured as a software application, module, or thread that generates the clusters 252-1, 252-2 . . . 252-C from the seeds 212-1, 212-2 . . . 212-S.
[0095] Seeds 212 (including one, some, or all of seeds 212-1 through 212-S) may be generated by the cluster engine 120 according to various seed generation strategies/rules. Examples of seed generation are described below in reference to various example applications of the data analysis system. According to an embodiment, once generated, seeds 212 may be the starting point for generating a cluster 252. To generate a cluster, the cluster engine 120 may retrieve a given seed 212 from the seed list 210. The seed 212 may be a data item or group of data items within the database 140, such as a customer name, a customer social security number, an account number, and/or a customer telephone number.
[0096] The cluster engine 120 may generate the cluster 252 from the seed 212. In one embodiment, the cluster engine 120 generates the cluster 252 as a collection of data items and the relationships between the various data items. As noted above, the cluster strategy may execute data bindings in order to add each additional layer of data items to the cluster. For example, the cluster engine 120 may generate the cluster 252-1 from a seed credit card account. The cluster engine 120 may first add the credit card account to the cluster 252-1. The cluster engine 120 may then add customers related to the credit card account to the cluster 252-1. The cluster engine 120 may complete the cluster 252-1 by adding additional credit card accounts related to those customers. As the cluster engine 120 generates the cluster 252-1, the cluster engine 120 may store the cluster 252-1 within the cluster list 250. The cluster 252-1 may be stored as a graph data structure or other appropriate data structure.
[0097] The cluster list 250 may be a collection of tables in the database 140. In such a case, there may be a table for the data items of each cluster 252, such as those of example cluster 252-1 discussed above, a table for the relationships between the various data items, a table for the attributes of the data items, and a table for scores of the clusters. The cluster list 250 may include clusters 252 from multiple investigations. Note that the cluster engine 120 may store portions of clusters 252 in the cluster list 250 as the cluster engine 120 generates the clusters 252. Persons skilled in the art will recognize that many technically feasible techniques exist for creating and storing data structures that may be used to implement the systems and methods of the data analysis system.
[0098] The cluster strategy store 230 may include cluster strategies 232-1, 232-2 . . . 232-N. Each cluster strategy may include data binding references 235 to one or more data bindings 237. As noted, each data binding may be used to identify data that may grow a cluster (as determined by the given search strategy 232). For example, the cluster engine 120 may execute a cluster strategy 232-1 to generate the cluster 252-1. Specifically, the cluster engine 120 may execute the cluster strategy 232-1 in response to selection of that cluster strategy by an analyst. The analyst may submit a selection of one or more cluster strategies to perform on a seed or group of seeds to the cluster engine 120 through the client 135. Alternatively, the cluster engine 120 may automatically select one or more cluster strategies, such as based on user preferences or rules.
[0099] According to an embodiment, each cluster strategy 232 is configured so as to perform an investigation processes for generating a cluster 252. Again, for example, the cluster strategy 232-2 may include data binding references 235 to a collection of data bindings executed to add layer after layer of data to a cluster. The investigation process may include searches to retrieve data items related to a seed 212 that is selected for clustering using cluster strategy 232-2. For example, the cluster strategy 232-2 may start with a possibly fraudulent credit card account as the seed 212-2. The cluster strategy 232-2 may search for customers related to the credit card account, and then additional credit card accounts related to those customers. A different cluster strategy 232-3 may search for customers related to the credit card account, phone numbers related to the customers, additional customers related to the phone numbers, and additional credit card accounts related to the additional customers, for example.
[0100] In an embodiment, cluster strategies 232 include references to at least one data binding 237 (such as data bindings 237-1 through 237-3). The cluster engine 120 may execute a search protocol specified by the data binding 237 to retrieve data, and the data returned by a given data binding may form a layer within the cluster 252. For instance, the data binding 237 (and/or the search protocol of the data binding 237) may retrieve sets of customers related to an account by an account owner attribute. The data binding 237 (and/or the search protocol of the data binding 237) may retrieve the set of related data items from a data source. For instance, the data binding 237-1 may specify a database query to perform against a database. Likewise, the data binding 237-2 may define a connection and/or query to a remote relational database system and the data binding 237-3 may define a connection and/or query against a third-party web service. Once retrieved, the cluster strategy 232 may evaluate whether the returned data should be added to a cluster being grown from a given seed 212.
[0101] Multiple cluster strategies 232 may reference a given data binding 237. The analyst may update the data binding 237, but typically updates the data binding 237 only if the associated data source changes. A cluster strategy 232 may also include a given data binding 237 multiple times. For example, executing a data binding 237 using one seed 212 may generate additional seeds for that data binding 237 (and/or generate seeds for another data binding 237). More generally, different cluster strategies 232-1, 232-2 . . . 232-N may include different arrangements of various data bindings 237 to generate different types of clusters 252.
[0102] The cluster strategies 232 may specify that the cluster engine 120 use an attribute from the related data items retrieved with one data binding 237, as input to a subsequent data binding 237. The cluster engine 120 may use the subsequent data binding 237 to retrieve a subsequent layer of related date items for the cluster 252. For instance, a particular cluster strategy 232 may specify that the cluster engine 120 retrieve a set of credit card account data items with a first data binding 237-1. That cluster strategy 232 may also specify that the cluster engine 120 then use the account number attribute from credit card account data items as input to a subsequent data binding 237-2. The cluster strategy 232 may also specify filters for the cluster engine 120 to apply to the attributes before performing the subsequent data binding 237. For instance, if the first data binding 237-1 were to retrieve a set of credit card account data items that included both personal and business credit card accounts, then the cluster engine 120 could filter out the business credit card accounts before performing the subsequent data binding 237-2.
[0103] In operation, according to an embodiment, the cluster engine 120 generates a cluster 252-1 from a seed 212-1 by first retrieving a cluster strategy 232. Assuming the analyst selected a cluster strategy 232-2, the cluster engine 120 would retrieve the cluster strategy 232-2 from the cluster strategy store 230. The cluster engine 120 may then retrieve the seed 212-1 as input to the cluster strategy 232-2. The cluster engine 120 may execute the cluster strategy 232-2 by retrieving sets of data by executing data bindings 237 referenced by the cluster strategy 232-2. For example, the cluster strategy 232-2 may execute data bindings 237-1, 237-2, and 237-3. Accordingly, the cluster engine 120 may evaluate data returned by each data binding 237 to determine whether to use that data to grow the cluster 252-1. The cluster engine 120 may then use elements of the returned data as input to the next data binding 237. Of course, a variety of execution paths are possible for the data bindings 237. For example, assume one data binding 237 returned a set of phone numbers. In such a case, another data binding 237 may evaluate each phone number individually. As another example, one data binding 237 may use input parameters obtained by executing multiple, other data bindings 237. More generally, the cluster engine 120 may retrieve data for each data binding referenced by the cluster strategy 232-2. The cluster engine 120 may then store the complete cluster 252-1 in the cluster list 250.
[0104] As the cluster engine 120 generates the clusters 252-1, 252-2 . . . 252-C from seeds 212-1, 212-2 . . . 212-S, the cluster list 250 may include overlapping clusters 252. For example, two clusters 252-1 and 252-C may overlap if both clusters 252-1 and 252-C include a common data item. In an example, a larger cluster 252 formed by merging two smaller clusters 252-1 and 252-C may be a better investigation starting point than the smaller clusters 252-1 and 252-C individually. The larger cluster 252 may provide additional insight or relationships, which may not be available if the two clusters 252-1 and 252-C remain separate.
[0105] In an embodiment, the cluster engine 120 includes a resolver 226 that is configured to detect and merge two or more overlapping clusters 252 together. For example, the resolver 226 may compare the data items within a cluster 252-1 to the data items within each one of the other clusters 252-2 through 252-C. If the resolver 226 finds the same data item within the cluster 252-1 and a second cluster 252-C, then the resolver 226 may merge the two clusters 252-1 and 252-C into a single larger cluster 252. For example, the cluster 252-1 and cluster 252-C may both include the same customer. The resolver 226 may compare the data items of cluster 252-1 to the data items of cluster 252-C and detect the same customer in both clusters 252. Upon detecting the same customer in both clusters 252, the resolver 226 may merge the cluster 252-1 with cluster 252-C. The resolver 226 may test each pair of clusters 252 to identify overlapping clusters 252. Although the larger clusters 252 may be better investigation starting points, an analyst may want to understand how the resolver 226 formed the larger clusters 252. Accordingly, the resolver 226, may store a history of each merge.
[0106] In various embodiments, clusters may be merged based on various criteria and/or combinations of criteria include, for example, when the clusters include a minimum number of data items that are common among the clusters, when the clusters include a minimum number of data items that are common among the clusters and which data items are within a particular proximity in each cluster to a seed of the cluster, when a particular quantity of properties are common among data items of the clusters even when the data items themselves are not identical, and/or the like.
[0107] In an embodiment, cluster merging (for example, by resolver 226) may be optionally disabled for particular types of data items, and/or particular data items. For example, when a particular data item, or type of data item, is so common that it may be included in many different clusters (for example, an institutional item such as a bank), merging of cluster based on that common item (for example, the particular bank) or common type of item (for example, banks in general) may be disabled. In another embodiment, cluster may be merged only when they share two or more common data items and/or other properties. In an embodiment, when two clusters are determined to share a data item that this very common (such that they cluster may not be merged based on that item) the system may automatically determine whether the two clusters share one or more other data items and/or properties such that they may be merged. In various embodiments, cluster merging may be disabled based on other criteria. For example, cluster merging between two related clusters may be disabled when one or both of the two clusters reach a particular size (for example, include a particular number of data items).
[0108] After the cluster engine generates a group of clusters from a given collection of seeds (and after merging or resolving the cluster), the cluster engine 120 may score, rank, and/or otherwise order the clusters relative to a scoring strategy 442. In some embodiments, clusters are scored and provided to the analysis without resolving.
[0109] In one embodiment, the analysis system 100, and more specifically, the cluster engine 120, receives a request for cluster generation. In response to the request, a list of seeds may be generated, clusters may be generated based on those seeds, and the clusters may be ranked, ordered, and presented to analysts. In an embodiment, the cluster engine 120 may consume seeds generated by other systems. Alternatively, in other embodiments, cluster engine 120 may generate the seeds 212-1, 212-2 . . . 212-S. For instance, the cluster engine 120 may include a seed generation strategy (also referred to as a “lead generation strategy”) that identifies data items, or groups of data items, as potential seeds 212. The seed generation (and/or lead generation) strategy may apply to a particular business type, such as credit cards, stock trading, or insurance claims, and may be run against a cluster data source 160 or an external source of information.
[0110] In an embodiment, the analysis system 100 may not include data bindings as described above. Rather, according to an embodiment, the analysis system 100 may include one or more interfaces and/or connections to various internal and/or external data stores of data items and/or other information (for example, data sources(s) 160. According to an embodiment, the system may include a generic interface and/or connection to various internal and/or external data stores of data items and/or other information. For example, the analysis system 100 may include a generic data interface through which the system may search, access, and/or filter various data item information during seed generation, cluster generation, and/or analysis of the clusters. The generic interface may include various aspects that enable searching, accessing, and/or filtering of data. For example, the generic interface may access various data sources that each have differing data formats. The generic interface may accordingly covert and/or filter the accessed data to a common format. Alternatively, the data sources may include functionality through which stored data may be searched and/or converted to a standard format automatically. In an embodiment, the generic interface may enable Federated search of multiple data stores of data item-related information. Accordingly, in various embodiments, the analysis system 100 may access various data sources for data item clustering and seed generation.
[0111] Additional details of the server computing system 110, the data sources 160, and other components of the data analysis system are described below in reference to FIG. 8 .
[0112] FIGS. 3A-3C illustrate an example growth of a cluster 252 of related data items, according to an embodiment. As shown in FIG. 3A , an example cluster 252 may include a seed item 302, links 303-1 and 303-2, and related data items 305-1 and 305-2. The cluster 252 may be based upon a seed 212 (for example, data item 302). The cluster engine 120 may build the cluster 252 by executing a cluster strategy 232 with the following searches:
[0113] Find seed owner
[0114] Find all phone numbers related to the seed owner
[0115] Find all customers related to the phone numbers
[0116] Find all accounts related to the customers
[0117] Find all new customers related to the new accounts
[0118] In the example, assuming the seed 212 is fraudulent credit card account, the cluster engine 120 would add the credit card account to the cluster 252 as the seed item 302. The cluster engine 120 may then use the account owner attribute of the credit card account as input to a data binding 237. The cluster engine 120 may execute the search protocol of the data binding 237 to retrieve the customer data identifying the owner of the fraudulent credit card account. The cluster engine 120 would then add the customer data to the cluster 252 as the related data item 305-1. The cluster engine 120 would also add the account owner attribute as the link 303-1 that relates the account number to the customer data of the owner. The cluster engine 120 would execute the next search of the cluster strategy 232 by inputting the customer identifier attribute of the customer data into a data binding 237 to retrieve a phone data. The cluster engine 120 would then add the phone data as the related data item 305-2 and the customer identifier attribute as the link 303-2 between the customer data and the phone data. At this point in the investigation process, the cluster 252 would include the seed item 302, two links 303-1 and 303-2, and two related data items 305-1 and 305-2. That is, the cluster 252 would include the fraudulent credit card account, the customer data of the owner of the credit card, and the phone number of the owner. By carrying the investigation process further, the cluster engine 120 may reveal further related information, for example, additional customers and/or potentially fraudulent credit card accounts.
[0119] Turning to FIG. 3B , and continuing the example, the cluster engine 120 may continue executing the cluster strategy 232 by searching for additional account data items related to the phone number of the owner of the fraudulent credit card account. As discussed, the phone number may be stored as related data item 305-2. The cluster engine 120 would input the phone owner attribute of the phone number to a data binding 237. The cluster engine 120 would execute the search protocol of data binding 237 to retrieve the data of two additional customers, which the cluster engine 120 would store as related data items 305-3 and 305-4. The cluster engine 120 would add the phone owner attribute as the links 303-3 and 304-4 between the additional customers and the phone number.
[0120] Continuing the example, FIG. 3C shows the cluster 252 after the cluster engine 120 performs the last step of the example cluster strategy 232. For example, the cluster engine 120 would use the customer identifier attribute of the related data item 305-3 and 305-4 to retrieve and add additional account data items as the related data items 305-5 and 305-6. The cluster engine 120 would couple the related data items 305-5 and 305-6 to the related data items 305-3 and 305-4 with the customer identifier attributes stored as links 303-5 and 303-6. Thus, the cluster 252 would include six related data items 305 related by six links 303, in addition to the seed item 302.
[0121] In an embodiment, the analyst may identify and determine whether the additional data account items, stored as related data items 305-5 and 305-6, represent fraudulent credit card accounts more efficiently than if the analyst started an investigation with only the seed 302. As the foregoing example illustrates, according to various embodiments, the data analysis system may enable an analyst to advantageously start an investigation with a cluster including many related data items (such as the example cluster 252 with the seed item 302 and related data items 305) rather than a single data item.
[0122] In various embodiments, clusters may be generated automatically, on a schedule, on demand, and/or as needed, as described below.
[0123] III. Example Cluster Scoring/Ranking
[0124] FIG. 4 illustrates an example ranking of clusters 252 by the data analysis system 100 shown in FIG. 1 , according to an embodiment of the present disclosure. As shown, an example system 400 of FIG. 4 illustrates some of the same elements as shown in FIG. 1 and FIG. 2 , including the cluster engine 120 in communication with the cluster list 250. In addition, FIG. 4 illustrates a scoring strategy store 440 in communication with the cluster engine 120. The scoring strategy store 440 includes scoring strategies 442-1, 442-2 . . . 442-R.
[0125] In an embodiment, the cluster engine 120 executes a scoring strategy 442 to score a cluster 252. For example, the cluster engine 120 may generate a cluster (for example, via a cluster strategy/data bindings) and attempt to resolve it with existing clusters. Thereafter, the cluster engine 120 may score the resulting cluster with any scoring strategies associated with a given cluster generation strategy. In an embodiment, the multiple scores may be generated for a given cluster. The multiple scores may be based on various aspects, metrics, or data associated with the cluster. In one embodiment, a cluster metascore may be generated based on a combination or aggregation of scores associated with a given cluster. Ordering for a group of clusters, (according to a given scoring strategy) may be performed on demand when requested by a client. Alternatively, the analyst may select a scoring strategy 442 through the client 135 and/or the analyst may include the selection within a script or configuration file. In another alternative, the data analysis system may automatically select a scoring strategy. In other embodiments, the cluster engine 120 may execute several scoring strategies 442 to determine a combined score for the cluster 252.
[0126] In an embodiment, a scoring strategy (such as scoring strategy 442) specifies an approach for scoring a cluster (such as cluster 252). A score may indicate a relative importance or significance of a given cluster. For example, the cluster engine 120 may execute a scoring strategy 442-1 to determine a score by counting the number of a particular data item type that are included within the cluster 252. Assume, for example, a data item corresponds with a credit account. In such a case, a cluster with a large number of accounts opened by a single individual (possibly within a short time) might correlate with a higher fraud risk. Of course, a cluster score may be related to a high risk of fraud based on the other data in the cluster, as appropriate for a given case. More generally, each scoring strategy 442 may be tailored based on the data in clusters created by a given cluster strategy 230 and a particular type of risk or fraud (and/or amounts at risk) of interest to an analyst.
[0127] According to an embodiment, the cluster engine 120 scores a cluster 252-1 by first retrieving a scoring strategy 442. For example, assume an analyst selects scoring strategy 442-1. In response, the cluster engine 120 may retrieve the scoring strategy 442-1. The cluster engine 120 may also retrieve the cluster 252-1 from the cluster list 250. After determining the score of the cluster 252-1, the cluster engine 120 may store the score with the cluster 252-1 in the cluster list 250.
[0128] The cluster engine 120 may score multiple clusters 252-1, 252-2 . . . 252-C in the cluster list 250. The cluster engine 120 may also rank the clusters 252-1, 252-2 . . . 252-C based upon the scores. For instance, the cluster engine 120 may rank the cluster 252-1, 252-2 . . . 252-C from highest score to lowest score. In various embodiment, cluster may be ranked according into multiple scores, combinations of scores, and/or metascores.
[0129] As mentioned above, the cluster/rules engine 120 may generate an “alert score” for the clusters. The alert score may be the same as, similar to, and/or based on any of the cluster scores, metascores, and/or conclusions described herein. In an embodiment, the alert score may be a metascore, and may be one of multiple values corresponding to, for example, a high alert, a medium alert, or a low alert. The alert score is described in further detail below.
[0130] IV. Example User Interface
[0131] FIG. 5 illustrates an example user interface 500, according to one embodiment. As described above, the cluster engine 120, the workflow engine 125, and/or the user interface engine 126 may be configured to present the user interface 500. As shown, the example user interface 500 includes a selection box 510, a cluster strategy box 530, a cluster summary list 525, a cluster search box 520, and a cluster review window 515. The user interface 500 may be generated as a web application or a dynamic web page displayed within the client 135.
[0132] In the example user interface 500 of FIG. 5 , the selection box 510 may allow the analyst to select, for example, a seed generation strategy and/or a previously generated seed or seed list (for example, seed list 210). The analyst may select the items (for example, a seed generation strategy) by, for example, entering a name of a particular item into a dropdown box (and/or other interface element) in the selection box 510 (for example, the dropdown box showing a selected strategy “Strategy-A”) and selecting a “Go” button (and/or other interface element). Alternatively, the analyst may select a particular item by, for example, expanding the dropdown box and selecting an item from the expanded dropdown box, which may list various seed generation strategies and/or seed lists, for example. In various examples, seed lists and/or seed generation strategies may be selected by the analyst that correspond to likely fraudulent financial accounts, credit card account originating at a particular bank branch, savings accounts with balances above a particular amount, and/or any of the other seed generation strategies described below in reference to the various applications of the system.
[0133] For example, when the analyst selects a particular seed generation strategy, the system may generate a seed list (for example, seed list 210) and then may generate clusters based on seeds of the seed list. The seed list and/or clusters may, in an embodiment, be generated in response to a selection of a particular seed generation strategy. The seed generation strategy may generate a seed list (for example, seed list 210) and/or clusters (for example, clusters 252-1, 252-2, . . . 252-C of the cluster list 250) from the database 140 and/or an external source of information (for example, a cluster data source 160). Alternatively, when the analyst selects a previously generated seed or seed list (for example, seed list 210), the system may retrieve data related to the selected seed list (for example, the seed items, clusters, and/or related clustered data items) from, for example, database 140 and/or an external source of information (for example, a cluster data source 160). In an embodiment, clusters may be generated in response to a selection of a previously generated seed list (or, alternatively, a previously generated seed). Alternatively, cluster may be been previously generated, and may be retrieved in response to selection of a previously generated seed list (or, alternatively, a previously generated seed). In an embodiment, the analyst may select a particular cluster of interest via the selection box 510.
[0134] Further, in the example user interface 500 the cluster strategy box 530 displays the cluster strategies 232 that the cluster engine 120 ran against the seed list 210. The cluster engine 120 may execute multiple cluster strategies 232 against the seed list 210, so there may be multiple cluster strategies 232 listed in the cluster strategy box 530. The analyst may click on the name of a given cluster strategy 232 in the cluster strategy box 530 to review the clusters 252 that the cluster strategy 232 generated.
[0135] In an embodiment, the user interface 500 displays information associated with the clusters 252 in the cluster summary list 525. For example, the information associated with the clusters may include characteristics of the clusters 252, such as identifiers, scores, and/or analysts assigned to analyze the clusters 252. The system may select the clusters 252 for display in the cluster summary list 525 according to those or other characteristics. For instance, the system may display the cluster information in the order of the scores of the clusters 252, where a summary of the highest scoring cluster 252 is displayed first.
[0136] The system (for example, cluster engine 120, the workflow engine 125, and/or the user interface engine 126) may control the order and selection of the cluster information within the cluster summary list 525 based upon an input from the analyst. The cluster search box 520 may include a search text box coupled to a search button and a pull-down control. The analyst may enter a characteristic of a cluster 252 in the search text box and then instruct the workflow engine 125 to search for and display clusters 252 that include the characteristic by pressing the search button. For example, the analyst may search for clusters with a particular score. The pull-down control may include a list of different characteristics of the clusters 252, such as score, size, assigned analyst, and/or date created. The analyst may select one of the characteristics to instruct the workflow engine 125 to present the information associated with the clusters 252 arranged by that characteristic.
[0137] In an embodiment, the system is also configured to present details of a given cluster 252 within the cluster review window 515. The system displays the details of the cluster 252, for example, the score, and/or average account balances within a cluster, when the analyst clicks a mouse pointer on the associated summary within the cluster summary list 525. The system may present details of the cluster 252, such as the name of an analyst assigned to analyze the cluster 252, a score of the cluster 252, and/or statistics or graphs generated from the cluster 252. These details may allow the analyst to determine whether to investigate the cluster 252 further. The cluster review window 515 may also include a button which may be clicked to investigate a cluster 252 within a graph, and an assign button for assigning a cluster to an analyst.
[0138] An analyst may click a mouse pointer on an “Investigate in Graph” button representing a cluster to investigate the cluster within an interactive graph. The interactive representation may be a visual graph of the cluster 252, where icons represent the items of the cluster 252 and lines between the icons represent the links between items of the cluster 252. For example, the workflow engine 125 may display the interactive graph of the cluster 252 similar to the representation of the cluster 252 in FIG. 3C . The interactive representation may allow the analyst to review the attributes of the related data items and/or perform queries for additional related data items.
[0139] In an embodiment, an administrative user may click a mouse pointer on an assign button to assign the associated cluster 252 to an analyst. The workflow engine 125 may also allow the administrative user to create tasks associated with the clusters 252, while the administrative user assigns the cluster 252. For example, the administrative user may create a task for searching within the three highest scoring clusters 252 for fraudulent credit card accounts. The system may display the cluster information in the cluster summary list 525 according to the names of the analysts assigned to the clusters 252. Likewise, the system may only display cluster information for the subset of the clusters 252 assigned to an analyst.
[0140] The interface shown in FIG. 5 is included to illustrate one example interface useful for navigating and reviewing clusters generated using the cluster engine 120 and the workflow engine 125. In other embodiments, other user interface constructs may be used to allow the analyst to select cluster strategies 232, scoring strategies 242, and/or seed generation strategies, initiate an investigation, and/or review and analyze the clusters 252. For example, the user interface engine 126 may display additional controls within the user interface 500 for controlling the cluster generation process and selecting seed generation strategies, cluster strategies 232, and/or scoring strategies 242. Also, the user interface 500 may be displayed without the selection box 510 or the options to select a seed generation strategy. In addition, although the workflow engine 125 may generate the user interface 500, in various embodiments the user interface 500 may be generated by a software application distinct from the workflow engine 125. Further, in various embodiments, the cluster review window 515 may be configured to display a preview of the cluster 252 and/or additional statistics generated from the cluster 252. As such, an interactive representation of the cluster 252 may be presented in an additional user interface and/or the cluster 252 may be exported to another software application for review by the analyst.
[0141] In an alternative embodiment, and as described below in reference to the various figures, various other user interfaces may be generated by the system.
[0142] V. Example Operations
[0143] FIG. 6 is a flowchart of an example method of generating clusters, according to an embodiment. Although the method is described in conjunction with the systems of FIGS. 1 and 2 , persons skilled in the art will understand that any system configured to perform the method, in any order, is within the scope of this disclosure. Further, the method 600 may be performed in conjunction with method 700 for scoring a cluster, described below, and the various other methods described below including analyzing a cluster.
[0144] As shown, example cluster generation method 600 begins at block 605, where the cluster engine 120 retrieves a cluster strategy (e.g., cluster strategy 232-2) and a seed 212. Once a cluster strategy is selected, the cluster engine 120 may identify a list of seeds from which to build clusters using the selected cluster strategy. At block 610, the cluster engine 120 initializes a cluster 252 with one of the seeds in the list. The cluster 252 may be stored as a graph data structure. The cluster engine 120 may initialize the graph data structure and then add the seed 212-1 to the graph data structure as the first data item.
[0145] At block 615, the cluster engine 120 may grow the cluster 252 by executing the search protocol of a data binding 237 from the cluster strategy 232-2. The cluster strategy 232-2 may include a series of data bindings 237 that the cluster engine 120 executes to retrieve related data items. A given data binding 237 may include queries to execute against a cluster data source 160 using the seed as an input parameter. For example, if the seed 212-1 is an account number, then the data binding 237 may retrieve the data identifying the owner of the account with the account number. After retrieving this information, the cluster engine 120 may add the customer data item to the cluster as a related data item and the account owner attribute as the link between the seed 212-1 and the related data item. After retrieving the related data items, the cluster engine 120 may add them to the cluster 252.
[0146] At block 620, the cluster engine 120 determines if the cluster strategy 232-2 is fully executed. If not the method 600 returns to block 615 to execute additional data bindings for a given seed. Alternatively, as described above, the cluster engine 120 may grow the cluster by searching for, accessing, and/or filtering various data items through, for example, a generic interface to various internal and/or external data sources. Further, in an embodiment, the cluster engine 120 may determine whether the cluster being generated is to be merged with another cluster, as described above. Once the cluster strategy is executed for that seed, the cluster engine 120 may determine and assign a score (or, alternatively, multiple scores) to that cluster (relative 11a specified scoring strategy). After generating clusters for a group of seeds, such clusters may be ordered or ranked based on the relative scores. Doing so may allow an analyst to rapidly identify and evaluate clusters determined to represent, for example, a high risk of fraud.
[0147] At block 625, the cluster engine 120 may store the cluster 252 in cluster list 250. As mentioned above, the cluster list 250 may be a collection of tables within a relational database, where a table may include the seed and related data items of the cluster 252 and another table may include links between the related data items of the cluster 252.
[0148] At block 630, the cluster engine 120 determines if there are more seeds 212 to analyze in the seed list 210. If so, the method 600 returns to block 605 to generate another cluster from the next seed. Otherwise, the method 600 ends. Note, while method 600 describes a single cluster being generated, one of skill in the art will recognize that multiple instances of the cluster generation process illustrated by method 600 may be performed in parallel.
[0149] FIG. 7 is a flowchart of an example method of scoring clusters, according to an embodiment. Although the method is described in conjunction with the systems of FIGS. 1 and 4 , persons skilled in the art will understand that any system configured to perform the method steps, in any order, is within the scope of the present invention.
[0150] As shown, the example cluster scoring method 700 begins at block 705, where the cluster engine 120 retrieves a scoring strategy 442 and a cluster 252 (for example, a cluster just created using the method 600 of FIG. 6 ). In other cases, the cluster engine 120 may retrieve the scoring strategy 442 associated with a stored cluster. Other alternatives include an analyst selecting a scoring strategy 442 through the client 135, the cluster engine 120 via the cluster analysis UI 500, a script, or a configuration file. The cluster engine 120 may retrieve the selected scoring strategy 442 from the scoring strategy store 440, and the cluster 252 from the cluster list 250.
[0151] At block 710, the cluster engine 120 executes the scoring strategy 442 against the cluster 252. The scoring strategy 442 may specify characteristics of the related data items within the cluster 252 to aggregate. The cluster engine 120 may execute the scoring strategy 442 by aggregating the specified characteristics together to determine a score. For instance, the cluster engine 120 may aggregate account balances of related data items that are account data items. In such a case, a total amount of dollars (and/or average dollars or any other aggregated, averaged, or normal attribute of the cluster) included within the balances of the account data items of the cluster 252 may be the score of the cluster 252.
[0152] At block 715, the cluster engine 120 may store the score with the cluster 252 in the cluster list 250. At step 720, the cluster engine 120 determines if there are more clusters 252 to score. For example, in one embodiment, a set of clusters may be re-scored using an updated scoring strategy. In other cases, the cluster engine may score each cluster when it is created from a seed (based on a given cluster generation and corresponding scoring strategy). If more clusters remain to be scored (and/or re-scored), the method 700 returns to block 705.
[0153] At block 725, the cluster engine 120 may rank the clusters 252 according to the scores of the clusters 252. For example, after re-scoring a set of clusters (or, alternatively, after scoring a group of clusters generated from a set of seeds), the cluster engine 125 may rank the clusters 252 from highest score to lowest score. The ranking may be used to order a display of information associated with of the clusters 252 presented to the analyst. The analyst may rely upon the ranking and scores to determine which clusters 252 to analyze first. The ranking and sorting may generally be performed on-demand when an analyst is looking for a cluster to investigate. Thus, the ranking need not happen at the same time as scoring. Further, the clusters may be scored (and later ranked) using different raking strategies.
[0154] In various embodiments, multiple scores for each cluster may be determined according to methods similar to the example method 700. Accordingly, clusters may be ranked according to any of multiple scores. Additionally, in various embodiments, multiple scores may be combined and/or aggregated into a metascore that may be used to rank the clusters. Various example score and metascore determinations are described below in reference to FIGS. 100 , 11 C, 12C, and 13C.
[0155] VI. Example Implementation Mechanisms/Systems
[0156] FIG. 8 illustrates components of an illustrative server computing system 110, according to an embodiment. The server computing system 110 may comprise one or more computing devices that may perform a variety of tasks to implement the various operations of the data analysis system. As shown, the server computing system 110 may include, one or more central processing unit (CPU) 860, a network interface 850, a memory 820, and a storage 830, each connected to an interconnect (bus) 840. The server computing system 110 may also include an I/O device interface 870 connecting I/O devices 875 (for example, keyboard, display, mouse, and/or other input/output devices) to the computing system 110. Further, in context of this disclosure, the computing elements shown in server computing system 110 may correspond to a physical computing system (for example, a system in a data center, a computer server, a desktop computer, a laptop computer, and/or the like) and/or may be a virtual computing instance executing within a hosted computing environment.
[0157] The CPU 860 may retrieve and execute programming instructions stored in memory 820, as well as store and retrieve application data residing in memory 820. The bus 840 may be used to transmit programming instructions and application data between the CPU 860, I/O device interface 870, storage 830, network interface 850, and memory 820. Note that the CPU 860 is included to be representative of, for example, a single CPU, multiple CPUs, a single CPU having multiple processing cores, a CPU with an associate memory management unit, and the like.
[0158] The memory 820 is included to be representative of, for example, a random access memory (RAM), cache and/or other dynamic storage devices for storing information and instructions to be executed by CPU 860. Memory 820 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by CPU 860. Such instructions, when stored in storage media accessible to CPU 860, render server computing system 110 into a special-purpose machine that is customized to perform the operations specified in the instructions.
[0159] The storage 830 may be a disk drive storage device, a read only memory (ROM), or other static, non-transitory, and/or computer-readable storage device or medium coupled to bus 840 for storing static information and instructions for CPU 860. Although shown as a single unit, the storage 830 may be a combination of fixed and/or removable storage devices, such as fixed disc drives, removable memory cards, and/or optical storage, network attached storage (NAS), and/or a storage area-network (SAN).
[0160] Programming instructions, such as the cluster engine 120, the workflow engine 125, and/or the user interface engine 126, may be stored in the memory 820 and/or storage 830 in various software modules, The modules may be stored in a mass storage device (such as storage 830) as executable software codes that are executed by the server computing system 110. These and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.
[0161] Illustratively, according to an embodiment, the memory 820 stores a seed list 210, a cluster engine 120, a cluster list 250, a workflow engine 125, and a user interface engine 126 (as described with reference to the various figures above). The cluster engine 120 may include a cluster strategy 232-2. The particular cluster strategy 232-2 may include data bindings 237-1, 237-2, and 237-3, with which the cluster engine 120 may access the cluster data source 160. The workflow engine 125 may include a scoring strategy 442-1.
[0162] Illustratively, according to an embodiment, the storage 830 includes a cluster strategy store 230, data bindings store 835, a scoring strategy store 440, and one or more cluster analysis rules or criteria 880. As described above, the cluster strategy store 230 may include a collection of different cluster strategies 232, such as cluster strategy 232-2. For example, the cluster strategy store 230 may be a directory that includes the cluster strategies 232-1, 232-2 . . . 232-N as distinct modules. The scoring strategy store 440 may include a collection of different scoring strategies 442, such as scoring strategy 442-2, and may also be a directory of distinct modules. The data binding store 835 may include data bindings 237-1, 237-2 . . . 237-M, which may also be stored as distinct modules within a directory.
[0163] Although shown in memory 820, the seed list 210, cluster engine 120, cluster list 250, workflow engine 125, and the user interface engine 126, may be stored in memory 820, storage 830, and/or split between memory 820 and storage 830. Likewise, copies of the cluster strategy 232-2, data binding 237-1, 237-2, and 237-3, and scoring strategy 442-2 may be stored in memory 820, storage 830, and/or split between memory 820 and storage 830.
[0164] The network 150 may be any wired network, wireless network, or combination thereof. In addition, the network 150 may be a personal area network, local area network, wide area network, cable network, satellite network, cellular telephone network, or combination thereof. Protocols and components for communicating via the Internet or any of the other aforementioned types of communication networks are well known to those skilled in the art of computer communications and thus, need not be described in more detail herein.
[0165] As described above in reference to FIG. 1 , the server computing system 110 may be in communication with one or more data sources 160. Communication between the server computing system 110 and the data sources 160 may be via the network 150 and/or direct. In an embodiment, an optional data aggregator/formatter device and/or system may aggregate various data from multiple data sources and/or may format the data such that it may be received by the server computing system 110 in a standardized and/or readable format. For example, when multiple data sources contain and/or provide data in various formats, the data aggregator/formatter may convert all the data into a similar format. Accordingly, in an embodiment the system may receive and/or access data from, or via, a device or system such as the data aggregator/formatter.
[0166] As described above, in various embodiments the system may be accessible by an analyst (and/or other operator or user) through a web-based viewer, such as a web browser. In this embodiment, the user interface may be generated by the server computing system 110 and transmitted to the web browser of the analyst. Alternatively, data necessary for generating the user interface may be provided by the server computing system 110 to the browser, where the user interface may be generated. The analyst/user may then interact with the user interface through the web-browser. In an embodiment, the user interface of the data analysis system may be accessible through a dedicated software application. In an embodiment, the client computing device 130 may be a mobile computing device, and the user interface of the data analysis system may be accessible through such a mobile computing device (for example, a smartphone and/or tablet). In this embodiment, the server computing system 110 may generate and transmit a user interface to the mobile computing device. Alternatively, the mobile computing device may include modules for generating the user interface, and the server computing system 110 may provide user interaction data to the mobile computing device. In an embodiment, the server computing system 110 comprises a mobile computing device. Additionally, in various embodiments any of the components and/or functionality described above with reference to the server computing system 110 (including, for example, memory, storage, CPU, network interface, I/O device interface, and the like), and/or similar or corresponding components and/or functionality, may be included in the client computing device 130.
[0167] According to various embodiments, the data analysis system and other methods and techniques described herein are implemented by one or more special-purpose computing devices. The special-purpose computing devices may be hard-wired to perform the techniques, or may include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more general purpose hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques. The special-purpose computing devices may be desktop computer systems, server computer systems, portable computer systems, handheld devices, networking devices or any other device or combination of devices that incorporate hard-wired and/or program logic to implement the techniques.
[0168] Computing devices of the data analysis system may generally be controlled and/or coordinated by operating system software, such as iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, VxWorks, or other compatible operating systems. In other embodiments, the computing devices may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.
[0169] In general, the word “module,” as used herein, refers to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware devices (such as processors and CPUs) may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but may be represented in hardware devices. Generally, the modules described herein refer to software modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.
[0170] Server computing system 110 may implement various of the techniques and methods described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which, in combination with various software modules, causes the server computing system 110 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by server computing system 110 in response to CPU 860 executing one or more sequences of one or more modules and/or instructions contained in memory 820. Such instructions may be read into memory 820 from another storage medium, such as storage 830. Execution of the sequences of instructions contained in memory 820 may cause CPU 840 to perform the processes and methods described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
[0171] The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage 830. Volatile media includes dynamic memory, such as memory 820. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.
[0172] Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between non-transitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 840. Transmission media may also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
[0173] Various forms of media may be involved in carrying one or more sequences of one or more instructions to CPU 860 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer may load the instructions and/or modules into its dynamic memory and send the instructions over a telephone or cable line using a modem. A modem local to server computing system 820 may receive the data on the telephone/cable line and use a converter device including the appropriate circuitry to place the data on bus 840. Bus 840 carries the data to memory 820, from which CPU 860 retrieves and executes the instructions. The instructions received by memory 820 may optionally be stored on storage 830 either before or after execution by CPU 860.
[0174] VII. Additional Example Applications
[0175] While financial fraud using credit card accounts is used as a primary reference example in the discussion above, the techniques described herein may be adapted for use with a variety of data sets and in various applications. Such applications may include, for example, financial fraud detection, tax fraud detection, beaconing malware detection, malware user-agent detection, other types of malware detection, activity trend detection, health insurance fraud detection, financial account fraud detection, detection of activity by networks of individuals, criminal activity detection, network intrusion detection, detection of phishing efforts, money laundering detection, and/or financial malfeasance detection. For example, information from data logs of online systems may be evaluated as seeds to improve cyber security. In such a case, a seed may be a suspicious IP address, a compromised user account, and the like. From the seeds, log data, DHCP logs, IP blacklists, packet captures, webapp logs, and other server and database logs may be used to create clusters of activity related to the suspicions seeds. Other examples include data quality analysis used to cluster transactions processed through a computer system (whether financial or otherwise). A number of examples of such applications are described in detail below in reference the various figures.
[0176] VIII. Example Generalized Method of the Data Analysis System
[0177] FIG. 9 is a flowchart of an example generalized method of the data analysis system, according to an embodiment of the present disclosure. In various embodiments, fewer blocks or additional blocks may be included in the process of FIG. 9 , or various blocks may be performed in an order different from that shown in the figure. Further, one or more blocks in the figure may be performed by various components of the data analysis system, for example, server computing system 110 (described above in reference to FIG. 8 ).
[0178] As described above, and as shown in the embodiment of FIG. 9 , the data analysis system may generate a seed or multiple seeds (block 910), may generate clusters based on those seed(s) (block 920), may generate a score or multiple scores for each generated cluster (block 930), may generate a metascore for each generated cluster (block 940), and may optionally rank the generated clusters based on the generated metascores (block 950). In various embodiments, the data analysis system may or may not generate multiple scores for each cluster, may or may not generate metascores for each cluster, and/or may or may not rank the clusters. In an embodiment, the system may rank clusters based on one or more scores that are not metascores.
[0179] Further, as described above, the seeds may include one or multiple data items, and may be generated based on seed generation strategies and/or rules. Similarly, the clusters may include one or multiple data items related to a seed, including the seed, and may be generated based on cluster generation strategies and/or rules (including data bindings and/or searching and filtering are performed through, for example, a generic interface to various data sources). Scores and metascores may be determined based on attributes, characteristics, and/or properties associated with data items that make up a given cluster.
[0180] Example applications of the data analysis system, including methods and systems for identifying data items, generating data clusters, and analyzing/scoring clusters, are disclosed in the various related applications listed above and previously incorporated by reference herein.
[0181] IX. Cluster Analysis and Example Analysis User Interfaces
[0182] FIGS. 10A-10C and 11-22, described below, illustrate methods and user interfaces of the data analysis system, according to various embodiments, in which data clusters are automatically generated, analyzed, and presented to an analyst such that the analyst may quickly and efficiently evaluate the clusters. In particular, as described below the data analysis system may apply one or more analysis criteria or rules to the data clusters so as to generate human-readable “conclusions” (as described above, also referred to herein as “summaries”). The conclusions may be displayed in an analysis user interface through which the analyst may evaluate the clusters and/or access more detailed data related to the cluster. In an embodiment, a cluster type may be associated with each cluster, and may be determined according to the cluster strategy that generated the cluster. Further, the system may generate “alert scores” for the clusters which may be used to prioritize clusters displayed to the analyst.
[0183] The various methods and user interfaces described below in reference to FIGS. 10A-10C and 11-22 may be implemented by various aspects of the data analysis system (for example, the server computing system 110 and/or another suitable computing system) as described above. For example, clustering may be accomplished according to seed generation and clustering strategies and rules as implemented by, for example, the cluster/rules engine 120; cluster analysis may be accomplished according to analysis rules/criteria 880 as implemented by, for example, the cluster/rules engine 120; cluster scoring (for example, generation of alert scores) may be accomplished according to scoring strategies as implemented by, for example, the cluster/rules engine 120; and user interface may be generated and/or presented to the analyst by, for example, the user interface engine 126; among other aspects.
[0184] Additionally, in the methods described in reference to the flowcharts of FIGS. 10A-10B and 21 below, in various embodiments, fewer blocks or additional blocks may be included in the example methods depicted, or various blocks may be performed in an order different from that shown in the figures. Further, in various embodiments, one or more blocks in the figures may be performed by various components of the data analysis system, for example, server computing system 110 (described above in reference to FIG. 8 ) and/or another suitable computing system.
[0185] a. Example Method of Cluster Analysis
[0186] FIG. 10A is a flowchart for an example method of data cluster analysis, according to an embodiment of the present disclosure. In FIG. 10A , blocks 910 and 920 of the flowchart proceed generally as described in reference to the flowchart of FIG. 9 . For example, at block 910 seeds are generated according to one or more seed generation strategies. Examples of seed generation strategies are described in the various related applications listed above and previously incorporated by reference herein. Examples include identifying tax returns that are potentially fraudulent, identifying communications that are potentially associated with beaconing malware, and/or identifying emails potentially associated with phishing campaigns, among others. Further, at block 920 clusters are generated based on the one or more generated seeds and according to the one or more cluster generation strategies. Examples of cluster generation strategies (as mentioned above, also referred to herein as “cluster strategies,” “clustering strategies,” and/or “cluster generation rules”) are described in the various related applications listed above and previously incorporated by reference herein. Examples include strategies for financial fraud detection, tax fraud detection, beaconing malware detection, malware user-agent detection, other types of malware detection, activity trend detection, health insurance fraud detection, financial account fraud detection, detection of activity by networks of individuals, criminal activity detection, network intrusion detection, detection of phishing efforts, money laundering detection, and/or financial malfeasance detection, among others.
[0187] A cluster of data items generated according to a given clustering strategy (and its associated seed generation strategy or strategies) may be understood as having a “cluster type” (also referred to as a “data cluster type”) corresponding to that clustering strategy. For example, a particular clustering strategy may be referred to as “Tax Fraud,” because the clustering strategy relates to identifying clusters of data items related to potential tax fraud. A cluster of data items generated according to that clustering strategy may therefore have a “cluster type” of “Tax Fraud.” In another example, a cluster generated by an “Internal Phishing” clustering strategy (and its associated seed generation strategy or strategies) has a cluster type of “Internal Phishing.”
[0188] At block 1002 of, the system generates “alerts” for each of the clusters. An “alert” includes various types of information related to the cluster that may be useful to an analyst in evaluating the importance or criticality of the cluster in the context of a particular investigation. Generating an alert may include applying various cluster analysis rules or criteria to analyze the cluster and so as to generate human-readable cluster conclusions, as mentioned above. Generating an alert may further include generating an alert score for the cluster. Details regarding generation of alerts are described below in reference to FIG. 10B .
[0189] At block 1004 of FIG. 10A , a cluster analysis user interface is provided to the user (for example, an analyst). FIGS. 11-20 and 22, described below, include examples of cluster analysis user interfaces of the data analysis system. As described below, a user interface may include a listing of alerts, each alert corresponding to a particular generated and analyzed cluster. The alerts may be organized and grouped according to cluster types. Further, the analyst may view a user interface including detailed information related to each alert, including the human-readable conclusions, the alert scores, and various detailed data related to the clusters. For example, in a given alert the analyst may be provided with a name of the cluster, a cluster strategy by which the cluster was generated (also referred to as the cluster type), a list of generated conclusions, and/or one or more lists and/or tables of data related to the cluster. The one or more lists and/or tables of data related to the cluster may be drawn from the data items of the cluster, and may be filtered by the analyst according to time and/or type of data.
[0190] At block 1006, the system regenerates previously generated clusters. In various implementations the data items from which seeds are selected/generated and from which clusters are generated may change after a cluster is generated. In the example of tax fraud detection, additional tax return data items may be received, or additional phone number data items may be received that relate to a person in a previously generated cluster. Such information may have been included in a cluster if it had been available at the time the cluster was created. Accordingly, the system may regenerate clusters so as to include the data items and/or other information that has become available since the last time the cluster was generated. After, or in response to, a cluster being regenerated, the system reanalyzes the cluster and may, in an embodiment, generate an alert for the regenerated and reanalyzed cluster (as indicated by the arrow back to block 1002). In another embodiment, as described below in reference FIG. 21 , when a given cluster is regenerated, a previously generated alert for that cluster may be updated or, alternatively, a new alert may be generated including a link to the previously generated alert.
[0191] In an embodiment, as shown at block 1006a, clusters may be regenerated on a schedule. For example, the system may be configured to regenerate clusters after a particular number of seconds, minutes, hours, or days, or at particular times every hour or day. In another embodiment, as shown at block 1006b, clusters may be regenerated as needed, such as in response to the system detecting one or more changes in data items and automatically executing a cluster regeneration process. For example, the system may be configured to automatically regenerate clusters when it detects that new data items (and/or other information) are received by the system, new data items (and/or other information) related to a cluster (and/or potentially related to a cluster) are received by the system, new data items (and/or other information) connected to a cluster or a data item in a cluster is received by the system, an analyst logs into the system, and/or an analyst views a cluster. In another embodiment, as shown at block 1006c, clusters may be regenerated on demand. For example, clusters may be regenerated when requested by an analyst (via, for example, a user interface of the system).
[0192] In any of the embodiments of blocks 1006a, 1006b, and 1006c, all clusters may be regenerated or portions of clusters may be regenerated, in any combination. For example, clusters associated with a particular clustering strategy may be generated on a particular schedule, while clusters associated with a different clustering strategy may be generated on a different schedule (and/or as needed and/or on demand). In another example, individual clusters may be regenerated, or other relationships among clusters may be used to determine which clusters are to be regenerated at a given time.
[0193] At optional block 1008, clusters are merged as described above. For example, if a regenerated cluster includes a data item also included in a different cluster, the regenerated cluster and the different cluster may optionally be merged. In the embodiment of FIG. 10A , only clusters generated according to the same clustering strategy (for example, having the same cluster type) may be merged. In this embodiment, alerts generated for clusters having different cluster types may be linked even if the clusters are not merged, as described below in reference to FIGS. 21 and 22 . In alternative embodiments, clusters generated according to different clustering strategies (for example, having different cluster types) may be merged.
[0194] b. Example Method of Alert Generation
[0195] FIG. 10B is a flowchart of an example method of alert generation for a particular data cluster, according to an embodiment of the present disclosure. At block 1022, the system accesses data, including data items and related metadata and other information, of the data cluster. As described below, this accessed cluster data is analyzed to generate the human-readable conclusions, the alert scores, and may be included and organized in the user interface of the alert. At block 1024, the system determines the cluster type of the data cluster. As mentioned above, a data cluster generated according to a given clustering strategy (and its associated seed generation strategy or strategies) may be understood as having a “cluster type” (also referred to as a “data cluster type”) corresponding to that clustering strategy.
[0196] At block 1026, having determined the cluster type of the data cluster, the system accesses one or more cluster analysis rules or criteria associated with that cluster type. As various data clusters may be generated according to different clustering strategies, and each of the clustering strategies may be associated with differing types of investigations, the analysis rules or criteria used to analyze the clusters vary according to the cluster types and their respective associated types of investigations.
[0197] At block 1028, the system analyzes the data cluster based on the accessed analysis rules/criteria. The cluster data is then evaluated by the system (for example, by the cluster/rules engine 120) according to the analysis rules/criteria. Many examples of cluster analysis according to various clustering strategies are described in the various related applications listed above and previously incorporated by reference herein. In the various examples, analysis of clusters may be described in the context of cluster scoring (for example, generating of clusters scores and/or metascores). For example, in U.S. patent application Ser. No. 14/139,628, cluster data is scored and/or analyzed in various contexts including, among others:
-
- [0198] Tax Fraud Detection, in which clusters are analyzed to determine a number of known fraudulent returns in a cluster, a number of first-time filers in the cluster, and/or a mismatch between reported incomes in the cluster, among others.
- [0199] Beaconing Malware Detection, in which clusters are analyzed to determine a number of known bad domains in a cluster, an average request size in the cluster, and/or a number of requests blocked by a proxy in the cluster, among others.
[0200] Additional examples are found in U.S. Provisional Patent Application No. 62/020,876, in which cluster data is scored and/or analyzed in various contexts including:
-
- [0201] Internal and External Phishing, in which clusters are analyzed to determine a most common email subject of emails in the cluster, numbers of emails in the cluster sent within particular time periods, and/or number of recipients of emails in the cluster, among others.
- [0202] Internal and External Threat Intel, in which clusters are analyzed to determine a number of URLs in the cluster referenced by an analyzed malware data item, a percentage of traffic in the cluster categorized as likely malicious, and/or a highest organizationally hierarchical position of a person in the cluster associated with a malicious connection, among others.
- [0203] IDS (Intrusion Detection System), in which clusters are analyzed to determine a time spanned by alert notices in the cluster and/or a number of alert notices associated with particular IP addresses, among others.
[0204] i. “Conclusions”
[0205] At block 1030 of FIG. 10B , the system generates one or more conclusions for the analyzed data cluster based on the cluster analysis. As described above, the generated conclusions (also referred to herein as summaries) comprise compact, human-readable phrases or sentences that provide highly relevant, and easily evaluated (by a human analyst), information regarding the data in the cluster (for example, data items and metadata). The conclusions may be useful to an analyst in evaluating the importance or criticality of the cluster in the context of a particular investigation. As with the analysis rules/criteria described above, each cluster type may be related to a set of conclusions appropriate to the type of investigation associated with the cluster type. FIG. 100 illustrates various example templates for conclusions (also referred to herein as “conclusion templates”) associated with various types of data clusters, according to an embodiment. For example, five cluster types (which are each associated with various seed generation, clustering, and scoring strategies) are included in the example embodiment of FIG. 100 : Internal Phishing, External Phishing, Internal Threat Intel, External Threat Intel, and IDS (short for Intrusion Detection System). Each of the example cluster types is associated with one or more conclusion templates, as shown in the right column of the table of FIG. 10C . The conclusion templates include fields (indicated by the symbols < and >) into which cluster information, obtained as a result of the cluster analysis, is inserted when the conclusion is generated.
[0206] For example, in reference to the embodiment of FIG. 10C , for the cluster type “External Phishing,” a conclusion template is “This campaign consists of <m> emails submitted to external Abuse,” where <m> indicates a field to be filled in by the system based on the cluster analysis, and “external Abuse” may refer to an email address or box. In generating this conclusion, the system accesses the relevant set of conclusions (for example, conclusions associated with the type of the cluster analyzed) and inserts relevant cluster analysis data into each of the conclusions (for example, “This campaign consists of 25 emails submitted to external Abuse”). In another example, for the cluster type “External Threat Intel,” a conclusion template is “<k>% of proxy traffic was blocked, and <l>% was marked as malicious by Proxy,” where <k> and <l> indicate fields to be filled in by the system based on the cluster analysis. In generating this conclusion, the system accesses the relevant set of conclusions (for example, conclusions associated with the type of the cluster analyzed) and inserts relevant cluster analysis data into each of the conclusion templates (for example, “10% of proxy traffic was blocked, and 7% was marked as malicious by Proxy”).
[0207] In an embodiment, conclusion templates, such as those listed in the table of FIG. 100 , may be manually generated by humans based on a determination of information likely to be helpful to an analyst in evaluating alerts/clusters. The manually generated conclusion templates associated with respective cluster types may then be automatically accessed by the system (e.g., after automatically determining which conclusion templates are applicable), relevant data may be inserted into any indicated fields, and conclusions may then be automatically generated based on the selected conclusion template(s) and presented on a user interface (as described below). In another embodiment, the system may automatically use heuristics to generate conclusion templates that may then be presented by the system. In this example, the system may determine, over time, information most useful to analysts, and thereby generate conclusion templates and conclusions based on that useful information.
[0208] In an embodiment, a predefined group of conclusions may be associated with each cluster type. In this embodiment, all conclusions in the relevant group may be generated and presented in the user interface for each respective alert. In another embodiment, various conclusions may be associated with each cluster type, and the system may determine particular conclusions, based on the cluster analysis, to generate and present in the user interface. In this embodiment, the system may select particular conclusions based on a likelihood that the particular conclusions will be helpful to the analyst in evaluating the cluster. For example, when a cluster does not have any data items (and/or other information) of a particular type that are enumerated (and/or otherwise evaluated) in a particular conclusion, that particular conclusion may not be displayed to the analyst. Alternatively, the system may indicate to the analyst that the particular conclusion is not applicable to the cluster.
[0209] In an embodiment, conclusions may be unique to each cluster type. In another embodiment, conclusions may be applicable to multiple cluster types.
[0210] In an embodiment, a conclusion may not express an opinion, but may only provide factual information. For example, “Less than 1 MB of data was exchanged with the following URL: http://example.com.” In another embodiment, a conclusion may express an opinion if a judgment threshold is provided (for example, some factual basis for the opinion), but not otherwise. For example, an appropriate conclusion may be “Only a small amount of data, 0.7 MB, was exchanged with the following URL: http://example.com,” while an inappropriate conclusion may be “Only a small amount of data was exchanged with the following URL: http://example.com.” In various embodiments, conclusions generated by the system provide factual and/or opinion information to the analyst in the context of a particular investigation and/or cluster/alert type.
[0211] In an embodiment, each conclusion is limited to a particular number of words, for example, 10, 15, or some other number. In an embodiment, each user interface associated with an alert (as described below) displays between one and some other number of conclusions, for example, 2, 3, 4, 5, among others.
[0212] ii. “Alert Score”
[0213] Turning again to the embodiment shown in FIG. 10B , at block 1032, the system generates an alert score for the analyzed data cluster based on the cluster analysis. As described above, the alert score may be the same as, similar to, and/or based on any of the scores, metascores, and/or conclusions described herein. An alert score may provide an initial indication to an analyst of a likelihood that a cluster/alert is important or critical in the context of a particular investigation (for example, a degree of correlation between characteristics of the cluster/alert and the analysis rules/criteria). As described below, the alert score is represented in the analysis user interface by an indicator, icon, color, and/or the like. An analyst may sort alerts/clusters based on the alert scores so as to enable an efficient investigation of more important alerts/clusters first.
[0214] In an embodiment, the alert score may be a metascore, and may be one of multiple values. For example, the alert score may be one of three values corresponding to, for example, a high alert, a medium alert, or a low alert. In other embodiments, the alert score may be partitioned into more or fewer values. Examples of various scores and metascores associated with various cluster strategies are described in the various related applications listed above and previously incorporated by reference herein. For example, in U.S. patent application Ser. No. 14/139,628, example cluster metascores are described in the contexts of tax fraud detection, beaconing malware detection, malware user-agent detection, and activity trend detection.
[0215] As mentioned above, in an embodiment, the alert score may be binned into one of three bins corresponding to a high alert, a medium alert, or a low alert. Each alert level may be associated with an indicator, icon, color, and/or the like. For example, a high alert may be associated with red (and/or another color), a medium alert may be associated with orange (and/or another color), and a low alert may be associated grey (and/or another color).
[0216] In an embodiment, the cluster alert score is determined based on and conveys both a determined importance/criticality (for example, a metascore comprising scores showing a high number of data items may indicate likely fraud) and a confidence level in the determined importance/criticality. For example:
[0217] A high alert may be indicated when:
-
- [0218] an importance metascore is above a particular threshold (for example, greater than 60%, or some other percent or number), AND a confidence level is above a particular threshold (for example, greater than 70%, or some other percent or number).
[0219] A medium alert may be indicated when:
-
- [0220] an importance metascore is below a particular threshold (for example, less than 60%, or some other percent or number), AND a confidence level is above a particular threshold (for example, greater than 70%, or some other percent or number), OR
- [0221] an importance metascore is above a particular threshold (for example, greater than 60%, or some other percent or number), AND a confidence level is below a particular threshold (for example, less than 30%, or some other percent or number).
[0222] A low alert may be indicated when:
-
- [0223] either an importance metascore is below a particular threshold (for example, less than 60%, or some other percent or number), OR a confidence level is below a particular threshold (for example, less than 30%, or some other percent or number).
[0224] In other embodiments, other criteria may be used to determine alert levels to provide to the end user, possibly based on additional or fewer parameters than discussed above. In some examples, alerts are associated with ranges of importance metascores and/or confidence levels, rather than only a minimum or maximum level of particular scores as in the examples above.
[0225] In an embodiment, a confidence level may be determined based on a false positive rate. The false positive rate may be based on, for example, historical information indicating how frequently other clusters having similar fraud indicators (for example, indicators used in the determination of the importance metascore) have been determined, after human analysis, to be critical or not consistent with the importance metascore. The false positive rate may also (or alternatively) be based on, for example, information provided from third-parties, such as blacklists that include a likelihood that any item on the blacklist is a false positive.
[0226] As mentioned above, in an embodiment the alert score may be based on one or more cluster scores and/or the analysis rules/criteria. In this embodiment, a high alert score may indicate a high degree of correlation between characteristics (for example, data and metadata) of the cluster and the analysis rules/criteria (that may, for example, indicate a likelihood of fraud, among other indications). Similarly, a low alert score may indicate a high degree of correlation between characteristics of the cluster and the analysis rules/criteria.
[0227] c. Example Analysis User Interfaces
[0228] FIGS. 11-20 illustrate example data cluster analysis user interfaces of the data analysis system, according to embodiments of the present disclosure. In various embodiments, aspects of the user interfaces may be rearranged from what is shown and described below, and/or particular aspects may or may not be included. However, the embodiments described below in reference to FIGS. 11-20 provides example analysis user interfaces of the system.
[0229] FIG. 11 illustrates a user interface 1102 of the system in which various indicators of alerts associated with various types of clusters are displayed, according to an embodiment. The user interface 1102 includes a panel 1104 including a listing of various cluster types 1106 (which are each associated with respective clustering strategies). Selection of one of the cluster types 1106 results in a display of indications of associated alerts in the panel 1112. In FIG. 11 , selection of “All” 1108 causes display of a combined list of indicators associated with all types of clusters in the panel 1112. Indicator 1110 shows a number of alerts among all the cluster types. In the panel 1112, at 1114 it is indicated that the present view is the “Inbox.” The Inbox includes indications of alerts that have not yet been “Archived” by the analyst (as described below). Alternatively, the Inbox may show indications of alerts that have not yet been viewed by the analyst.
[0230] At 1116 an indication of an alert is shown. As discussed above, each listed alert corresponds to a particular data item cluster that has been generated, analyzed, and scored. Various details related to the alert are displayed including an alert title (for example, “!! Activity summary for Acct#1074911”), an indication of a time 1118 when the event associated with the alert occurred (for example, “1 hour ago”), and an indication of the cluster type 1120 (for example, “SYNTHETICS”). The alert title may be a single, human-readable summary phrase or sentence, and may be generated similar to the generation of conclusions described above, and/or may be (or include) one of the conclusions described above. In the example shown, the alert 1116 is related to identification of fraudulent bank accounts, and the alert title indicates the number of the primary bank account associated with the cluster. Additionally, the “!!” symbol shown at the beginning of the alert title provides an indication of the alert score of the alert. In the example shown, a “!!” indicated a medium risk level, a “!!!” indicates a high risk level, and no symbol indicates a low risk level. In other embodiments the alert level of an alert may be indicated by an icon and/or coloring of the alert indicator, among other indications. The analyst may select any of the listed alert indicators to view additional detail related to the selected alert. In an embodiment, the list of alert indicators may automatically be sorted according to one or more criteria, for example, the alert score. In an embodiment, the analysis may choose to sort the list of alert indicators as desired. In an embodiment, the time 1118 may be a time when the alert was generated, rather than the time the event associated with the alert occurred. In another embodiment, the time 1118 may include both the time the alert was generated and the time the event associated with the alert occurred.
[0231] FIG. 12 illustrates a user interface 1202 of the system in which a particular selected alert is displayed, according to an embodiment. The upper portion 1203 of the user interface may be colored to correspond to the alert score, as described above. At 1204 the alert title is displayed. A unique icon 1205 associated with the cluster types may be displayed. At 1206, an indication of the cluster type is given, as well as a unique identifier of the alert (for example, “#116,” which may be useful for further investigation, note taking, and/or sharing by the analyst). At 1208 various conclusions (generated as described above) associated with the cluster are displayed. For example, in the cluster represented by the alert shown, the conclusions indicate that there have been no money transfers to other accounts, there are 13 transactions, the largest transaction is $9,897.61, and 2 online accounts have been accessed by 29 computers. Such information may be helpful to an analyst in evaluating whether or not the alert includes accounts associated with fraudulent identities (also referred to as synthetic identities).
[0232] Selectable buttons 1210 and 1212 (and/or other user interface elements) are displayed by which the analyst may access detailed cluster data. For example, the analyst may select “Latest Online Account Logins” button 1210 to view a listing of most recent account login data panel 1214. Similarly, the analyst may select “Latest Transactions” 1212 to view a listing of transaction data in the panel 1214. Additional buttons or controls may be included in the display such that the analyst may view other data related to the cluster. As shown, the data displayed in the panel 1214 may be organized in a table including columns and rows. Data displayed may be drawn from various data items and/or other information included in the cluster. The particular buttons (such as buttons 1210 and 1212) displayed in the alert may be defined by the clustering strategy and/or another set of rules related to the cluster type. FIG. 13 shows the same alert as shown in FIG. 12 , however the latest transactions button 1212 has been selected by the analyst, such that the information in panel 1214 is updated to show a listing of most recent transactions. In an embodiment, information shown in the panel 1214 may be automatically sorted chronologically from most recent event. Further the analyst may select the button 1302 to view further additional cluster data.
[0233] In other embodiments, the user interface may include links (for example, via buttons or other user interface elements) to relevant cluster information internal to an organization using the data analysis system, external to the organization, and/or other types information.
[0234] FIG. 14 illustrates a user interface 1402 of the system that is displayed when the show logs button 1302 (of FIG. 13 ) is selected, according to an embodiment. The user interface includes various cluster data and information 1404 organized in a table, a dropdown list of data types or sources 1406, a time filter 1408, and the button 1302 that may be selected to go back to the alert display of FIG. 12 or 13. The cluster data and information 1404 may be drawn from various data items and/or other information included in the cluster. The table shown is a stacked table, meaning that multiple differing types of data are displayed in the table, and the types of data displayed in a given column or row of the table may change within the given column or row. For example, as the dropdown 1406 indicates that all data types are displayed, the top portion of the table, as indicated by the left-most column, includes Address data items, the next portion of the table (below the top portion) includes Transaction data items, the next portion of the table includes Account data items, the next portion of the table includes Online Account data items, and the bottom portion of the table includes Customer data items. The analyst or other user may scroll down the table to view additional table entries, and/or may scroll horizontally to view additional columns of the table. In various embodiments the table may or may not be sorted by default in a chronological order, and the columns may or may not be arranged such that the first column for each data type is a timestamp. In an embodiment, information displayed in the table is raw data drawn from entries associated with data items of the cluster.
[0235] FIG. 15 illustrates the same user interface as shown in FIG. 14 , but shows various changes made by the analyst, according to an embodiment. For example, the analyst has selected the dropdown box 1406 to view the various types of data that may be selected. Further, the analyst has moved a starting-time indicator 1502 on the time filter 1408. Moving the starting-time indicator 1502 causes the data displayed in the table to be filtered to include only data that was produced and/or relates to items or events that occurred within a time span indicated by the starting-time indicator 1502 and an ending-time indicator 1504.
[0236] FIG. 16 illustrates the same user interface as shown in FIG. 14 , but shows various changes made by the analyst. For example, the analyst has selected to view only Transaction data items via the dropdown box 1406. Further, the analyst has adjusted the time filter 1408 to filter that data items for a different particular time span. Accordingly, the table 1602 only displayed Transaction information related to the specified time span.
[0237] FIG. 17 illustrates the same user interface as shown in FIG. 14 , but shows that the analyst may further filter the data displayed in the table by values in any of the columns. For example, a Type dropdown menu 1702 may be used by the analyst to specify particular types of transactions that are to be displayed in the table, such that other types of transactions are not displayed. The analyst may specify multiple types by selection and/or text input, and may selectively remove types that are selected.
[0238] FIG. 18 illustrates a user interface 1802 similar to the user interface of FIG. 11 , according to an embodiment. In the user interface of FIG. 18 , at 1804 the user has selected to view only indications of alerts of the type “Synthetics.” Additionally, FIG. 18 illustrates that the analyst may select multiple indications of alerts, as shown at 1806, such that multiple alerts may be “archived” simultaneously by selection of the archive button 1808. Archiving alerts causes the alerts to be removed from the “Inbox” display. As shown in user interface 1902 of FIG. 19 , the analyst may select to view “archived” alerts via the dropdown box 1904. Archived alerts are displayed in a list similar to the list of alerts provided in the Inbox. In an embodiment, archiving of alerts enables an analyst to indicate that they have reviewed a particular alert. The analyst may move the alert from the archive back to the inbox. Further, in other embodiments, alerts may be moved to additional categories (default and/or user defined), for example, a “Starred” category may be available. Archived alerts may automatically be moved back into the inbox when new data items are added to a cluster associated with an archived alert, such as when the cluster is regenerated, for example.
[0239] FIG. 20 illustrates a user interface 2002, similar to the user interface of FIG. 11 , in which the left panel 1104 has been collapsed (as indicated by 2004) to provide a more streamlined display for the analyst, according to an embodiment.
[0240] In an embodiment, the alert user interface, for example the user interface of FIG. 12 , may include user interface elements (such as buttons) selectable by the analyst to cause the system to archive an alert, categorize an alert, change an alert level, and/or share an alert with other analysts. In an embodiment, the alert user interface may include a button to add the cluster data items of a graph, as described in various related applications listed above and previously incorporated by reference herein. Further, the system may enable an analyst viewing a graph of data items to go to alerts representing clusters in which that data item is included.
[0241] In an embodiment, the analysis user interface, for example the user interface of FIG. 11 , may include further details related to each of the indicated alerts. For example, the user interface of FIG. 11 may include conclusions associated with each of the listed alert indications. Providing data to the analyst in this way may enable the analyst to efficiently evaluate clusters without necessarily viewing the alert user interface.
[0242] In an embodiment, the analysis user interface, for example the user interface of FIG. 11 , may include, in the list of indications of alerts, indications of events of interest to the analyst but generated by other processed. For example, the list may include indications of notices generated by third-party software (for example, a virus scanner).
[0243] d. Linking of Related Alerts/Clusters
[0244] FIG. 21 is a flowchart of an example method of linking related alerts or data clusters, according to an embodiment of the present disclosure. As described above, when clusters are regenerated, if two clusters of the same type have common data items, the two cluster of the same type may then be merged. However, when two clusters having different cluster types include common data items, they are not generally merged. In order to notify the analyst that two data clusters of different types have common data items, the example method of FIG. 21 may be executed by the system. Such a notification may advantageously enable an analyst, for example, to find additional connections in the context of an investigation. For example, the analyst may discover that an item of malware associated with a malware cluster is hosted at a website that is linked to by phishing emails in a phishing cluster.
[0245] In the example method of FIG. 21 , at block 2102, the system finds or determines clusters of different cluster types (for example, that were generated according to different clustering strategies) that have common data items (and/or other information). At optional block 2104, a link between the related clusters/alerts may be generated. FIG. 22 illustrates an example data cluster analysis user interface 2202 in which related alerts or data clusters are linked to one another, according to an embodiment of the present disclosure. As shown, at 2404 links from the current alert/cluster to two other related alerts/clusters is provided. The analyst may then select one of the links (for example, either “Cluster ABC” or “Cluster XYZ”) to view the alert pertaining to that cluster. In an embodiment, an indication of the common data items among the clusters is provided in the user interface.
[0246] Turning again to the example method of FIG. 21 , at optional block 2106 the clusters/alerts may be merged. For example, rather than simply linking among related alerts (as in FIG. 22 ), the system may combine the alerts into a single alert user interface.
[0247] Further, in the example method of FIG. 21 , at optional block 2108, the analyst may be notified when two clusters/alerts are linked or related. For example, the analyst may be notified via a popup message displaying in the analysis user interface, via an email or other message, and/or via any other appropriate communications method.
[0248] e. Regenerated Clusters/Alerts
[0249] In an embodiment, when a cluster is regenerated, as described above with reference to block 1006 of FIG. 10A , an alert may be updated, the analyst may be notified, and/or a new alert may be generated. FIG. 23 is a flowchart of an example method of updating alerts in response to cluster regeneration, according to an embodiment of the present disclosure. At block 2302 of the example method shown, a cluster has been regenerated. At block 2304, the system determines whether any changes have been made to the cluster (for example, any new data items added to the cluster). If not, then at block 2306 the alert corresponding to the cluster is not updated and the method ends. If so, then at block 2308 the system determines whether the analyst has viewed and/or archived the alert corresponding to the cluster. If not, then at block 2310 the alert is updated such that the cluster analysis is rerun, and the alert data (for example, the conclusions) is regenerated, on the new cluster including the new data items. In this block, as the analyst has not previously interacted with the alert, no notifications regarding changes to the alert/cluster are provided. If the analyst has viewed and/or archived the alert, then at blocks 2312 and 2314 the alert may be updated, changes to the alert may be shown in the alert user interface, and/or a new alert may be generated and links between the new and old alerts may be generated and provided in the alert user interfaces. For example, if the analyst was to select an old alert that had been superseded due to cluster regeneration, the system may automatically forward the analyst to the new alert and display a message such as “You have been redirected to the most recent version of this alert. Return to alert 277.” Selection of “Return to alert 277” may cause the old alert to be displayed, where a message may be included such as “There is a more recent version of this alert,” (which may link to the new alert).
[0250] In an embodiment, when regenerated clusters of a same cluster type are merged, alerts corresponding to those previous two clusters may be merged and updates may be displayed, and/or a new alert may be generated (and linked to from the old alerts) as described above.
[0251] In an embodiment, the system may provide a data feed including timely updates (including analysis information) on any changes to any previously generated clusters, and/or any newly generated clusters.
[0252] Additional Embodiments
[0253] Embodiments of the present disclosure have been described that relate to automatic generation of memory-efficient clustered data structures and, more specifically, to automatic selection of an initial data entity of interest, adding of the initial data entity to the memory-efficient clustered data structure, determining and adding one or more related data items to the cluster, analyzing the cluster based on one or more rules or criteria to generate human-readable conclusions, and providing an interactive user interface to an analyst. As described above, in various embodiments, a generated cluster may include far fewer data items as compared to a huge collection of data items that may or may not be related to one another. This may be because, for example, data items included in a cluster may only include those data items that are related to one another and which may be relevant to a particular investigation. Accordingly, in various embodiments, processing of generated clusters may be highly efficient because, for example, a given fraud investigation by an analyst may only require storage in memory of a single cluster data structure. Further, a number of data items in a cluster may be several orders of magnitude smaller than in the huge collection of data items that may or may not be related to one another because only data items related to each other are included in the cluster.
[0254] Additionally, the automated analysis and scoring of clusters (as mentioned above) may enable highly efficient evaluation of the various data clusters by a human analyst. For example, the interactive user interface us generated so as to enable an analyst to quickly view critical data clusters (as determined by the automated scoring), and then in response to analyst inputs, view and interact with the generated information (including, for example, the human-readable conclusions) associated with the clusters. In response to user inputs the user interface may be updated to display raw data associated with each of the generated clusters if the analyst desires to dive deeper into data associated with a given cluster.
[0255] While the foregoing is directed to various embodiments, other and further embodiments may be devised without departing from the basic scope thereof. For example, aspects of the present disclosure may be implemented in hardware or software or in a combination of hardware and software. An embodiment of the disclosure may be implemented as a program product for use with a computer system. The program(s) of the program product define functions of the embodiments (including the methods described herein) and may be contained on a variety of computer-readable storage media. Illustrative computer-readable storage media include, but are not limited to: (i) non-writable storage media (e.g., read-only memory devices within a computer such as CD-ROM disks readable by a CD-ROM drive, flash memory, ROM chips or any type of solid-state non-volatile semiconductor memory) on which information is permanently stored; and (ii) writable storage media (e.g., hard-disk drive or any type of solid-state random-access semiconductor memory) on which alterable information is stored. Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may alternatively be implemented partially or wholly in application-specific circuitry.
[0256] The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.
[0257] Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.
[0258] The term “comprising” as used herein should be given an inclusive rather than exclusive interpretation. For example, a general purpose computer comprising one or more processors should not be interpreted as excluding other computer components, and may possibly include such components as memory, input/output devices, and/or network interfaces, among others.
[0259] The term “continuous” as used herein, is a broad term encompassing its plain an ordinary meaning and, as used in reference to various types of activity (for example, scanning, monitoring, logging, and the like), includes without limitation substantially continuous activity and/or activity that may include periodic or intermittent pauses or breaks, but which accomplish the intended purposes described (for example, continuous scanning may include buffering and/or storage of data that is thereafter processed, for example, in batch and/or the like).
[0260] Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.
[0261] It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention may be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.
Claims
What is claimed is:
1. A computer system for efficiently analyzing large amounts of malfeasance-related data, the computer system comprising:
one or more computer readable storage devices configured to store:
a plurality of computer executable instructions;
one or more software modules including the plurality of computer executable instructions, the one or more software modules including a cluster engine module, a user interface engine module, and a workflow engine module;
a plurality of data clustering strategies based on rules generated by the cluster engine module; and
a plurality of data cluster types, each data cluster type of the plurality of data cluster types associated with a data clustering strategy of the plurality of data clustering strategies;
one or more cluster data sources configured to store malfeasance-related data items, the malfeasance-related data items including at least one of: electronic documents, accounts, profiles, alerts, records, or communications; and
one or more hardware computer processors in communication with the one or more computer readable storage devices and the one or more cluster data sources, and configured to execute the one or more software modules in order to cause the computer system to:
designate, by the cluster engine module, one or more seeds by:
accessing, from the one or more cluster data sources, the malfeasance-related data items; and
selecting one or more data items from the accessed malfeasance-related data items based at least on a property value of at least one electronic document, account, profile, alert, record, or communication of the one or more data items evidencing suspicious behavior or a likelihood of fraud or criminal activity, and designating each data item of the one or more data items as a seed;
for each data item seed of the one or more designated seeds:
select, by the cluster engine module, a particular data clustering strategy from the plurality of data clustering strategies;
identify, by the cluster engine module, one or more malfeasance-related data items based at least on the particular data clustering strategy, wherein the particular data clustering strategy queries the one or more cluster data sources to determine the one or more malfeasance-related data items associated with the data item seed; and
generate, by the cluster engine module, a data cluster based at least on the data item seed, wherein generating the data cluster comprises:
adding the data item seed to the data cluster;
adding the one or more malfeasance-related data items identified as being associated with the data item seed to the data cluster;
identifying an additional one or more data items associated with any data items of the data cluster;
adding the additional one or more data items to the data cluster; and
storing the generated data cluster in the one or more computer readable storage devices;
generate, by the user interface engine module, at least one human-readable conclusion associated with at least one generated data cluster, wherein generating the at least one human-readable conclusion comprises:
determining a particular data cluster type from the plurality of cluster types based at least on the particular data clustering strategy;
identifying one or more human-readable templates comprising pre-generated text, wherein identifying the human-readable templates is based at least on predefined associations between respective human-readable templates and data cluster types, and the particular data cluster type;
automatically analyzing the at least one generated data cluster to generate summary data according to rules, scoring algorithms, or other criteria; and
populating the identified one or more human-readable templates with data from the at least one generated data cluster or summary data of the at least one generated data cluster;
cause presentation, by the user interface engine module, of the at least one generated data cluster and the at least one human-readable conclusion including the populated pre-generated text data, in a user interface of a client computing device; and
generate, by the workflow engine and the user interface engine, an interactive workflow process to allow the user to perform at least one of: select new seeds, operate on existing seeds, generate new data clusters, or regenerate existing clusters.
2. The computer system of claim 1, wherein the one or more hardware computer processors are further configured to execute the one or more software modules in order to cause the computer system to:
for each generated data cluster:
determine a data cluster type associated with the generated data cluster;
analyze the generated data cluster based at least on data cluster analysis rules associated with the data cluster type; and
determine an alert score for the generated data cluster based on the analysis of the generated data cluster, wherein the alert score indicates a degree of correlation between characteristics of the generated data cluster and the data cluster analysis rules.
3. The computer system of claim 2, wherein the degree of correlation is based on both an assessment of risk associated with the generated data cluster and a confidence level in accuracy of the assessment of risk.
4. The computer system of claim 2, wherein a relatively higher alert score indicates a data cluster that is relatively more important for a human analyst to evaluate, and a relatively lower alert score indicates a data cluster that is relatively less important for the human analyst to evaluate.
5. The computer system of claim 2, wherein each alert score for respective data clusters is assigned to a category indicating a high degree of correlation, a medium degree of correlation, or a low degree of correlation.
6. The computer system of claim 5, wherein the high degree of correlation is associated with a first color, the medium degree of correlation is associated with a second color, and the low degree of correlation is associated with a third color.
7. The computer system of claim 2, wherein the one or more hardware computer processors are further configured to execute the one or more software modules in order to cause the computer system to, for each generated data cluster:
generate one or more human-readable conclusions regarding the generated data cluster;
generate an alert, the alert comprising the alert score, the one or more human-readable conclusions, one or more data items associated with the generated data cluster, and metadata associated with each of the one or more data items.
8. The computer system of claim 7, wherein the one or more hardware computer processors are further configured to execute the one or more software modules in order to cause the computer system to:
generate a second user interface including a list of user-selectable alert indicators, an alert indicator being provided for each of the generated alerts, each of the alert indicators providing a summary of information associated with respective generated alerts.
9. The computer system of claim 8, wherein the one or more hardware computer processors are further configured to execute the one or more software modules in order to cause the computer system to:
in response to a selection of an alert indicator by a human analyst:
generate an alert display, the alert display including at least an indication of the alert score and a list of the one or more human-readable conclusions.
10. The computer system of claim 9, wherein the alert display further includes a table of information associated with the one or more data items and associated metadata of the generated data cluster, and wherein the table of information includes a mixture of information of various types.
11. The computer system of claim 10, wherein the table of information includes one or more selectable user interface controls in order to filter according information type and/or time period.
12. The computer system of claim 9, wherein the one or more hardware computer processors are further configured to execute the one or more software modules in order to cause the computer system to, for each generated data cluster:
determine whether any other data cluster having a respective data cluster type different from the data cluster type of the generated data cluster is associated with a data item that is also associated with the generated data cluster.
13. The computer system of claim 12, wherein the alert display further indicates and provides a link to any of the other data clusters having the respective data cluster type different from the data cluster type of the generated data cluster and determined to be associated with the data item that is also associated with the generated data cluster of the alert display.
14. The computer system of claim 9, wherein a notification is provided to a human analyst via the alert display when the generated data cluster associated with the alert display has been regenerated such that the generated data cluster is changed.
Patent Citations (314)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5109399(A) | 1992-04-01 | Thompson | Applicant |
| US5329108(A) | 1994-07-01 | Lamoure | Applicant |
| US5632009(A) | 1997-05-01 | Rao et al. | Applicant |
| US5670987(A) | 1997-09-01 | Doi et al. | Applicant |
| US5845300(A) | 1998-12-01 | Comer | Applicant |
| US6057757(A) | 2000-05-01 | Arrowsmith et al. | Applicant |
| US6091956(A) | 2000-07-01 | Hollenberg | Applicant |
| US6161098(A) | 2000-12-01 | Wallman | Applicant |
| US6219053(B1) | 2001-04-01 | Tachibana et al. | Applicant |
| US6232971(B1) | 2001-05-01 | Haynes | Applicant |
| US6247019(B1) | 2001-06-01 | Davies | Applicant |
| US6279018(B1) | 2001-08-01 | Kudrolli et al. | Applicant |
| US6341310(B1) | 2002-01-01 | Leshem et al. | Applicant |
| US6369835(B1) | 2002-04-01 | Lin | Applicant |
| US6549944(B1) | 2003-04-01 | Weinberg et al. | Applicant |
| US6567936(B1) | 2003-05-01 | Yang et al. | Applicant |
| US6581068(B1) | 2003-06-01 | Bensoussan et al. | Applicant |
| US6631496(B1) | 2003-10-01 | Li et al. | Applicant |
| US6714936(B1) | 2004-03-01 | Nevin, III | Applicant |
| US6775675(B1) | 2004-08-01 | Nwabueze et al. | Applicant |
| US6839745(B1) | 2005-01-01 | Dingari et al. | Applicant |
| US6877137(B1) | 2005-04-01 | Rivette et al. | Applicant |
| US6976210(B1) | 2005-12-01 | Silva et al. | Applicant |
| US6985950(B1) | 2006-01-01 | Hanson et al. | Applicant |
| US7036085(B2) | 2006-04-01 | Barros | Applicant |
| US7043702(B2) | 2006-05-01 | Chi et al. | Applicant |
| US7055110(B2) | 2006-05-01 | Kupka et al. | Applicant |
| US7139800(B2) | 2006-11-01 | Bellotti et al. | Applicant |
| US7158878(B2) | 2007-01-01 | Rasmussen et al. | Applicant |
| US7162475(B2) | 2007-01-01 | Ackerman | Applicant |
| US7168039(B2) | 2007-01-01 | Bertram | Applicant |
| US7171427(B2) | 2007-01-01 | Witowski et al. | Applicant |
| US7269786(B1) | 2007-09-01 | Malloy et al. | Applicant |
| US7278105(B1) | 2007-10-01 | Kitts | Applicant |
| US7290698(B2) | 2007-11-01 | Poslinski et al. | Applicant |
| US7333998(B2) | 2008-02-01 | Heckerman et al. | Applicant |
| US7373669(B2) | 2008-05-01 | Eisen | Applicant |
| US7379811(B2) | 2008-05-01 | Rasmussen et al. | Applicant |
| US7379903(B2) | 2008-05-01 | Caballero et al. | Applicant |
| US7426654(B2) | 2008-09-01 | Adams et al. | Applicant |
| US7451397(B2) | 2008-11-01 | Weber et al. | Applicant |
| US7454466(B2) | 2008-11-01 | Bellotti et al. | Applicant |
| US7467375(B2) | 2008-12-01 | Tondreau et al. | Applicant |
| US7502786(B2) | 2009-03-01 | Liu et al. | Applicant |
| US7525422(B2) | 2009-04-01 | Bishop et al. | Applicant |
| US7529727(B2) | 2009-05-01 | Arning et al. | Applicant |
| US7558677(B2) | 2009-07-01 | Jones | Applicant |
| US7574409(B2) | 2009-08-01 | Patinkin | Examiner |
| US7574428(B2) | 2009-08-01 | Leiserowitz et al. | Applicant |
| US7617232(B2) | 2009-11-01 | Gabbert et al. | Applicant |
| US7620628(B2) | 2009-11-01 | Kapur et al. | Applicant |
| US7627812(B2) | 2009-12-01 | Chamberlain et al. | Applicant |
| US7634717(B2) | 2009-12-01 | Chamberlain et al. | Applicant |
| US7703021(B1) | 2010-04-01 | Flam | Applicant |
| US7712049(B2) | 2010-05-01 | Williams et al. | Applicant |
| US7716077(B1) | 2010-05-01 | Mikurak | Applicant |
| US7725547(B2) | 2010-05-01 | Albertson et al. | Applicant |
| US7770100(B2) | 2010-08-01 | Chamberlain et al. | Applicant |
| US7783658(B1) | 2010-08-01 | Bayliss | Applicant |
| US7809703(B2) | 2010-10-01 | Balabhadrapatruni et al. | Applicant |
| US7814102(B2) | 2010-10-01 | Miller et al. | Applicant |
| US7818658(B2) | 2010-10-01 | Chen | Applicant |
| US7894984(B2) | 2011-02-01 | Rasmussen et al. | Applicant |
| US7899611(B2) | 2011-03-01 | Downs et al. | Applicant |
| US7917376(B2) | 2011-03-01 | Bellin et al. | Applicant |
| US7920963(B2) | 2011-04-01 | Jouline et al. | Applicant |
| US7933862(B2) | 2011-04-01 | Chamberlain et al. | Applicant |
| US7962281(B2) | 2011-06-01 | Rasmussen et al. | Applicant |
| US7962848(B2) | 2011-06-01 | Bertram | Applicant |
| US8001465(B2) | 2011-08-01 | Kudrolli et al. | Applicant |
| US8001482(B2) | 2011-08-01 | Bhattiprolu et al. | Applicant |
| US8010545(B2) | 2011-08-01 | Stefik et al. | Applicant |
| US8015487(B2) | 2011-09-01 | Roy et al. | Applicant |
| US8024778(B2) | 2011-09-01 | Cash et al. | Applicant |
| US8036632(B1) | 2011-10-01 | Cona et al. | Applicant |
| US8046362(B2) | 2011-10-01 | Bayliss | Applicant |
| US8103543(B1) | 2012-01-01 | Zwicky | Applicant |
| US8134457(B2) | 2012-03-01 | Velipasalar et al. | Applicant |
| US8135679(B2) | 2012-03-01 | Bayliss | Applicant |
| US8135719(B2) | 2012-03-01 | Bayliss | Applicant |
| US8145703(B2) | 2012-03-01 | Frishert et al. | Applicant |
| US8214361(B1) | 2012-07-01 | Sandler et al. | Applicant |
| US8214764(B2) | 2012-07-01 | Gemmell et al. | Applicant |
| US8225201(B2) | 2012-07-01 | Michael | Applicant |
| US8229947(B2) | 2012-07-01 | Fujinaga | Applicant |
| US8230333(B2) | 2012-07-01 | Decherd et al. | Applicant |
| US8266168(B2) | 2012-09-01 | Bayliss | Applicant |
| US8280880(B1) | 2012-10-01 | Aymeloglu et al. | Applicant |
| US8290942(B2) | 2012-10-01 | Jones et al. | Applicant |
| US8301464(B1) | 2012-10-01 | Cave et al. | Applicant |
| US8321943(B1) | 2012-11-01 | Walters et al. | Applicant |
| US8347398(B1) | 2013-01-01 | Weber | Applicant |
| US8352881(B2) | 2013-01-01 | Champion et al. | Applicant |
| US8368695(B2) | 2013-02-01 | Howell et al. | Applicant |
| US8397171(B2) | 2013-03-01 | Klassen et al. | Applicant |
| US8412707(B1) | 2013-04-01 | Mianji | Applicant |
| US8447674(B2) | 2013-05-01 | Choudhuri et al. | Applicant |
| US8447722(B1) | 2013-05-01 | Ahuja et al. | Applicant |
| US8452790(B1) | 2013-05-01 | Mianji | Applicant |
| US8463036(B1) | 2013-06-01 | Ramesh et al. | Applicant |
| US8484168(B2) | 2013-07-01 | Bayliss | Applicant |
| US8489331(B2) | 2013-07-01 | Kopf et al. | Applicant |
| US8489641(B1) | 2013-07-01 | Seefeld et al. | Applicant |
| US8495077(B2) | 2013-07-01 | Bayliss | Applicant |
| US8498969(B2) | 2013-07-01 | Bayliss | Applicant |
| US8498984(B1) | 2013-07-01 | Hwang et al. | Applicant |
| US8514082(B2) | 2013-08-01 | Cova et al. | Applicant |
| US8515207(B2) | 2013-08-01 | Chau | Applicant |
| US8554579(B2) | 2013-10-01 | Tribble et al. | Applicant |
| US8554653(B2) | 2013-10-01 | Falkenborg et al. | Examiner |
| US8577911(B1) | 2013-11-01 | Stepinski et al. | Applicant |
| US8589273(B2) | 2013-11-01 | Creeden et al. | Applicant |
| US8600872(B1) | 2013-12-01 | Yan | Applicant |
| US8620641(B2) | 2013-12-01 | Farnsworth et al. | Applicant |
| US8689108(B1) | 2014-04-01 | Duffield et al. | Applicant |
| US8713467(B1) | 2014-04-01 | Goldenberg et al. | Applicant |
| US8739278(B2) | 2014-05-01 | Varghese | Applicant |
| US8745516(B2) | 2014-06-01 | Mason et al. | Applicant |
| US8781169(B2) | 2014-07-01 | Jackson et al. | Applicant |
| US8788405(B1) | 2014-07-01 | Sprague et al. | Applicant |
| US8788407(B1) | 2014-07-01 | Singh et al. | Applicant |
| US8799799(B1) | 2014-08-01 | Cervelli et al. | Applicant |
| US8812960(B1) | 2014-08-01 | Sun et al. | Applicant |
| US8818892(B1) | 2014-08-01 | Sprague et al. | Applicant |
| US8832594(B1) | 2014-09-01 | Thompson et al. | Applicant |
| US2001/0021936(A1) | 2001-09-01 | Bertram | Applicant |
| US2002/0091707(A1) | 2002-07-01 | Keller | Applicant |
| US2002/0095658(A1) | 2002-07-01 | Shulman | Applicant |
| US2002/0116120(A1) | 2002-08-01 | Ruiz et al. | Applicant |
| US2002/0130907(A1) | 2002-09-01 | Chi et al. | Applicant |
| US2002/0174201(A1) | 2002-11-01 | Ramer et al. | Applicant |
| US2003/0039948(A1) | 2003-02-01 | Donahue | Applicant |
| US2003/0097330(A1) | 2003-05-01 | Hillmer et al. | Applicant |
| US2003/0144868(A1) | 2003-07-01 | MacIntyre et al. | Applicant |
| US2003/0163352(A1) | 2003-08-01 | Surpin et al. | Applicant |
| US2003/0200217(A1) | 2003-10-01 | Ackerman | Applicant |
| US2003/0225755(A1) | 2003-12-01 | Iwayama et al. | Applicant |
| US2004/0064256(A1) | 2004-04-01 | Barinek et al. | Applicant |
| US2004/0085318(A1) | 2004-05-01 | Hassler et al. | Applicant |
| US2004/0095349(A1) | 2004-05-01 | Bito et al. | Applicant |
| US2004/0143602(A1) | 2004-07-01 | Ruiz et al. | Applicant |
| US2004/0181554(A1) | 2004-09-01 | Heckerman et al. | Applicant |
| US2004/0205524(A1) | 2004-10-01 | Richter et al. | Applicant |
| US2004/0260702(A1) | 2004-12-01 | Cragun et al. | Applicant |
| US2005/0027705(A1) | 2005-02-01 | Sadri et al. | Applicant |
| US2005/0028094(A1) | 2005-02-01 | Allyn | Applicant |
| US2005/0080769(A1) | 2005-04-01 | Gemmell | Applicant |
| US2005/0086207(A1) | 2005-04-01 | Heuer et al. | Applicant |
| US2005/0125715(A1) | 2005-06-01 | Franco et al. | Applicant |
| US2005/0180330(A1) | 2005-08-01 | Shapiro | Applicant |
| US2005/0182793(A1) | 2005-08-01 | Keenan et al. | Applicant |
| US2005/0183005(A1) | 2005-08-01 | Denoue et al. | Applicant |
| US2005/0251786(A1) | 2005-11-01 | Citron et al. | Applicant |
| US2006/0026170(A1) | 2006-02-01 | Kreitler et al. | Applicant |
| US2006/0045470(A1) | 2006-03-01 | Poslinski et al. | Applicant |
| US2006/0059139(A1) | 2006-03-01 | Robinson | Applicant |
| US2006/0074866(A1) | 2006-04-01 | Chamberlain et al. | Applicant |
| US2006/0080619(A1) | 2006-04-01 | Carlson et al. | Applicant |
| US2006/0129746(A1) | 2006-06-01 | Porter | Applicant |
| US2006/0139375(A1) | 2006-06-01 | Rasmussen et al. | Applicant |
| US2006/0149596(A1) | 2006-07-01 | Surpin et al. | Applicant |
| US2006/0203337(A1) | 2006-09-01 | White | Applicant |
| US2006/0241974(A1) | 2006-10-01 | Chao et al. | Applicant |
| US2006/0271277(A1) | 2006-11-01 | Hu et al. | Applicant |
| US2007/0011150(A1) | 2007-01-01 | Frank | Applicant |
| US2007/0016363(A1) | 2007-01-01 | Huang et al. | Applicant |
| US2007/0038962(A1) | 2007-02-01 | Fuchs et al. | Applicant |
| US2007/0078832(A1) | 2007-04-01 | Ott et al. | Applicant |
| US2007/0192265(A1) | 2007-08-01 | Chopin et al. | Applicant |
| US2007/0208497(A1) | 2007-09-01 | Downs et al. | Applicant |
| US2007/0208498(A1) | 2007-09-01 | Barker et al. | Applicant |
| US2007/0266336(A1) | 2007-11-01 | Nojima et al. | Applicant |
| US2007/0294200(A1) | 2007-12-01 | Au | Applicant |
| US2007/0294643(A1) | 2007-12-01 | Kyle | Applicant |
| US2008/0040684(A1) | 2008-02-01 | Crump | Applicant |
| US2008/0051989(A1) | 2008-02-01 | Welsh | Applicant |
| US2008/0052142(A1) | 2008-02-01 | Bailey et al. | Applicant |
| US2008/0077597(A1) | 2008-03-01 | Butler | Applicant |
| US2008/0077642(A1) | 2008-03-01 | Carbone et al. | Applicant |
| US2008/0104019(A1) | 2008-05-01 | Nath | Applicant |
| US2008/0126951(A1) | 2008-05-01 | Sood et al. | Applicant |
| US2008/0133567(A1) | 2008-06-01 | Ames et al. | Applicant |
| US2008/0195417(A1) | 2008-08-01 | Surpin et al. | Applicant |
| US2008/0195608(A1) | 2008-08-01 | Clover | Applicant |
| US2008/0222295(A1) | 2008-09-01 | Robinson et al. | Applicant |
| US2008/0263468(A1) | 2008-10-01 | Cappione et al. | Applicant |
| US2008/0267107(A1) | 2008-10-01 | Rosenberg | Applicant |
| US2008/0278311(A1) | 2008-11-01 | Grange et al. | Applicant |
| US2008/0288306(A1) | 2008-11-01 | MacIntyre et al. | Applicant |
| US2008/0301643(A1) | 2008-12-01 | Appleton et al. | Applicant |
| US2009/0002492(A1) | 2009-01-01 | Velipasalar et al. | Applicant |
| US2009/0018940(A1) | 2009-01-01 | Wang et al. | Applicant |
| US2009/0027418(A1) | 2009-01-01 | Maru et al. | Applicant |
| US2009/0030915(A1) | 2009-01-01 | Winter et al. | Applicant |
| US2009/0044279(A1) | 2009-02-01 | Crawford et al. | Applicant |
| US2009/0076845(A1) | 2009-03-01 | Bellin et al. | Applicant |
| US2009/0083184(A1) | 2009-03-01 | Eisen | Applicant |
| US2009/0119309(A1) | 2009-05-01 | Gibson et al. | Applicant |
| US2009/0125369(A1) | 2009-05-01 | Kloostra et al. | Applicant |
| US2009/0132953(A1) | 2009-05-01 | Reed et al. | Applicant |
| US2009/0144262(A1) | 2009-06-01 | White et al. | Applicant |
| US2009/0164934(A1) | 2009-06-01 | Bhattiprolu et al. | Applicant |
| US2009/0171939(A1) | 2009-07-01 | Athsani et al. | Applicant |
| US2009/0192957(A1) | 2009-07-01 | Subramanian et al. | Applicant |
| US2009/0222400(A1) | 2009-09-01 | Kupershmidt et al. | Applicant |
| US2009/0234720(A1) | 2009-09-01 | George et al. | Applicant |
| US2009/0281839(A1) | 2009-11-01 | Lynn et al. | Applicant |
| US2009/0287470(A1) | 2009-11-01 | Farnsworth et al. | Applicant |
| US2009/0292626(A1) | 2009-11-01 | Oxford | Applicant |
| US2010/0011282(A1) | 2010-01-01 | Dollard et al. | Applicant |
| US2010/0042922(A1) | 2010-02-01 | Bradateanu et al. | Applicant |
| US2010/0057716(A1) | 2010-03-01 | Stefik et al. | Applicant |
| US2010/0070523(A1) | 2010-03-01 | Delgo et al. | Applicant |
| US2010/0070897(A1) | 2010-03-01 | Aymeloglu et al. | Applicant |
| US2010/0077483(A1) | 2010-03-01 | Stolfo et al. | Applicant |
| US2010/0122152(A1) | 2010-05-01 | Chamberlain et al. | Applicant |
| US2010/0125546(A1) | 2010-05-01 | Barrett et al. | Applicant |
| US2010/0131457(A1) | 2010-05-01 | Heimendinger | Applicant |
| US2010/0185691(A1) | 2010-07-01 | Irmak et al. | Applicant |
| US2010/0198684(A1) | 2010-08-01 | Eraker et al. | Applicant |
| US2010/0199225(A1) | 2010-08-01 | Coleman et al. | Applicant |
| US2010/0250412(A1) | 2010-09-01 | Wagner | Applicant |
| US2010/0280857(A1) | 2010-11-01 | Liu et al. | Applicant |
| US2010/0293174(A1) | 2010-11-01 | Bennett et al. | Applicant |
| US2010/0306029(A1) | 2010-12-01 | Jolley | Applicant |
| US2010/0306713(A1) | 2010-12-01 | Geisner et al. | Applicant |
| US2010/0321399(A1) | 2010-12-01 | Ellren et al. | Applicant |
| US2010/0325581(A1) | 2010-12-01 | Finkelstein et al. | Applicant |
| US2011/0047159(A1) | 2011-02-01 | Baid et al. | Applicant |
| US2011/0060753(A1) | 2011-03-01 | Shaked et al. | Applicant |
| US2011/0061013(A1) | 2011-03-01 | Bilicki et al. | Applicant |
| US2011/0074811(A1) | 2011-03-01 | Hanson et al. | Applicant |
| US2011/0087519(A1) | 2011-04-01 | Fordyce, III et al. | Applicant |
| US2011/0093327(A1) | 2011-04-01 | Fordyce et al. | Examiner |
| US2011/0119100(A1) | 2011-05-01 | Ruhl et al. | Applicant |
| US2011/0137766(A1) | 2011-06-01 | Rasmussen et al. | Applicant |
| US2011/0167105(A1) | 2011-07-01 | Ramakrishnan et al. | Applicant |
| US2011/0167493(A1) | 2011-07-01 | Song et al. | Applicant |
| US2011/0170799(A1) | 2011-07-01 | Carrino et al. | Applicant |
| US2011/0173093(A1) | 2011-07-01 | Psota et al. | Applicant |
| US2011/0178842(A1) | 2011-07-01 | Rane et al. | Applicant |
| US2011/0208724(A1) | 2011-08-01 | Jones et al. | Applicant |
| US2011/0231223(A1) | 2011-09-01 | Winters | Applicant |
| US2011/0238510(A1) | 2011-09-01 | Rowen et al. | Applicant |
| US2011/0238570(A1) | 2011-09-01 | Li et al. | Applicant |
| US2011/0291851(A1) | 2011-12-01 | Whisenant | Applicant |
| US2011/0307382(A1) | 2011-12-01 | Siegel et al. | Applicant |
| US2011/0310005(A1) | 2011-12-01 | Chen et al. | Applicant |
| US2012/0019559(A1) | 2012-01-01 | Siler et al. | Applicant |
| US2012/0036434(A1) | 2012-02-01 | Oberstein | Applicant |
| US2012/0066296(A1) | 2012-03-01 | Appleton et al. | Applicant |
| US2012/0079363(A1) | 2012-03-01 | Folting et al. | Applicant |
| US2012/0084135(A1) | 2012-04-01 | Nissan et al. | Applicant |
| US2012/0084866(A1) | 2012-04-01 | Stolfo | Applicant |
| US2012/0106801(A1) | 2012-05-01 | Jackson | Applicant |
| US2012/0144335(A1) | 2012-06-01 | Abeln et al. | Applicant |
| US2012/0159307(A1) | 2012-06-01 | Chung et al. | Applicant |
| US2012/0196557(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0196558(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0208636(A1) | 2012-08-01 | Feige | Applicant |
| US2012/0215898(A1) | 2012-08-01 | Shah et al. | Applicant |
| US2012/0221511(A1) | 2012-08-01 | Gibson et al. | Applicant |
| US2012/0221580(A1) | 2012-08-01 | Barney | Applicant |
| US2012/0246148(A1) | 2012-09-01 | Dror | Applicant |
| US2012/0290879(A1) | 2012-11-01 | Shibuya et al. | Applicant |
| US2012/0310831(A1) | 2012-12-01 | Harris et al. | Applicant |
| US2012/0310838(A1) | 2012-12-01 | Harris et al. | Applicant |
| US2012/0323888(A1) | 2012-12-01 | Osann, Jr. | Applicant |
| US2012/0330973(A1) | 2012-12-01 | Ghuneim et al. | Applicant |
| US2013/0006725(A1) | 2013-01-01 | Simanek et al. | Applicant |
| US2013/0024307(A1) | 2013-01-01 | Fuerstenberg et al. | Applicant |
| US2013/0024339(A1) | 2013-01-01 | Choudhuri et al. | Applicant |
| US2013/0046842(A1) | 2013-02-01 | Muntz et al. | Applicant |
| US2013/0061169(A1) | 2013-03-01 | Pearcy et al. | Applicant |
| US2013/0073377(A1) | 2013-03-01 | Heath | Applicant |
| US2013/0078943(A1) | 2013-03-01 | Biage et al. | Applicant |
| US2013/0097482(A1) | 2013-04-01 | Marantz et al. | Applicant |
| US2013/0101159(A1) | 2013-04-01 | Chao et al. | Applicant |
| US2013/0150004(A1) | 2013-06-01 | Rosen | Applicant |
| US2013/0151388(A1) | 2013-06-01 | Falkenborg et al. | Examiner |
| US2013/0160120(A1) | 2013-06-01 | Malaviya et al. | Applicant |
| US2013/0176321(A1) | 2013-07-01 | Mitchell et al. | Applicant |
| US2013/0179420(A1) | 2013-07-01 | Park et al. | Applicant |
| US2013/0211985(A1) | 2013-08-01 | Clark et al. | Applicant |
| US2013/0224696(A1) | 2013-08-01 | Wolfe et al. | Applicant |
| US2013/0232045(A1) | 2013-09-01 | Tai et al. | Applicant |
| US2013/0238616(A1) | 2013-09-01 | Rose et al. | Applicant |
| US2013/0262527(A1) | 2013-10-01 | Hunter et al. | Applicant |
| US2013/0268520(A1) | 2013-10-01 | Fisher et al. | Applicant |
| US2013/0282696(A1) | 2013-10-01 | John et al. | Applicant |
| US2013/0290011(A1) | 2013-10-01 | Lynn et al. | Applicant |
| US2013/0290825(A1) | 2013-10-01 | Arndt et al. | Applicant |
| US2013/0297619(A1) | 2013-11-01 | Chandrasekaran et al. | Applicant |
| US2013/0318594(A1) | 2013-11-01 | Hoy et al. | Applicant |
| US2013/0339218(A1) | 2013-12-01 | Subramanian et al. | Applicant |
| US2014/0006109(A1) | 2014-01-01 | Callioni et al. | Applicant |
| US2014/0019936(A1) | 2014-01-01 | Cohanoff | Applicant |
| US2014/0032506(A1) | 2014-01-01 | Hoey et al. | Applicant |
| US2014/0033010(A1) | 2014-01-01 | Richardt et al. | Applicant |
| US2014/0047357(A1) | 2014-02-01 | Alfaro et al. | Applicant |
| US2014/0068487(A1) | 2014-03-01 | Steiger et al. | Applicant |
| US2014/0108380(A1) | 2014-04-01 | Gotz et al. | Applicant |
| US2014/0108985(A1) | 2014-04-01 | Scott et al. | Applicant |
| US2014/0157172(A1) | 2014-06-01 | Peery et al. | Applicant |
| US2014/0195515(A1) | 2014-07-01 | Baker et al. | Applicant |
| EP1191463 | 2002-03-01 | Applicant | |
| EP1672527 | 2006-06-01 | Applicant | |
| EP2551799 | 2013-01-01 | Applicant | |
| WO2005/104736 | 2005-11-01 | Applicant | |
| WO2008/011728 | 2008-01-01 | Applicant | |
| WO2009/061501 | 2009-05-01 | Applicant | |
| WO2010/000014 | 2010-01-01 | Applicant | |
| WO2010/030913 | 2010-03-01 | Applicant | |
| WO2013/126281 | 2013-08-01 | Applicant |
Non-Patent Literature (49)
- “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.Applicant
- “A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.Applicant
- Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.Applicant
- Alfred, Rayner “Summarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering Techniques”, Journal of Computer Science, 2010, vol. 6, No. 7, pp. 775-784.Applicant
- Ananiev et al., “The New Modality API,” http://web.archive.org/web/20061211011958/http://java.sun.com/developer/technicalArticles/J2SE/Desktop/javase6/modality/ Jan. 21, 2006, pp. 8.Applicant
- Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.Applicant
- Bugzilla@Mozilla, “Bug 18726—[feature] Long-click means of invoking contextual menus not supported,” http://bugzilla.mozilla.org/show—bug.cgi?id=18726 printed Jun. 13, 2013 in 11 pages.Applicant
- Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10.Applicant
- Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152.Applicant
- Conner, Nancy, “Google Apps: The Missing Manual,” Sharing and Collaborating on Documents, May 1, 2008, pp. 93-97, 106-113 & 120-121.Applicant
- Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” Biolnformatics, vol. 23, No. 6, 2007, pp. 673-679.Applicant
- Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine, Jul. 2, 2005 in 10 pages, http://www.directionsmag.com/articles/retail-trade-area-analysis-using-the-huff-model/123411.Applicant
- GIS-NET 3 Public—Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3—Public/Viewer.html.Applicant
- Goswami, Gautam, “Quite ‘Writely’ Said!” One Brick at a Time, Aug. 21, 2005, pp. 7.Applicant
- Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.Applicant
- Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Elsevier Science, Sep. 2010, Ch. 4 & 10, pp. 53-67 & 143-164.Applicant
- Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16.Applicant
- Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.Applicant
- Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.Applicant
- Kahan et al., “Annotea: An Open RDF Infrastructure for Shared WEB Annotations”, Computer Networks, 2002, vol. 39, pp. 589-608.Applicant
- Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf downloaded May 12, 2014 in 8 pages.Applicant
- Keylines.com, “KeyLines Datasheet,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf downloaded May 12, 2014 in 2 pages.Applicant
- Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf downloaded May 12, 2014 in 10 pages.Applicant
- Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21.Applicant
- Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8.Applicant
- Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15.Applicant
- Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.Applicant
- Manske, “File Saving Dialogs,” http://www.mozilla.org/editor/ui—specs/FileSaveDialogs.html, Jan. 20, 1999, pp. 7.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com.Applicant
- Microsoft—Developer Network, “Getting Started with VBA in Word 2010,” Apr. 2010, http://msdn.microsoft.com/en-us/library/ff604039%28v=office.14%29.aspx as printed Apr. 4, 2014 in 17 pages.Applicant
- Microsoft Office—Visio, “About connecting shapes,” http://office.microsoft.com/en-us/visio-help/about-connecting-shapes-HP085050369.aspx printed Aug. 4, 2011 in 6 pages.Applicant
- Microsoft Office—Visio, “Add and glue connectors with the Connector tool,” http://office.microsoft.com/en-us/visio-help/add-and-glue-connectors-with-the-connector-tool-HA010048532.aspx?CTT=1 printed Aug. 4, 2011 in 1 page.Applicant
- Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14.Applicant
- Rouse, Margaret, “OLAP Cube,” http://searchdatamanagement.techtarget.com/definition/OLAP-cube, Apr. 28, 2012, pp. 16.Applicant
- Shah, Chintan, “Periodic Connections to Control Server Offer New Way to Detect Botnets,” Oct. 24, 2013 in 6 pages, http://www.blogs.mcafee.com/mcafee-labs/periodic-links-to-control-server-offer-new-way-to-detect-botnets.Applicant
- Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.Applicant
- Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11.Applicant
- “The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29.Applicant
- Wiggerts, T.A., “Using Clustering Algorithms in Legacy Systems Remodularization,” Reverse Engineering, Proceedings of the Fourth Working Conference, Netherlands, Oct. 6-8, 1997, IEEE Computer Soc., pp. 33-43.Applicant
- International Search Report and Written Opinion in Application No. PCT/US2009/056703, dated Mar. 15, 2010.Applicant
- Official Communication in European Application No. EP 14158861.6 dated Jun. 16, 2014.Applicant
- Official Communication in New Zealand Application No. 622517 dated Apr. 3, 2014.Applicant
- Official Communication in New Zealand Application No. 624557 dated May 14, 2014.Applicant
- Official Communication in New Zealand Application No. 628263 dated Aug. 12, 2014.Applicant
- European Search Report in Application No. 14159535.5, dated May 22, 2014.Applicant
- Official Communication in New Zealand Application No. 622181 dated Mar. 24, 2014.Applicant
- Official Communication in New Zealand Application No. 627962 dated Aug. 5, 2014.Applicant