Eliminating redundancy in generation of association rules for on

Data processing: database and file management or data structures – Database design – Data structure types

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

707 4, 707 5, 707 10, G06F 1730

Patent

active

059436670

ABSTRACT:
A computer method of removing simple and strict redundant association rules generated from large collections of data. A compact set of rules is presented to an end user which is devoid of many redundancies in the discovery of data patterns. The method is directed primarily to on-line applications such as the Internet and Intranet. Given a number of large itemsets as input, simple redundancies are removed by generating all maximal ancestors, the frontier set, for each large itemset. The set of maximal ancestors share a hierarchical relationship with the large itemset from which they were derived and further satisfy an inequality whereby the ratio of respective support values is less than the reciprocal of some user defined confidence value.
The resulting compact rule set is displayed to an end user at some specified level of support and confidence. The method is also able to generate the full set of rules from the compact set.

REFERENCES:
patent: 5615341 (1997-03-01), Agrawal et al.
patent: 5727199 (1998-03-01), Chen et al.
patent: 5764975 (1998-06-01), Taniguchi et al.
patent: 5794209 (1998-08-01), Agrawal et al.
patent: 5819266 (1998-10-01), Agrawal et al.
patent: 5842200 (1998-11-01), Agrawal et al.
Agrawal, R., "Mining Association Rules Between Sets of Items in Large Databases", Proceedings of the ACM SIGMOD Conference on Management of Data, Washington D.C., 1993, pp. 207-216.
Agrawal, R., "Fast Algorithms for Mining Association Rules", Proceedings of the 20th International Conference on Very Large Data Bases, 1994, pp. 487-499.
Srikant, R., "Mining Generalized Association Rules", Proceedings of the 21st International Conference on Very Large Data Bases, 1995, pp. 407-419.
Srikant, R., "Mining Quantiative Association Rules in Large Relational Tables", Proceedings of the 1996 ACM SIGMOD Conference on Management of Data, Montreal Canada (1996), pp. 1-12.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Eliminating redundancy in generation of association rules for on does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Eliminating redundancy in generation of association rules for on, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eliminating redundancy in generation of association rules for on will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-476911

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.