# US 2018/0004816 A1 · System and method providing association rule aggregates

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

- Number: US 2018/0004816 A1
- Document ID: US20180004816A1
- Status: Published application
- Kind: A1
- Application number: 15/200,028
- Filed: 2016-07-01
- Published: 2018-01-04
- Earliest claimed: 2016-07-01
- Assignees: Oracle International Corporation
- Applicants: Oracle International Corporation
- Inventors: Ari W. MOZES; Dongfang BAI
- Web page: https://patentgrep.com/patent/US20180004816A1

## CPC

- G06F 16/2465: {Query processing support for facilitating data mining operations in structured databases}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems, methods, and other embodiments are disclosed for performing data mining. In one embodiment, transaction records are read one at a time. Each transaction record represents a transaction for at least one item and includes an item identifier and a metric value for the item. The number-of-occurrences of at least one candidate item set in the transaction records are counted to generate a total count for the candidate item set. The candidate item set includes one or more items. As the counting proceeds, at least one aggregate metric value associated with the candidate item set is accumulated by summing metric values across the number-of-occurrences for each item represented in the candidate item set. A determination is made as to whether the candidate item set is a frequent item set in the transaction records by comparing the total count to a threshold value.

## Claims

### Claim 1

A computer-implemented method performed by at least a processor for executing instructions from a memory, the method comprising:
identifying at least one candidate item set, wherein the at least one candidate item set is under consideration for being at least one frequent item set in a set of transaction data that includes a plurality of transaction records stored in a data cache of a relational database system;
reading the plurality of transaction records, one at a time, from the data cache via at least the processor, wherein each transaction record of the plurality of transaction records represents a transaction for at least one item and includes transaction data that includes an item identifier and a metric value for the at least one item;
counting a number-of-occurrences of the at least one candidate item set in the plurality of transaction records, via at least the processor, to generate a total count for the at least one candidate item set;
as the counting is proceeding, accumulating at least one aggregate metric value associated with the at least one candidate item set at least in part by summing metric values across the number-of-occurrences for each item represented in the at least one candidate item set via at least the processor; and
determining whether the at least one candidate item set is the at least one frequent item set at least in part by comparing the total count to a specified threshold value via at least the processor.

### Claim 2 (depends on 1)

The method of claim 1, further comprising pre-processing the set of transaction data, via at least the processor, to perform at least one of:
positioning items in each transaction record of the plurality of transaction records in a canonical order in preparation for applying a prefix tree methodology; and
generating at least one bitmap array for items associated with the at least one candidate item set, and generating at least one metric value array corresponding to the at least one bitmap array in preparation for applying a bitmap methodology.

### Claim 3 (depends on 1)

The method of claim 1, wherein the metric value for the at least one item includes at least one of:
a revenue value representing a revenue received for the at least one item in a transaction represented in the set of transaction data;
a profit value representing a profit made on the at least one item in the transaction represented in the set of transaction data; or
a quantity value representing a quantity of the at least one item purchased in the transaction represented in the set of transaction data.

### Claim 4 (depends on 1)

The method of claim 1, wherein the counting is performed using a prefix tree methodology via at least the processor.

### Claim 5 (depends on 1)

The method of claim 1, wherein the counting is performed using a bitmap methodology via at least the processor.

### Claim 6 (depends on 1)

The method of claim 1, further comprising controlling user specification of the specified threshold value via a graphical user interface or an application program interface.

### Claim 7 (depends on 1)

The method of claim 1, wherein the identifying of the at least one candidate item set is accomplished at least in part by performing a search, in an ordered progression, over an item set search space associated with a plurality of items.

### Claim 8 (depends on 1)

The method of claim 1, wherein the identifying of the at least one candidate item set is accomplished at least in part by at least one of:
user specification of the at least one candidate item set via a graphical user interface or an application program interface; or
application specification of the at least one candidate items set via an application of the relational database system.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
generating, via at least the processor, at least one candidate association rule based at least in part on the at least one frequent item set, wherein the at least one candidate association rule associates at least two items in an if-then relationship and includes a confidence value based at least in part on the total count; and
identifying, via at least the processor, the at least one candidate association rule as a final association rule at least in part by comparing the confidence value of the at least one candidate association rule to a specified threshold probability level.

### Claim 10 (depends on 9)

