Social network aware pattern detection
First Claim
1. A method comprising:
- initiating graph pattern matching within an input graph that represents a social network, said graph pattern matching utilizing pre-defined social network analysis (SNA) metrics to provide a context for finding a true match, wherein the graph pattern matching locates one or more matched graphs within the input graph having similar inter-connections among nodes as a target graph pattern; and
analyzing each matched graph using SNA metrics-based context from at least one of local node attributes within the matched graph and non-local node attributes, external to the matched graph, to determine when the matched graph is a true match.
3 Assignments
0 Petitions
Accused Products
Abstract
Enabling dynamic, computer-driven, context-based detection of social network patterns within an input graph representing a social network. A Social Network Aware Pattern Detection (SNAP) system and method utilizes a highly-scalable, computationally efficient integration of social network analysis (SNA) and graph pattern matching. Social network interaction data is provided as an input graph having nodes and edges. The graph illustrates the connections and/or interactions between people, objects, events, and activities, and matches the interactions to a context. A sample graph pattern of interest is identified and/or defined by the user of the application. With this sample graph pattern and the input graph, a computational analysis is completed to (1) determine when a match of the sample graph pattern is found, and more importantly, (2) assign a weight (or score) to the particular match, according to a pre-defined criteria or context.
54 Citations
44 Claims
-
1. A method comprising:
-
initiating graph pattern matching within an input graph that represents a social network, said graph pattern matching utilizing pre-defined social network analysis (SNA) metrics to provide a context for finding a true match, wherein the graph pattern matching locates one or more matched graphs within the input graph having similar inter-connections among nodes as a target graph pattern; and analyzing each matched graph using SNA metrics-based context from at least one of local node attributes within the matched graph and non-local node attributes, external to the matched graph, to determine when the matched graph is a true match. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A computer program product comprising:
-
a non-transitory computer readable medium; and program code on the non-transitory computer readable medium that when executed provides the functions of; initiating graph pattern matching within an input graph that represents a social network, said graph pattern matching utilizing pre-defined social network analysis (SNA) metrics to provide a context for finding a true match, wherein the graph pattern matching locates one or more matched graphs within the input graph having similar inter-connections among nodes as a target graph pattern; and analyzing each matched graph using SNA metrics-based context from at least one of local node attributes within the matched graph and non-local node attributes, external to the matched graph, to determine when the matched graph is a true match. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29)
-
-
30. A system comprising:
-
a processor; a memory operatively connected to the processor; and a utility executing on the processor and which provides program means for; initiating graph pattern matching within an input graph that represents a social network, said graph pattern matching utilizing pre-defined social network analysis (SNA) metrics to provide a context for finding a true match, wherein the graph pattern matching locates one or more matched graphs within the input graph having similar inter-connections among nodes as a target graph pattern; and analyzing each matched graph using SNA metrics-based context from at least one of local node attributes within the matched graph and non-local node attributes, external to the matched graph, to determine when the matched graph is a true match. - View Dependent Claims (31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44)
-
Specification