MINING DENSE DATA: ASSOCIATION RULE DISCOVERY ON BENCHMARK CASE STUDY

Authors

  • Wan Aezwani Wan Abu Bakar School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Terengganu, Terengganu, Malaysia
  • Md. Yazid Md. Saman School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Terengganu, Terengganu, Malaysia
  • Zailani Abdullah School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Terengganu, Terengganu, Malaysia
  • Masita@Masila Abd Jalil School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Terengganu, Terengganu, Malaysia
  • Tutut Herawan Department of Information Systems, Faculty of Computer Science and Information Technology, University of Malaya, Lembah Pantai, 50603 Kuala Lumpur, Malaysia

DOI:

https://doi.org/10.11113/jt.v77.6940

Keywords:

Data Mining (DM), Association Rule Mining (ARM), Rapid Miner (RM), frequent itemset, interestingness measure

Abstract

Data Mining (DM), is the process of discovering knowledge and previously unknown pattern from large amount of data. The association rule mining has been in trend where a new pattern analysis can be discovered to project for an important prediction about any issues. In this article, we present comparison result between Apriori and FP-Growth algorithm in generating association rules based on a benchmark data from frequent itemset mining data repository. Experimentation with the two (2) algorithms are done in Rapid Miner 5.3.007 and the performance result is shown as a comparison. The results obtained confirmed and verified the results from the previous works done.

References

Man, M., Rahim, M., Jusoh, J., and Zakaria, M. Z. 2011. Designing Multiple Types Of Spatial And Non Spatial Databases Integration Model Using Formal Specification Approach. Software Engineering (MySEC), 2011 5th Malaysian Conference in. IEEE. 20–24.

Tan, P.-N., Steinbach, M., and Kumar, V. 2005. Introduction to Data Mining. First Edition. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc.

Tuan, T. A. 2012. A Vertical Representation For Parallel Declat Algorithm In Frequent Itemset Mining. Master’s thesis, Ritsumeikan University.

Agrawal, R., Srikant et al., R. 1994. Fast Algorithms For Mining Association Rules. Proc. 20th Int. Conf. Very Large Data Bases, VLDB. 1215: 487-499.

Agrawal, R., Imieli´nski, T., and Swami, A. 1993. Mining Association Rules Between Sets Of Items In Large Databases, SIGMOD Rec. 22(2): 207-216. [Online]. Available: http://doi.acm.org/10.1145/170036.170072.

Han, J., Kamber, M. and Pei, J. 2006. Data Mining: Concepts And Techniques. Morgan Kaufmann.

GyËorödi, C., GyËorödi, R. and Holban, S. 2004. A Comparative Study Of Association Rules Mining Algorithms. SACI 2004, 1st Romanian-Hungarian Joint Symposium on Applied Computational Intelligence. 213-222.

Vanitha, K. 2011. Evaluating The Performance Of Association Rule Mining Algorithms. Journal of Global Research in Computer Science. 2(6): 101-103.

Hunyadi, D. 2011. Performance Comparison Of Apriori And Fp-Growth Algorithms In Generating Association Rules, Proceedings of the European Computing Conference. 376-381.

Man, M., Jusuh, J. A., Rahim, M. S. M., Zakaria, M. Z. 2011. Formal Specification For Spatial Information Databases Integration Framework (SIDIF). Telkomnika. 9(1): 81-88.

Downloads

Published

2015-12-21

Issue

Vol. 78 No. 2-2: Digital Media Issue

Section

Science and Engineering

License

Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.

How to Cite

MINING DENSE DATA: ASSOCIATION RULE DISCOVERY ON BENCHMARK CASE STUDY. (2015). Jurnal Teknologi, 78(2-2). https://doi.org/10.11113/jt.v77.6940