Advertisement

Efficient Mining Frequently Correlated, Associated-Correlated and Independent Patterns Synchronously by Removing Null Transactions

  • Md. Rezaul Karim
  • Sajal Halder
  • Byeong-Soo Jeong
  • Ho-Jin Choi
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 182)

Abstract

Market basket analysis techniques are useful for extracting customer’s purchase behaviors or rules by discovering what items they buy together using the association rules and correlation. Associated and correlated items are placed in the neighboring shelf to raise their purchasing probability in a super shop. Therefore, the mining combined association rules with correlation can discover frequently correlated, associated, associated-correlated and independent patterns synchronously, that are extraordinarily useful for making everyday’s business decisions. Since, the existing algorithms for mining correlated patterns did not consider the overhead of ‘null transactions’ during the mining operations; these algorithms fail to provide faster retrieval of useful patterns and besides, memory usages also increase exponentially. In this paper, we proposed an efficient approach for mining above mentioned four kinds of patterns by removing so called ‘null transactions’; by which not only possible to save precious computation time but also speeds up the overall mining process. Comprehensive experimental results show that the technique developed in this paper are feasible for mining large transactional databases in terms of time, memory usages, and scalability.

Keywords

Associated patterns correlated patterns associated-correlated patterns independent patterns transactional database null transactions market basket analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Zhou, Z.: Mining Frequent Independent Patterns and Frequent Correlated Patterns Synchronously. In: 5th International Conference on Fuzzy Systems and Knowledge Discovery (2008)Google Scholar
  2. 2.
    Liu, B., Hsu, W., Ma, Y.: Pruning and Summarizing the Discovered Association. In: Proc. 1999 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD 1999) (1999)Google Scholar
  3. 3.
    Omiecinski, E.: Alternative interesting measures for mining associations. IEEE Trans. on KDE (2003)Google Scholar
  4. 4.
    Lee, Y.K., Kim, W.Y., Cai, Y.D., Han, J.: CoMine: Efficient Mining of Correlated Patterns. In: ICDM 2003 (2003)Google Scholar
  5. 5.
    Ahmed, K.M., El-Makky, N.M., Taha, Y.: Beyond Market Baskets: Generalizing Association Rules to Correlations. In: ACM SIGKDD Explorations (2000)Google Scholar
  6. 6.
    Reynolds, H.T.: The Analysis of Cross-Classifications (1977)Google Scholar
  7. 7.
    Zhou, Z., Wang, C., Fengyi: Mining both associated and correlated patterns. In: ICCS 2006 (2006)Google Scholar
  8. 8.
    Piatetsky-Shapiro, G.: Discovery, Analysis and Presentation of Strong Rules. MIT Press (1991)Google Scholar
  9. 9.
    Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann (2006)Google Scholar
  10. 10.
    Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: An Index Structure for High-Dimensional Data. Readings in Multimedia Computing& Networking (2001)Google Scholar
  11. 11.
    Kim, W.-Y., Lee, Y.-K., Han, J.: CCMine: Efficient Mining of Confidence-Closed Correlated Patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 569–579. Springer, Heidelberg (2004)Google Scholar
  12. 12.
    Agrawal, R., Srikant, R.: Fast algorithms for Mining Association Rules. In: 20th VLD B Conf. (1994)Google Scholar
  13. 13.
    Zhou1, Z., Wang1, C., Feng, Y.: Mining Both Associated and Correlated Patterns. In: ICCS (2006)Google Scholar
  14. 14.
    Yongmei, L., Yong, G.: Application in Market Basket Research Based on FP-Growth Algorithm. In: Proc. of the 2009 WRI World Congress on Computer Science and Information Engineering, USA (2009)Google Scholar
  15. 15.
    Ji, C.-R., Deng, Z.-H.: “Mining Frequent Patterns without Candidate Generation. In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, China, August 24-27 (2007)Google Scholar
  16. 16.
    Hu, Y., Han, R.: An Improved Algorithm for Mining Maximal Frequent Patterns. In: International Joint Conference on Artificial Intelligence, China, April 25-26 (2009)Google Scholar
  17. 17.
    Chen, H.: Mining Frequent Patterns in Recent Time Window over Data Streams. In: 10th IEEE International Conference on High Performance Computing and Communications, Dalian, China, September 25-27 (2008)Google Scholar
  18. 18.
    Leung, C.K., Boyu Hao, S.: Mining of Frequent Itemsets from Streams of Uncertain Data. In: Proceedings of the IEEE International Conference on Data Engineering, Shanghai, China, March 29-April 2 (2009)Google Scholar
  19. 19.
    Uno, T., Asai, T., Uchida, Y., Arimura, H.: LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. In: Proceedings of Workshop on Frequent itemset Mining Implementations, Japan, vol. 54, p. 23Google Scholar
  20. 20.
    Meenakshi, A., Alagarsamy, K.: Efficient Storage Reduction of Frequency of Items in Vertical Data Layout. In: International Journal on Computer Science and Engineering (IJCSE), vol. 3(2) (February 2011)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2012

Authors and Affiliations

  • Md. Rezaul Karim
    • 1
  • Sajal Halder
    • 1
  • Byeong-Soo Jeong
    • 1
  • Ho-Jin Choi
    • 2
  1. 1.Department of Computer EngineeringKyung Hee UniversitySeoulKorea
  2. 2.Dept. of Computer ScienceKorea Advanced Institute of Science and TechnologyDaejeonKorea

Personalised recommendations