The method of claim 9, further comprising controlling user specification of the specified threshold probability level via a graphical user interface or an application program interface.

### Claim 11

A relational database system, comprising:
a processor;
a data cache configured to store records of transaction data, wherein the records of transaction data represent multiple instances of transactions with respect to a plurality of items each represented by an item identifier and at least one metric value;
a counting module stored in a non-transitory computer-readable medium including instructions that when executed cause the processor to perform:
reading of the records of transaction data, one record at a time, and
counting a number-of-occurrences of at least one candidate item set to generate a total count, wherein the at least one candidate item set is under consideration for being at least one frequent item set in the records of transaction data;
an aggregation module stored in the non-transitory computer-readable medium including instructions that when executed cause the processor to perform, as the counting is proceeding, generating of at least one aggregate metric value associated with the at least one candidate item set at least in part by summing metric values across the number-of-occurrences for each item represented in the at least one candidate item set; and
a level filtering module stored in the non-transitory computer-readable medium including instructions that when executed cause the processor to perform a filtering operation to:
exclude the at least one candidate item set from being the at least one frequent item set at least in part by comparing the total count to a specified threshold value, or
confirm that the at least one candidate item set is the at least one frequent item set at least in part by comparing the total count to the specified threshold value.

### Claim 12 (depends on 11)

The relational database system of claim 11, further comprising a pre-processing module stored in the non-transitory computer-readable medium including instructions that when executed cause the processor to perform at least one of:
positioning items in each record of the records of transaction data in a canonical order in preparation for applying a prefix tree methodology; and
generating at least one bitmap array for items associated with the at least one candidate item set, and generating at least one metric value array corresponding to the at least one bitmap array in preparation for applying a bitmap methodology.

### Claim 13 (depends on 11)

The relational database system of claim 11, further comprising:
an association rule module stored in the non-transitory computer-readable medium including instructions that when executed cause the processor to generate at least one candidate association rule based at least in part on the at least one frequent item set, wherein the at least one candidate association rule associates at least two items in an if-then relationship and includes a confidence value based at least in part on the total count; and
a rule filtering module stored in the non-transitory computer-readable medium including instructions that when executed cause the processor to identifying the at least one candidate association rule as a final association rule at least in part by comparing the confidence value of the at least one candidate association rule to a specified threshold probability level.

### Claim 14 (depends on 13)

The relational database system of claim 13, further comprising a visual user interface module stored in the non-transitory computer-readable medium including instructions that when executed cause the processor to provide a graphical user interface that controls user specification of the specified threshold probability level.

### Claim 15 (depends on 11)

The relational database system of claim 11, further comprising a visual user interface module stored in the non-transitory computer-readable medium including instructions that when executed cause the processor to provide a graphical user interface that controls user specification of the specified threshold value.

### Claim 16 (depends on 15)

The relational database system of claim 15, further comprising a display screen configured to display and facilitate user interaction with at least the graphical user interface provided by the visual user interface module.

### Claim 17

A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of a computing device, cause the computing device to at least:
control a reading of a plurality of transaction records, one at a time, via the one or more processors, wherein each transaction record of the plurality of transaction records represents a transaction for at least one item and includes transaction data that includes an item identifier and a metric value for the at least one item;
control a counting of a number-of-occurrences of at least one candidate item set in the plurality of transaction records, via the one or more processors, to generate a total count for the at least one candidate item set, wherein the at least one candidate item set is under consideration for being at least one frequent item set in the plurality of transaction records;
as the counting is proceeding, control an accumulating of at least one aggregate metric value associated with the at least one candidate item set at least in part by summing metric values across the number-of-occurrences for each item represented in the at least one candidate item set via the one or more processors; and
control a determination of whether the at least one candidate item set is the at least one frequent item set at least in part by comparing the total count to a specified threshold value via the one or more processors.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computing device to at least generate, via the one or more processors, at least one candidate association rule based at least in part on the at least one frequent item set, wherein the at least one candidate association rule associates at least two items in an if-then relationship and includes a confidence value based at least in part on the total count.

### Claim 19 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computing device to at least identify, via the one or more processors, the at least one candidate association rule as a final association rule at least in part by comparing the confidence value of the at least one candidate association rule to a specified threshold probability level.

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computing device to at least control user specification of the specified threshold value and the specified threshold probability level via a graphical user interface or an application program interface.
