14. The non-transitory computer-readable medium of claim 12 , wherein the instruction further include instructions to: update the graph based on a secondary set of events including strengthening or weakening the arcs of the graph based on, in part, a presence or absence of a repeat pattern of vertices associated with the secondary set of events.
15. The non-transitory computer-readable medium of claim 14 , wherein each vertex is represented by a string representation, and the instructions to update the graph include: analyze the repeat pattern of vertices by searching the graph for a match with a search pattern that includes a concatenation of string representations corresponding to at least two temporally adjacent vertices associated with the secondary set of sets.