Data processing: database and file management or data structures – Database design – Data structure types
Patent
1996-10-25
1999-11-09
Black, Thomas G.
Data processing: database and file management or data structures
Database design
Data structure types
707 1, 707 3, 705 10, G06F 1730
Patent
active
059832223
ABSTRACT:
A method is disclosed for computing an association rule in a database having numerical attributes and 0-1 attributes. First, a numerical attribute is divided into a plurality of intervals (or buckets), and each data set is placed into a single bucket according to the value of the numerical attribute. The number of data sets in each bucket and the number of data sets with a 0-1 attribute being 1 are counted. Second, the starting bucket of an interval to be detected is to be detected. Third, the terminating bucket corresponding to the starting bucket is detected. That is, the largest interval with a confidence equal to or larger than a predetermined value. Fourth, one of the detected pairs of starting and terminating buckets which includes the largest number of customers is the answer to this question. Finally, the required data attributes of data included in this interval is subsequently retrieved.
REFERENCES:
patent: 5615341 (1997-03-01), Agrawal et al.
R. Agrawal et al., "Mining Association Rules Between Sets of Items in Large Databases", Proc. of the ACM SIGMOD Conference on Management of Data, Washington, DC, May 1993, pp. 207-216.
R. Agrawal et al., "Database Mining: A Performance Perspective", IEEE Transactions on Knowledge and Data Engineering, Special Issue on Learning and Discovery in Knowledge-based Databases, Dec. 1993, pp. 914-925.
R. Agrawal et al., "Fast Algorithms for Mining Association Rules", Proc. of the VLDB Conference, Santiago, Chile, Sep. 1994, pp. 487-499.
R. Agrawal et al., "Mining Sequential Patterns", Proc. of the International Conference on Data Engineering, Mar. 1995, pp. 3-14.
J. Han et al., "Discovery of Multiple-level Association Rules from Large Databases", Proc. of the VLDB Conference, Zurich, Switzerland, Sep. 1995, pp. 420-431.
M. Houtsma et al., "Set-oriented Mining for Association Rules in Relational Databases", Proc. of the 11th Conference on Data Engineering, 1995, pp. 25-33.
H. Mannila et al., "Improved Methods for Finding Association Rules", Pub. No. C-1993-65, University of Helsinki, 1993.
J. S. Park et al., "An Effective Hash-based Algorithm for Mining Association Rules", Proc. of the ACM SIGMOD Conference on Management of Data, San Jose, California, May 1995, pp. 175-186.
A. Savasere et al., "An Efficient Algorithm for Mining Association Rules in Large Databases", Proc. of the 21st VLDB Conference, Zurich, Switzerland, Sep. 1995, pp. 432-444.
G. P. Shapiro, "Discovery, Analysis, and Presentation of Strong Rules", Knowledge Discovery in Databases, AAAI/MIT Press, Menlo Park, California, 1991, pp. 229-248.
Fukuda Takeshi
Morimoto Yasuhiko
Morishida Shinichi
Tokuyama Takeshi
Alam Hosain T.
Black Thomas G.
International Business Machines - Corporation
Tran Khanh Q.
LandOfFree
Method and apparatus for computing association rules for data mi does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for computing association rules for data mi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for computing association rules for data mi will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1469639