 |
|
|
|
|
|
 Title: |
US6061682:
Method and apparatus for mining association rules having item constraints
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Agrawal, Rakesh; San Jose, CA
Srikant, Ramakrishnan; San Jose, CA
Vu, Quoc; San Jose, CA
|
| Assignee: |
International Business Machine Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
2000-05-09
/ 1997-08-12
|
| Application Number: |
US1997000910194
|
| IPC Code: |
Advanced:
G06F 17/30;
Core:
more...
IPC-7:
G06F 17/30;
|
| ECLA Code: |
G06F17/30S4P8D;
|
| U.S. Class: |
Current:
707/006;
707/001;
707/007;
707/010;
Original:
707/006;
707/001;
707/007;
707/010;
|
| Field of Search: |
707/001,6,7,10
|
| Priority Number: |
| 1997-08-12 |
US1997000910194 |
|
| Abstract: |
A method for discovering association rules in a database that employs item constraints for extracting desired data relationships from a data base, thereby reducing the execution time of the rule discovery process and increasing the quality of the information returned. Such constraints allow users to specify the subset of rules in which the users are interested. Given a set of transactions D and constraints represented by a boolean expression beta , the invention integrates the constraints into a selected rule discovery method rather than implementing the constraints as a post-processing step. The invention quickly discovers association rules that satisfy beta and have support and confidence levels greater than or equal to user-specified minimum support and minimum confidence levels, and may be implemented even when a taxonomy is present.
|
| Attorney, Agent or Firm: |
Gray Cary Ware Freidenrich ;
|
| Primary / Asst. Examiners: |
Lintz, Paul R.; Fleurantin, Jean Bolte
|
| Maintenance Status: |
CC Certificate of Correction issued
|
| INPADOC Legal Status: |
Show legal status actions
|
| Parent Case: |
This application contains materials related to the following issued or co-pending U.S. patent applications, which are commonly assigned to this application and each of which is incorporated by reference herein:
U.S. Pat. No. 5,615,341, Agrawal et al., issued Mar. 25, 1997 for "SYSTEM AND METHOD FOR MINING GENERALIZED ASSOCIATION RULES IN DATABASE";
U.S. patent application Ser. No. 08/227,428, filed Apr. 14, 1994, for "SYSTEM AND METHOD FOR QUERY OPTIMIZATION USING QUANTILE VALUES OF A LARGE UNORDERED DPT SET";
U.S. patent application Ser. No. 08,398,620, filed Mar. 3, 1995, for "SYSTEM AND METHOD FOR MINING SEQUENTIAL PATTERNS IN A LARGE DATABASE"; and
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.
|
| Family: |
None
|
First Claim:
Show all 38 claims |
What is claimed is:
1. A method using item constraints to discover association rules contained in a database, the method comprising:
- finding large itemsets in a database that satisfy defined constraints, the defined constraints involving one or more items of a mining input expression;
- determining subsets of large itemsets included in the itemsets, an itemset being large if its support is greater than a minimum support value, where support value for an itemset is based upon the number of times the itemset appears in the database; and
- finding association rules from the large itemsets that satisfy the defined constraints.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
| Forward References: |
Show 25 U.S. patent(s) that reference this one
|
|
|
|
|
|
|
| Foreign References: |
None
|
| Other Abstract Info: |
DERABS G2000-375384
DERABS G2000-375384
|
| Other References: |
Toivonen, "Sampling Large Databases for Association Rules," (Univ. of Helsinki) Proc. of the 22nd VLDB Conference, 12 pgs., Mumbai (Bombay), India, 1996.
Agrawal et al., "Fast Discovery of Association Rules," Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press,(18 pgs) 1996.
Agrawal et al., "Parallel Mining of Association Rules," IEEE Transactions on Knowledge and Data Engineering, vol. 8, No. 6, pp. 962-969, Dec. 1996.
(8 pages)
Cited by 3 patents
[ISI abstract]
Han et al., "Scalable Parallel Data Mining for Association Rules," Pub. No. ACM 0-89791-911-4/97/00005, Proc. of the ACM SIGMOD Conf. on Management of Data, (pp. 277-288) Tucson, AZ, May 1997.
Agrawal et al., "Fast Algorithms for Mining Association Rules in Large Databases," Proc. of the VLDB Conference, (pp. 487-499) Santiago, Chile, 1994.
Mannila et al., "Improved Method for Finding Association Riles," Pub. No. C-1993-65, 20 pages, Dept. of Computer Science, University of Helsinki, 1993.
|
|
 Nominate this for the Gallery...
|
|
