Agrawal et al., "Parallel Mining of Association Rules,"
IEEE Transactions on Knowledge and Data Engineering,
vol. 8, No. 6, pp. 962-969, Dec. 1996.
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^199) 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.
Primary Examiner—Paul R. Lintz
Assistant Examiner—-Jean Bolte Fleurantin
Attorney, Agent, or Firm—Gray Cary Ware Freidenrich
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 (3, 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 (3 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.
38 Claims, 8 Drawing Sheets
