# US 2018/0322398 A1 · Method, system, and algorithm to analyze data series to create a set of rules > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2018/0322398 A1 - Document ID: US20180322398A1 - Status: Published application - Kind: A1 - Application number: 15/969,362 - Filed: 2018-05-02 - Published: 2018-11-08 - Earliest claimed: 2017-05-03 - Inventors: Kenneth Mbale - Web page: https://patentgrep.com/patent/US20180322398A1 ## CPC - G06N 5/025: Extracting rules from data - G06F 18/217: {Validation; Performance evaluation; Active pattern learning techniques} - G06F 18/24143: {Distances to neighbourhood prototypes, e.g. restricted Coulomb energy networks [RCEN]} - G06F 18/285: {Selection of pattern recognition techniques, e.g. of classifiers in a multi-classifier system} - G06F 18/29: {Graphical models, e.g. Bayesian networks} - G06N 3/044: Recurrent networks, e.g. Hopfield networks - G06N 3/08: Learning methods - G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound - G06N 20/00: Machine learning - G06V 10/82: using neural networks - G06V 10/955: {using specific electronic processors} - G06V 30/1985: {Syntactic analysis, e.g. using a grammatical approach (syntactic image representation G06V30/18171)} - G06V 40/20: Movements or behaviour, e.g. gesture recognition (recognition of facial expressions G06V40/16) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING ## Abstract Disclosed is a method of analysing a data series. The method includes receiving, using a communication device, a data series and analyzing, using a processing device, the data series. Further, the method includes dynamically generating, using a processing device, one or more rules based on the analyzing, wherein the one or more rules form a grammar, wherein the grammar is represented as a directed graph. Moreover, the method includes assigning one or more cycle values for one or more cycles in the directed graph to obtain an enhanced directed graph. A cycle in the one or more cycles is a path that leads back to a root node, wherein one or more charge values are assigned to the one or more cycles. Further, the method includes storing, using a storage device, the one or more rules, the one or more cycle values and the one or more charge values. ## Claims ### Claim 1 A method of analysing a data series, the method comprising: receiving, using a communication device, a data series; analyzing, using a processing device, the data series; dynamically generating, using a processing device, one or more rules based on the analyzing, wherein the one or more rules form a grammar, wherein the grammar is represented as a directed graph comprising one or more nodes and one or more edges, wherein the one or more nodes representing the one or more rules, wherein the one or more edges forming a unique path through the one or more nodes; assigning one or more cycle values for one or more cycles in the directed graph to obtain an enhanced directed graph, wherein a cycle in the one or more cycles is a path that leads back to a root node, wherein one or more charge values are assigned to the one or more cycles; and storing, using a storage device, the one or more rules, the one or more cycle values and the one or more charge values. ### Claim 2 (depends on 1) The method of claim 1, wherein the data series is processed before the data series is received at the communication device. ### Claim 3 (depends on 1) The method of claim 1, wherein the data series includes a sequence of tokens, wherein a token in the sequence of tokens is a raw datum. ### Claim 4 (depends on 1) The method of claim 1, wherein the data series includes one or more patterns, wherein a pattern in the one or more patterns is one of a reflexive pattern, a periodic pattern, a cyclical pattern, a hybrid pattern and a seasonal pattern. ### Claim 5 (depends on 4) The method of claim 4, wherein the analyzing the data series includes identifying, using a processing device, one or more patterns in the data series. ### Claim 6 (depends on 4) The method of claim 4, wherein the generating the one or more rules includes creating, using the processing device, a rule for each detected pattern. ### Claim 7 (depends on 1) The method of claim 1, wherein a rule in the one or more rules may include an indication of a symbol predicting a token, wherein the symbol is sequence of tokens. ### Claim 8 (depends on 1) The method of claim 1, wherein the graph is fully connected and all nodes in the one or more nodes are reachable. ### Claim 9 (depends on 1) The method of claim 1, wherein the grammar represents the static structure of the data series using the one or more rules and one or more paths, wherein a path in the one or more paths is a sequence of edges that leads back to a root node, wherein the enhanced directed graph captures both the static and dynamic structures of the data series. ### Claim 10 (depends on 1) The method of claim 1 further includes traversing the enhanced graph to regenerate the data series, wherein the traversing starts from the root node, wherein an initial charge value of each cycle in the one or more cycles is set to zero, wherein the one or more charge values are incremented by one each time the root node is reached during the traversing, wherein when a charge value in the one or more charge values reaches the corresponding cycle value, the respective cycle is traversed, wherein once a cycle in the one or more cycles is traversed, the corresponding charge value is set back to zero. ### Claim 11 A system of analysing a data series, the system comprising: a communication device configured to receive a data series; a processing device configured to: analyze the data series; dynamically generate one or more rules based on the analyzing, wherein the one or more rules form a grammar, wherein the grammar is represented as a directed graph comprising one or more nodes and one or more edges, wherein the one or more nodes representing the one or more rules, wherein the one or more edges forming a unique path through the one or more nodes; assign one or more cycle values for one or more cycles in the directed graph to obtain an enhanced directed graph, wherein a cycle in the one or more cycles is a path that leads back to a root node, wherein one or more charge values are assigned to the one or more cycles; and a storage device configured to store the one or more rules, the one or more cycle values and the one or more charge values. ### Claim 12 (depends on 11) The system of claim 11, wherein the data series is processed before the data series is received at the communication device. ### Claim 13 (depends on 11) The system of claim 11, wherein the data series includes a sequence of tokens, wherein a token in the sequence of tokens is a raw datum. ### Claim 14 (depends on 11) The system of claim 11, wherein the data series includes one or more patterns, wherein a pattern in the one or more patterns is one of a reflexive pattern, a periodic pattern, a cyclical pattern, a hybrid pattern and a seasonal pattern. ### Claim 15 (depends on 14) The system of claim 14, wherein the analyzing the data series includes identifying, using the processing device, one or more patterns in the data series. ### Claim 16 (depends on 14) The system of claim 14, wherein the generating the one or more rules includes creating, using the processing device, a rule for each detected pattern. ### Claim 17 (depends on 11) The system of claim 11, wherein a rule in the one or more rules may include an indication of a symbol predicting a token, wherein the symbol is sequence of tokens. ### Claim 18 (depends on 11) The system of claim 11, wherein the graph is fully connected and all nodes in the one or more nodes are reachable. ### Claim 19 (depends on 11) The system of claim 11, wherein the grammar represents the static structure of the data series using the one or more rules and one or more paths, wherein a path in the one or more paths is a sequence of edges that leads back to a root node, wherein the enhanced directed graph captures both the static and dynamic structures of the data series. ### Claim 20 (depends on 11) The system of claim 11, wherein the processing device is further configured to traverse the enhanced graph to regenerate the data series, wherein traversing the enhanced graph starts from the root node, wherein an initial charge value of each cycle in the one or more cycles is set to zero, wherein the one or more charge values are incremented by one each time the root node is reached during the traversing, wherein when a charge value in the one or more charge values reaches the corresponding cycle value, the respective cycle is traversed, wherein once a cycle in the one or more cycles is traversed, the corresponding charge value is set back to zero.