Data mining an interdisciplinary research area spanning several disciplines such as machine learning, database system, expert system, intelligent information systems and statistic. Data mining has evolved into an active and important area of research because of previously unknown and interesting knowledge from very large real-world database. Many aspects of data mining have been investigated in several related fields. A unique but important aspect of the problem lies in the significance of needs to extend their studies to include the nature of the contents of the real world database. In this paper we are going to compare the three different algorithms which are commonly used in data mining. These three algorithms are CHARM Algorithm, Top K Rules mining and CM SPAM Algorithm.

Data Mining, CHARM algorithm, K rule mining, CM SPAM Algorithm

[1] Neelamadhab Padhy, Dr. Pragnyaban Mishra, Rasmita Panigrahi “The Survey of Data Mining Applications And Feature Scope” at International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.3, June 2012.
[2] Introduction to Data Mining and Knowledge Discovery, Third Edition ISBN: 1-892095-02-5, Two Crows Corporation, 10500 Falls Road, Potomac, MD 20854 (U.S.A.), 1999.
[3] Larose, D. T., “Discovering Knowledge in Data: An Introduction to Data Mining”, ISBN 0-471-66657-2, ohn Wiley & Sons, Inc, 2005.
[4] Dunham, M. H., Sridhar S., “Data Mining: Introductory and Advanced Topics”, Pearson Education, New Delhi, ISBN: 81-7758-785-4, 1st Edition, 2006
[5] M. J. Zaki and K. Gouda. Fast vertical mining using Diffsets. Technical Report 01-1, Computer Science Dept., Rensselaer Polytechnic Institute, March 2001.
[6] M. J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3):372-390, May-June 2000.
[7] R. Agrawal, T. Imielminski and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases,” Proc. ACM Intern. Conf. on Management of Data, ACM Press, June 1993, pp. 207-216.
[8] P. Tzvetkov, X. Yan and J. Han, “TSP: Mining Top-k Closed Sequential Patterns”, Knowledge and Information Systems, vol. 7, no. 4, 2005, pp. 438-457.
[9] C. Kun Ta, J.-L. Huang and M.-S. Chen, “Mining Top-k Frequent Patterns in the Presence of the Memory Constraint,” VLDB Journal, vol. 17, no. 5, 2008, pp. 1321-1344.
[10] J. Wang, Y. Lu and P. Tzvetkov, “Mining Top-k Frequent Closed Itemsets,” IEEE Trans. Knowledge and Data Engineering, vol. 17, no. 5, 2005, pp. 652-664.
[11] A. Pietracaprina and F. Vandin, “Efficient Incremental Mining of Top-k Frequent Closed Itemsets,” Proc. Tenth. Intern. Conf. Discovery Science, Oct. 2004, Springer, pp. 275-280.
[12] G. I. Webb and S. Zhang, “k-Optimal-Rule-Discovery,” Data Mining and Knowledge Discovery, vol. 10, no. 1, 2005, pp. 39-79.
[13] G. I. Webb, “Filtered top-k association discovery,” WIREs Data Mining and Knowledge Discovery, vol.1, 2011, pp. 183-192.
[14] Y. You, J. Zhang, Z. Yang and G. Liu, “Mining Top-k Fault Tolerant Association Rules by Redundant Pattern Disambiguation in Data Streams,” Proc. 2010 Intern. Conf. Intelligent Computing and Cognitive Informatics, March 2010, IEEE Press, pp. 470-473.
[15] Mabroukeh, N.R., Ezeife, C.I.: A taxonomy of sequential pattern mining algorithms. ACM Computing Surveys 43(1), 1–41 (2010).
[16] Agrawal, R., Ramakrishnan, S.: Mining sequential patterns. In: Proc. 11th Intern. Conf. Data Engineering, pp. 3–14. IEEE (1995)