Efficient mining of association rules by reducing the number of passes over the database
Pages 182 - 188
Abstract
This paper introduces a new algorithm of mining association rules. The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database intom partitions. The total number of passes over the database is only (k+2m-2)/m, wherek is the longest size in the itemsets. It is much less thank.
References
[1]
Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. InProc. the ACM SIGMOD Conference on Management of Data, Washington D.C., May 1993, pp.207–216.
[2]
Sergey Brin, Rajeev Motwani, Jerry D. Ullmanet al. Dynamic itemset counting and implication rules for market basket data. InProceeding of the ACM SIGMOD International Conference on Management of Data, Volume 26, 2 of SIGMOD 28 Record, New York, May 13–15 1997, ACM Press, pp.255–264.
[3]
Agrawal r, Srikant R. Fast algorithms for mining association rules. InProc. the 20th Int. Conf. Very Large Databases, Santiago, Chile, Sept. 1994, pp.487–499.
[4]
Charu C Agrawal, Philip S Yu. Mining large itemsets for association rules. InBulletin of the IEEE Computer Society Technical Committee on Data Engineering, March 1998, pp.23–31.
[5]
Savasere A, Omiecinski E, Navathe S. An efficient algorithm for mining association rules in large database. InProceedings of the Very Large Data Base Conference, Zurich, September 1995, pp.432–444.
[6]
Hannu Toivonen. Sampling large databases for association rules. InProceedings of 22nd International Conference on Very Large Data Bases, Mumbai, India, Sept. 1996, Morgan Kaufmann, pp.134–145.
[7]
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Liet al. Evaluation of sampling for data mining of association rules. Technical Report 617, Computer Science Dept., U. Rochester, May 1996.
[8]
Cheung D, Han J, Ng Vet al. Maintenance of discovered association rules in large databases: An incremental updating technique. InProc. 1996 Int. Conf. Data Engineering, New Orleans, Lousiana, USA, Feb. 1996, http://www.cs.hku.hk/~dcheungs/publication/icde96.ps
[9]
David W L Cheung, Lee S D, Benjamin Kao. A general incremental technique for maintaining discovered association rules. InProceedings of the Fifth International Conference on Database Systems for Advanced Applications, Melbourne, Australia, March 1997, pp.185–194.
[10]
Shiby Thomas, Sreenath Bodagala, Khaled Alsabtiet al. An efficient algorithm for the incremental updating of association rules in large database. InProceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, 1997, pp.134–145.
[11]
Agrawal Charu C and Yu Philip S Oline generation of association rules 1997 Yorktown Heights, NY IBM Research Division, T.J. Watson Research Center
[12]
Cheung D, Ng V, Fu A, et al. Efficient mining of association rules in distributed database IEEE Trans. Knowledge and Data Eng. 1996 8 6 911-922
Recommendations
Mining Short Association Rules from Large Database
APCIP '09: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01Discovering association rules from existing large databases is an important technique. In this paper, we propose an effective algorithm for mining short association rules on large database. It is experimentally demonstrated presented algorithm has an ...
Transaction-item association matrix-based frequent pattern network mining algorithm in large-scale transaction database
To increase the efficiency of data mining is the emphasis in this field at present. Through the establishment of transaction-item association matrix, this paper changes the process of association rule mining to elementary matrix operation, which makes ...
Image mining using association rules derived from feature matrix
ICAC3 '09: Proceedings of the International Conference on Advances in Computing, Communication and ControlAssociation rule mining is a very important research topic in the field of data mining. Discovering frequent itemsets is the key process in association rule mining. Traditional association rule algorithms adopt an iterative method to discovery, which ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
© Science Press, Beijing China and Allerton Press Inc. 2001.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 22 March 2023
Revision received: 17 February 2000
Received: 26 March 1999
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Dec 2024