 |
|
|
|
|
|
 Title: |
US5842200:
System and method for parallel mining of association rules in databases
[ Derwent Title ]
>> View Certificate of Correction for this publication
|
| Country: |
US United States of America
|
| |
| Inventor: |
Agrawal, Rakesh; San Jose, CA
Shafer, John Christopher; San Jose, CA
|
| Assignee: |
International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
1998-11-24
/ 1995-07-11
|
| Application Number: |
US1995000500717
|
| IPC Code: |
Advanced:
G06Q 30/00;
Core:
more...
IPC-7:
G06F 17/30;
|
| ECLA Code: |
G06Q30/00A;
|
| U.S. Class: |
Current:
707/001;
700/090;
707/003;
Original:
707/001;
364/400;
707/003;
|
| Field of Search: |
364/400,554
395/201,210,601,603,899
705/001,10
707/1;3
|
| Priority Number: |
|
| Abstract: |
A multiprocessor including a plurality of processing systems is disclosed for discovering consumer purchasing tendencies. Each processing system of the multiprocessor identifies consumer transaction itemsets that are stored in a database that is distributed among the processing systems and which appear in the database a user-defined minimum number of times, referred to as minimum support. Then, the system discovers association rules in the itemsets by comparing the ratio of the number of times each of the large itemsets appears in the database to the number of times particular subsets of the itemset appear in the database. When the ratio exceeds a predetermined minimum confidence value, the system outputs an association rule which is representative of purchasing tendencies of consumers.
|
| Attorney, Agent or Firm: |
Baker Maxham Jester & Meador ;
|
| Primary / Asst. Examiners: |
Cosimano, Edward R.;
|
| Maintenance Status: |
CC Certificate of Correction issued
View Certificate of Correction
|
| INPADOC Legal Status: |
Show legal status actions
Family Legal Status Report
|
|
|
|
|
|
|
| Parent Case: |
CROSS REFERENCE TO RELATED APPLICATIONS
This application is a continuation-in-part of the following co-pending U.S. Patent Applications, which are commonly assigned with this application:
U.S. patent application Ser. No. 08/415,006, filed Mar. 31, 1995, for "SYSTEM AND METHOD FOR QUICKLY MINING ASSOCIATION RULES IN A DATABASE" now U.S. Pat. No. 5,794,209.
U.S. patent application Ser. No. 08/436,794, filed May 8, 1995, for "SYSTEM AND METHOD FOR MINING GENERALIZED ASSOCIATION RULES IN A DATABASE", now U.S. Pat. No. 5,615,341.
This application claims priority from and incorporates by reference the above-referenced patent applications.
|
| Designated Country: |
DE FR GB
|
| Family: |
Show 13 known family members
|
First Claim:
Show all 19 claims |
We claim:
1. A digital multiprocessor comprising a plurality of processing systems, each processing system including a respective local database having distributed therein data from a transaction database of itemsets purchased in consumer transactions, each processing system including:
- means for determining the number of times a candidate itemset appears in the associated local database to establish a local count for the candidate itemset;
- means for using the local count to determine whether the number of times a candidate itemset appears in the transaction database exceeds a predefined minimum support value;
- means for entering a candidate itemset into a set of large itemsets when the number of times exceeds a predetermined minimum support value, such that the set of large itemsets can be designated as frequently occurring itemsets in transactions;
- means for determining, for at least some of the itemsets in the set of large itemsets the number of times selected subsets of the itemsets appear in the transaction database;
- means for outputting an association rule when the ratio of the number of times a selected subset appears in the transaction database to the number of times the associated itemset appears in the transaction database exceeds a predetermined minimum confidence value and thereby satisfies a minimum confidence constraint; and
- means for exchanging the local count with the other processing systems such that each processing system determines whether the number of times a candidate itemset appears in the transaction database exceeds the predefined minimum support value.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 29 U.S. patent(s) that reference this one
|
|
|
|
|
|
|
| Foreign References: |
None
|
| Other Abstract Info: |
DERABS G96-435889
|
| Other References: |
R. Agrawal et al., "Mining Association Rules Between Sets of Items in Large Databases", Proc. 1993 ACM SIGMOD Conf., pp. 207-216, 1993.
R. Agrawal et al., "Fast Algorithms for Mining Association Rules", Proceedings of the 1994 VLDB Conference, pp. 487-499, 1994.
M. Houtsma et al., "Set-Oriented Mining for Association Rules in Relational Databases", Proc. 11th Conference on Data Engineering, pp. 25-33, 1995.
H. Mannila et al., "Improved Methods for Finding Association Rules", Pub. No. C-1993-65, 20 pages, Univ. Helsinki, 1993.
D.J. DeWitt et al., "The Gamma Database Machine Project", IEEE Trans. Knowledge & Data Engineering, Mar., 1990.
J.S. Park et al., "Efficient Parallel Data Mining for Association Rules", IBM Research Report, 26 pgs., R20156, Aug., 1995.
J.S. Park et al., An Effective Hash Based Algorithm for Mining Association Rules', Proc. ACM-SIGMOD Conf. On Management of Data, San Jose, May, 1994.
|
|
 Nominate this for the Gallery...
|
|
