A New Algorithm of Association Rules Mining Based on Relation Matrix

Article Preview

Abstract:

Association rule mining is one of the hottest research areas that investigate the automatic extraction of previously unknown patterns or rules from large amounts of data. Finding association rules can be derived based on mining large frequent candidate sets. Aiming at the poor efficiency of the classical Apriori algorithm which frequently scans the business database, studying the existing association rules mining algorithms, we proposed a new algorithm of association rules mining based on relation matrix. Theoretical analysis and experimental results show that the proposed algorithm is efficient and practical.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 179-180)

Pages:

55-59

Citation:

Online since:

January 2011

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Agrawal, T. Imielinski, and A. Swami: Mining Association Rules between Sets of Items in Large Databases, Proc. ACM Conf. Management of Data, pp.207-216, (1993).

DOI: 10.1145/170036.170072

Google Scholar

[2] R. Agrawal and R. Srikant: Fast Algorithms for Mining Association Rules, Proc. Conf. Very Large Data Bases, pp.487-499, (1994).

Google Scholar

[3] R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo: Fast Discovery of Association Rules, Advances in Knowledge Discovery and Data Mining, chapter 12, U.M. Fayyad et al., eds., AAAI/MIT Press, pp.307-328, (1996).

DOI: 10.1023/a:1009748302351

Google Scholar

[4] J. Hipp, U. Gontzer, and G. Nakhaeizadeh: Algorithms for association rule mining-a general survey and comparison. SIGKDD Explorations, 2(1)(2000): pp.58-64.

DOI: 10.1145/360402.360421

Google Scholar

[5] J. Han, J. Pei, Y. Yin, and R. Mao: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach, Data Mining and Knowledge Discovery, 8(1)(2004): pp.53-87.

DOI: 10.1023/b:dami.0000005258.31418.83

Google Scholar

[6] S. Zhang, J. Lu, and C. Zhang: A fuzzy logic based method to acquire user threshold of minimum-support for mining association rules. Information Science. 164(1)(2004): pp.1-16.

DOI: 10.1016/j.ins.2003.09.017

Google Scholar

[7] Y. Yuan and T. Huang. A Matrix Algorithm for Mining Association Rule[J]. Springer-Verlag Berlin/Heidelberg 2005, LNCS 3644(1): pp.370-379.

Google Scholar

[8] J. Han and M. Kamber, Data Ming: Concepts and Techniques. Beijing: China Machine Press, 2006, pp.227-250.

Google Scholar