Descending Dimension Algorithm for Association Rules Based on SQL Calculation

Article Preview

Abstract:

Apriori algorithm is a classical algorithm for association rules mining. But the algorithm must be connect repeatly and operate steps layer by layer to find frequent item sets. To overcome the shortcomings of Apriori algorithm, relational database language SQL is used proceed from the higher-order item sets and compute the support of item set to find frequent item sets in this paper. The solution process eliminates a large number of duplicate items produced by the connection from low-dimensional to high-dimensional in the traditional process. The calculation is simplified and efficiency improved.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3626-3629

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] YOU Lei, LAN Yang, XIONG Yan. An Optimized Apriori Implementation Based on Relational Algebra,. Journal of Xinyang Normal University, 23, 156-158, (2011).

Google Scholar

[2] Zhanjiang, WANG Zhi-He, JING Yong-Xia. An Algorithm of Frequent Pattern Mining based on SQL,. JOURNAL OF ZHONGYUAN INSTITUTE OF TECHNOLOG, 16, 48-52, (2005).

Google Scholar

[3] Jiawei Han, Michelins. Data Mining Concepts and Techniques,. (2001).

Google Scholar

[4] Csaba Istv´an Sidl´, Andr´as Luk´acs. Shaping SQL-Based Frequent Pattern Mining Algorithms.

Google Scholar

[5] ZHAO Jian-song, CHEN Zai-ping. The research of improved Apriori algorithm based on SQL, Journal of Tianjin University of Technology. (2009).

Google Scholar

[6] Abdullah Alashqur. RDB-MINER. A SQL-Based Algorithm for Mining True Relational Databases, JOURNAL OF SOFTWARE. (2010).

DOI: 10.4304/jsw.5.9.998-1005

Google Scholar

[7] R. Elmasri and S. Navaho. Fundamentals of Database Systems, Fifth Edition, Addison-Wesley. (2007).

Google Scholar