The Research of PApriori Algrithm Based on OLAP

Article Preview

Abstract:

In analysis of association rules based on OLAP, the application of Apriori algorithm may need to scan the database frequently and generate massive number of candidate itemsets because of the complex system. According to the weakness, the paper proposes PApriori algorithm based on pretreatment, which reduces the time of scanning database to once, while not directly generate candidate itemsets, raise the efficiency Analysis of association rules based on OLAP efficiently.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

1645-1648

Citation:

Online since:

June 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] JIAWEI HAN, MICHELINE KAMBER. Data Mining—Technology and Concept[M]. Beijing: Mechanical Industry Press, 2001: 149-178.

Google Scholar

[2] HU Ming, TANG Pei-li, XU Jian-cha, Research of multidimensional association rule based on OLAP, Journal of Northeast Normal University (Natural Science Edition), 2007, 39(4).

Google Scholar

[3] Wang Zhe, the Research and Application of Disperse \algorithm, Dalian Technology University, (2009).

Google Scholar

[4] M Jensen, T Moller, T Bach Pedersen. Specifying OLAP Cubes on XML Data[J]. Journal of Intelligent Systems. 2001, 17(2): 55-280.

DOI: 10.1109/ssdm.2001.938543

Google Scholar

[5] Wang Xiaoling, Dong Yisheng XML Based Data Cube and X-OLAP[J] Journal of Southeast University(English Edition). 2001, 17(2): 5-9.

Google Scholar