Open Access Open Access  Restricted Access Subscription or Fee Access

Survey on Algorithms Applied in Pattern Mining

M. V. Jisha, Dr. D . Vimal Kumar

Abstract


Data mining is a collection of techniques to extract hidden and potentially useful information from large databases of various business domains. For identifying the interesting patterns and co-relation and to get benefits from the repository data, Association Rule Mining (ARM) methods are used. Pattern recognition is a major challenge within the field of data mining and knowledge discovery. In this paper, a range of widely used algorithms are analyzed for finding frequent patterns with the purpose of discovering how these algorithms can be used to obtain frequent patterns over large transactional databases. This has been presented in the form of a comparative study of the following algorithms: Apriori algorithm, Frequent Pattern (FP) Growth algorithm, Rapid Association Rule Mining (RARM), ECLAT algorithm and Associated Sensor Pattern Mining of Data Stream (ASPMS) frequent pattern mining algorithms. The paper also focuses on each of the algorithm’s strengths and weaknesses for finding patterns in different transactional dataset.


Full Text:

PDF

References


Sourav S. Bhowmick Qiankun Zhao, "Association Rule Mining: A Survey," Nanyang Technological University, Singapore.

Jiawei Han • Hong Cheng • Dong Xin • Xifeng Yan, "Frequent pattern mining: current status and future Directions," Data Mining Knowl Discov, vol. 15, no. I, p. 32, 2007.

Iqbal Gondal and Joarder Kamruzzaman Md. Mamunur Rashid, "Mining Associated Sensor Pattern for data stream of wireless networks," in PM2HW2N '13, Spain, 2013.

Chistopher.T, PhD Saravanan Suba, "A Study on Milestones of Association Rule Mining," International Journal of Computer Applications, p. 7, June 2012.

WeeKeong, YewKwong Amitabha Das, "Rapid Association Rule Mining," in Information and Knowledge Management, Atlanta, Georgia, 2001, pp. 474-481.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.