 |
|
|
|
|
|
 Title: |
US5615341:
System and method for mining generalized 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
Srikant, Ramakrishnan; 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: |
1997-03-25
/ 1995-05-08
|
| Application Number: |
US1995000436794
|
| IPC Code: |
Advanced:
G06F 17/30;
G06F 19/00;
G06Q 10/00;
G06Q 30/00;
G06Q 50/00;
Core:
more...
IPC-7:
G06F 19/00;
|
| ECLA Code: |
G06Q30/00A;
|
| U.S. Class: |
Current:
705/010;
Original:
395/210;
|
| Field of Search: |
364/401 R
395/214,210
|
| Priority Number: |
| 1995-05-08 |
US1995000436794 |
|
| Abstract: |
A system and method for discovering consumer purchasing tendencies includes a computer-implemented program which identifies consumer transaction itemsets that are stored in a database and which appear in the database a user-defined minimum number of times, referred to as minimum support. The itemsets contain items that are characterized by a hierarchical taxonomy. Then, the system discovers association rules, potentially across different levels of the taxonomy, in the itemsets by comparing 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 relationship exceeds a predetermined minimum confidence value, the system outputs a generalized association rule which is representative of purchasing tendencies of consumers. The set of generalized association rules can be pruned of uninteresting rules, i.e., association rules which do not occur at a frequency that is significantly different than what is expected based upon the frequency of occurrence of the rule's ancestors.
|
| Attorney, Agent or Firm: |
Baker, Maxham, Jester & Meador ;
|
| Primary / Asst. Examiners: |
McElheny, Jr., Donald E.;
|
| Maintenance Status: |
CC Certificate of Correction issued
View Certificate of Correction
|
| INPADOC Legal Status: |
Show legal status actions
Family Legal Status Report
|
| Designated Country: |
DE FR GB
|
| Family: |
Show 13 known family members
|
First Claim:
Show all 24 claims |
We claim:
1. A computer program device comprising:
- a computer program storage device readable by a digital processing apparatus; and
- a program means on the program storage device and including instructions executable by the digital processing apparatus for performing method steps for identifying association rules in itemsets with a hierarchical taxonomy on items of the itemsets, the taxonomy defining descendant and ancestor relationships between the items, the method steps comprising:
- entering an itemset into a set of large itemsets when the number of times the itemset is present in a database of transactions establishes a support value that exceeds a predefined minimum support value;
- for at least some of the itemsets in the set of large itemsets, determining the number of times selected subsets of the itemsets appear in transactions in the database; and
- (d) outputting an association rule when the number of times a selected subset appears in the database bears a predetermined relationship to the number of times the associated itemset appears in the database and thereby satisfies a minimum confidence constraint.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 80 U.S. patent(s) that reference this one
|
|
|
|
|
|
|
| Foreign References: |
None
|
| 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 Conf. 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.
J.S. Park et al., "An Effective Hash Based Algorithm for Mining Association Rules", Proc. ACM-Sigmond Conf. on Management of Data, San Jose, May, 1994.
R. Agrawal et al., "Fast Algorithms for Mining Association Rules", IBM Research Report RJ9839, 31 pages, Nov. 16, 1994.
|
|
 Nominate this for the Gallery...
|
|
