# US 2012/0254176 A1 · System and method for streak discovery and prediction

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254176 A1
- Document ID: US20120254176A1
- Status: Published application
- Kind: A1
- Application number: 13/111,259
- Filed: 2011-05-19
- Published: 2012-10-04
- Earliest claimed: 2011-03-31
- Assignees: Infosys Technologies Limited
- Inventors: Satyabrata Pradhan; Radha Krishna Pisipati; Syed Mohammed
- Web page: https://patentgrep.com/patent/US20120254176A1

## CPC

- G06F 18/00: Pattern recognition
- G06F 2218/16: by matching signal segments
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The disclosed embodiment relates to identifying performance regions in time-series data. An exemplary method comprises identifying, with a computing device, one or more streaks in the time-series data based on at least one streak parameter, ranking, with a computing device, the identified streaks based on at least one characteristic of the identified streaks, and predicting, with a computing device, a future occurrence of at least one streak based on the characteristics of the identified streaks. The steps of identifying and ranking may be carried out using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method, and the step of predicting the future occurrence of at least one streak may comprise predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin. The disclosed embodiment also relates to a system and computer-readable code that can be used to implement the exemplary methods.

## Claims

### Claim 1

A method for identifying a streak in a data set, the method comprising:
identifying, by a computing device, a plurality of patterns within the data set;
converting, by a computing device, the data set into a linear graph including a plurality of nodes, wherein each node is assigned an initial value based on one of the patterns identified within the data set;
merging, by a computing device, one node with at least one adjacent node, thereby forming a merged node having an increased value based on the values of the first node and the adjacent node; and
identifying, by a computing device, a streak based on the value of the merged node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the data set includes time series data.

### Claim 3 (depends on 1)

The method of claim 1, wherein the data set includes binary data.

### Claim 4 (depends on 1)

The method of claim 1, wherein the initial value of each node is based on a group of data points within the data set.

### Claim 5 (depends on 1)

The method of claim 1, wherein the steps of merging and identifying are repeated until at least one streak condition is satisfied.

### Claim 6 (depends on 5)

The method of claim 5, wherein the streak condition corresponds to at least one of threshold performance, streak size, or streak separation.

### Claim 7

A system for identifying a streak in a data set, the system comprising:
a computing device configured to identify a plurality of patterns within the data set;
a computing device configured to convert the data set into a linear graph including a plurality of nodes, wherein each node is assigned an initial value based on one of the patterns identified within the data set;
a computing device configured to merge one node with at least one adjacent node, thereby forming a merged node having an increased value based on the values of the first node and the adjacent node; and
a computing device configured to identify a streak based on the value of the merged node.

### Claim 8 (depends on 7)

The system of claim 7, wherein the data set includes time series data.

### Claim 9 (depends on 7)

The system of claim 7, wherein the data set includes binary data.

### Claim 10 (depends on 7)

The system of claim 7, wherein the initial value of each node is based on a group of data points within the data set.

### Claim 11 (depends on 7)

The system of claim 7, wherein the steps of merging and identifying are repeated until at least one streak condition is satisfied.

### Claim 12 (depends on 11)

The method of claim 11, wherein the streak condition corresponds to at least one of threshold performance, streak size, or streak separation.

### Claim 13

Computer-readable code stored on a computer-readable medium that, when executed by a processor, performs a method for identifying a streak in a data set, the method comprising:
identifying, with a computing device, a plurality of patterns within the data set;
converting, with a computing device, the data set into a linear graph including a plurality of nodes, wherein each node is assigned an initial value based on one of the patterns identified within the data set;
merging, with a computing device, one node with at least one adjacent node, thereby forming a merged node having an increased value based on the values of the first node and the adjacent node; and
identifying, with a computing device, a streak based on the value of the merged node.

### Claim 14 (depends on 13)

The computer-readable code of claim 13, wherein the data set includes time series data.

### Claim 15 (depends on 13)

The computer-readable code of claim 13, wherein the data set includes binary data.

### Claim 16 (depends on 13)

The computer-readable code of claim 13, wherein the initial value of each node is based on a group of data points within the data set.

### Claim 17 (depends on 13)

The computer-readable code of claim 13, wherein the steps of merging and identifying are repeated until at least one streak condition is satisfied.

### Claim 18 (depends on 17)

The computer-readable code of claim 17, wherein the streak condition corresponds to at least one of threshold performance, streak size, or streak separation.

### Claim 19

A method for identifying performance regions in time-series data, the method comprising:
identifying, with a computing device, one or more streaks in the time-series data based on at least one streak parameter;
ranking, with a computing device, the identified streaks based on at least one characteristic of the identified streaks; and
predicting, with a computing device, a future occurrence of at least one streak based on the characteristics of the identified streaks.

### Claim 20 (depends on 19)

The method of claim 19, wherein the streak parameters include a threshold performance parameter and a streak length parameter.

### Claim 21 (depends on 19)

The method of claim 19, wherein the steps of identifying and ranking are carried out using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method.

### Claim 22 (depends on 19)

The method of claim 19, wherein the characteristic used in the step of ranking the identified streaks includes the variations of the values inside the streaks.

### Claim 23 (depends on 19)

The method of claim 19, wherein the step of predicting the future occurrence of at least one streak comprises predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin.

### Claim 24

A system for identifying performance regions in time-series data, the system comprising:
a computing device configured to identify one or more streaks in the time-series data based on at least one streak parameter;
a computing device configured to configured to rank the identified streaks based on at least one characteristic of the identified streaks; and
a computing device configured to predict a future occurrence of at least one streak based on the characteristics of the identified streaks.

### Claim 25 (depends on 24)

The system of claim 24, wherein the streak parameters include a threshold performance parameter and a streak length parameter.

### Claim 26 (depends on 24)

The system of claim 24, wherein the computing devices configured to identify and rank are further configured to identify and rank using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method.

### Claim 27 (depends on 24)

The system of claim 24, wherein the characteristic used to rank the identified streaks includes the variations of the values inside the streaks.

### Claim 28 (depends on 24)

The system of claim 24, wherein the computing device configured to predict is further configured to predict the future occurrence of at least one streak by predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin.

### Claim 29

Computer-readable code stored on a computer-readable medium that, when executed by a processor, performs a method for identifying performance regions in time-series data, the method comprising:
identifying, with a computing device, one or more streaks in the time-series data based on at least one streak parameter;
ranking, with a computing device, the identified streaks based on at least one characteristic of the identified streaks; and
predicting, with a computing device, a future occurrence of at least one streak based on the characteristics of the identified streaks.

### Claim 30 (depends on 29)

The computer-readable code of claim 29, wherein the streak parameters include a threshold performance parameter and a streak length parameter.

### Claim 31 (depends on 29)

The computer-readable code of claim 29, wherein the steps of identifying and ranking are carried out using at least one of a linear graph method, a statistical based approach, a curve-line intersection method, and a hypothesis-based method.

### Claim 32 (depends on 29)

The computer-readable code of claim 29, wherein the characteristic used in the step of ranking the identified streaks includes the variations of the values inside the streaks.

### Claim 33 (depends on 29)

The computer-readable code of claim 29, wherein the step of predicting the future occurrence of at least one streak comprises predicting at least one of how long a current streak will continue, when a current streak will end, and when a new streak will begin.
