Integrated database and data-mining system
AssigneeInternational Business Machines Corporation
InventorsRakesh Agrawal, Sunita Sarawagi, Shiby Thomas
Life of this patent
Estimating the term…
Abstract
A method and apparatus for mining data relationships from an integrated database and data-mining system are disclosed. A set of frequent 1-itemsets is generated using a group-by query on data transactions. From these frequent 1-itemsets and the transactions, frequent 2-itemsets are determined. A candidate set of (n+2)-itemsets are generated from the frequent 2-itemsets, where n=1. Frequent (n+2)-itemsets are determined from candidate set and the transaction table using a query operation. The candidate set and frequent (n+2)-itemset are generated for (n+1) until the candidate set is empty. Rules are then extracted from the union of the determined frequent itemsets.
Claims33
A method for mining rules from an integrated database and data-mining system having a table of data transactions and a query engine, the method comprising the steps of:
- a) performing a group-by query on the transaction table to generate a set of frequent 1-itemsets;
- b) determining frequent 2-itemsets from the frequent 1-itemsets and the transaction table;
- c) generating a candidate set of (n+2)-itemsets from the frequent (n+1)-itemsets, where n=1;
- d) determining frequent (n+2)-itemsets from the candidate set of (n+2)-itemsets and the transaction table using a query operation;
- e) repeating steps (c) and (d) with n=n+1 until the candidate set is empty;
- and
- f) generating rules from the union of the determined frequent itemsets.
An integrated data-mining system comprising:
- a database having a table of data transactions;
- a query engine coupled to the database;
- a query preprocessor for generating queries and input parameters for the query engine;
- means for performing a group-by query on the transaction table to generate a set of frequent 1-itemsets;
- means for determining frequent 2-itemsets from the frequent 1-itemsets and the transaction table;
- means for generating a candidate set of (n+2)-itemsets from the frequent (n+1)-itemsets, where n=1;
- means for determining frequent (n+2)-itemsets from the candidate set of (n+2)-itemsets and the transaction table using a query having cascaded subqueries;
- means for repeatedly generating the candidate set of (n+2)-itemsets and determining frequent (n+2)-itemsets with n=n+1 until the candidate set is empty;
- and
- means for generating rules from the union of the determined frequent itemsets.
A computer program product for mining rules from an integrated database and data-mining system having a table of data transactions and a query engine, the product comprising:
- a) means, recorded on the recording medium, for directing the system to perform a group-by query on the transaction table to generate a set of frequent 1-itemsets;
- b) means, recorded on the recording medium, for directing the system to determine frequent 2-itemsets from the frequent 1-itemsets and the transaction table;
- c) means, recorded on the recording medium, for directing the system to generate a candidate set of (n+2)-itemsets from the frequent (n+1)-itemsets, where n=1;
- d) means, recorded on the recording medium, for directing the system to determine frequent (n+2)-itemsets from the candidate set of (n+2)-itemsets and the transaction table using a query operation;
- e) means, recorded on the recording medium, for directing the system to repeatedly generate the candidate set of (n+2)-itemsets and determine frequent (n+2)-itemsets with n=n+1 until the candidate set is empty;
- and
- f) means, recorded on the recording medium, for directing the system to generate rules from the union of the determined frequent itemsets.
Dependencies are inferred from the claim text.