# US 2021/0342369 A1 · Method and system for implementing efficient classification and exploration of data

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

- Number: US 2021/0342369 A1
- Document ID: US20210342369A1
- Status: Published application
- Kind: A1
- Application number: 17/379,887
- Filed: 2021-07-19
- Published: 2021-11-04
- Earliest claimed: 2014-09-26
- Assignees: Oracle International Corporation
- Applicants: Oracle International Corporation
- Inventors: Konstantinos Morfonios; Mirza Mohsin Beg; Jae Young Yoon
- Web page: https://patentgrep.com/patent/US20210342369A1

## CPC

- G06F 11/0754: {by exceeding limits}
- G06F 16/285: {Clustering or classification}
- G06F 11/0766: {Error or fault reporting or storing}
- G06F 11/079: {Root cause analysis, i.e. error or fault diagnosis (in a hardware test environment G06F11/22; in a software test environment G06F11/36)}
- G06F 11/14: Error detection or correction of the data by redundancy in operations (error detection or correction of the data by redundancy in hardware G06F11/16)
- G06F 11/3072: {where the reporting involves data filtering, e.g. pattern matching, time or event triggered, adaptive or policy-based reporting}
- G06F 16/13: File access structures, e.g. distributed indices (arrangements of input from, or output to, record carriers G06F3/06)
- G06F 16/1734: {Details of monitoring file system events, e.g. by the use of hooks, filter drivers, logs}
- G06F 16/23: Updating
- G06F 16/355: Creation or modification of classes or clusters
- G06F 11/008: {Reliability or availability analysis}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Disclosed is a system, method, and computer program product for analyzing sets of data in an efficient manner, such that analytics can be effectively performed over that data. Classification operations can be performed to generate groups of similar log records. This permits classification of the log records in a cohesive and informative manner.

## Claims

### Claim 1

A method comprising:
identifying a plurality of groups of messages, wherein a group of messages within the plurality of groups of messages defines a sequence for messages associated with the group;
identifying a first set of one or more subsequences of messages based at least in part on a frequency with which the first set of one or more subsequences occurs in different groups of the plurality of groups of messages; and
performing at least one operation based on the first set of one or more subsequences of messages.

### Claim 2 (depends on 1)

The method of claim 1, wherein identifying the first set of one or more subsequences comprises applying a sliding window to the plurality of groups of messages.

### Claim 3 (depends on 2)

The method of claim 2, wherein the sliding window has a size that is defined based at least in part on user input.

### Claim 4 (depends on 2)

The method of claim 2, wherein applying the sliding window comprises generating a hash code for different subsequences of messages for varying offsets of the sliding window.

### Claim 5 (depends on 1)

The method of claim 1, wherein the first set of one or more subsequences of messages only includes subsequences of messages that satisfy a minimum frequency threshold.

### Claim 6 (depends on 1)

The method of claim 1, wherein the first set of one or more subsequences of messages include a set of top subsequences of messages sorted by frequency.

### Claim 7 (depends on 1)

The method of claim 1, wherein performing the at least one operation comprises presenting at least one of a trend or context for the plurality of groups of messages based at least in part on the first set of one or more subsequences of messages.

### Claim 8 (depends on 1)

The method of claim 1, wherein performing the at least one operation comprises detecting an anomaly on the one or more computing systems based at least in part on the first set of one or more subsequences of messages; and responsive to detecting the anomaly, triggering an alert.

### Claim 9 (depends on 1)

The method of claim 1, wherein the plurality of groups of messages comprise groups of uniform resource locators (URLs); the method further comprising assigning a classification to a set of URLs based on the first set of one or more subsequences of messages.

### Claim 10

A non-transitory computer-readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute operations comprising:
identifying a plurality of groups of messages, wherein a group of messages within the plurality of groups of messages defines a sequence for messages associated with the group;
identifying a first set of one or more subsequences of messages based at least in part on a frequency with which the first set of one or more subsequences occurs in different groups of the plurality of groups of messages; and
performing at least one operation based on the first set of one or more subsequences of messages.

### Claim 11 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein identifying the first set of one or more subsequences comprises applying a sliding window to the plurality of groups of messages.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein the sliding window has a size that is defined based at least in part on user input.

### Claim 13 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein applying the sliding window comprises generating a hash code for different subsequences of messages for varying offsets of the sliding window.

### Claim 14 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein the first set of one or more subsequences of messages only includes subsequences of messages that satisfy a minimum frequency threshold.

### Claim 15 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein the first set of one or more subsequences of messages include a set of top subsequences of messages sorted by frequency.

### Claim 16 (depends on 10)

The non-transitory computer-readable medium of claim 10, wherein performing the at least one operation comprises presenting at least one of a trend or context for the plurality of groups of messages based at least in part on the first set of one or more subsequences of messages.

### Claim 17 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein performing the at least one operation comprises detecting an anomaly on the one or more computing systems based at least in part on the first set of one or more subsequences of messages; and
responsive to detecting the anomaly, triggering an alert.

### Claim 18 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the plurality of groups of messages comprise groups of uniform resource locators (URLs); the operations further comprising assigning a classification to a set of URLs that are part of the combined group of messages.

### Claim 19

A system, comprising:
a processor;
a memory having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute operations comprising:
identifying a plurality of groups of messages, wherein a group of messages within the plurality of groups of messages defines a sequence for messages associated with the group;
identifying a first set of one or more subsequences of messages based at least in part on a frequency with which the first set of one or more subsequences occurs in different groups of the plurality of groups of messages; and
performing at least one operation based on the first set of one or more subsequences of messages.

### Claim 20 (depends on 19)

The system of claim 19, wherein identifying the first set of one or more subsequences comprises applying a sliding window to the plurality of groups of messages.
