Coalesce based binary table: an enhanced algorithm for mining frequent patterns

  • Authors

    • M. Sireesha
    • Srikanth Vemuru
    • S. N. TirumalaRao
    2017-12-31
    https://doi.org/10.14419/ijet.v7i1.5.9121
  • Frequent itemset, Association Rule, Coalesce matrix, Binary Table, Index list.

  • Abstract

    Frequent item set mining and association rule mining is the key tasks in knowledge discovery process. Various customized algorithms are being implemented in Association Rule Mining process to find the set of frequent patterns. Though we have many algorithms apriori is one of the standard algorithm for finding frequent itemsets, but this algorithm is inefficient because of several scans of database and more number of candidates to be generated. To overcome these limitations, in this paper a new algorithm called Coalesce based Binary Table is introduced. Through this algorithm the given database is scanned only once to generate Binary Table by which frequent-1 itemsets are found.  To progress the process, infrequent-1 itemsets are identified and removed from the Binary Table to rearrange the items in support ascending order. To each frequent-1 itemset find Coalesce matrix and Index List to generate all frequent itemsets having the same support count as representative items and the remaining frequent itemsets are obtained in depth first manner. The significant benefits with the proposed method are the whole database is scanned only once, no need to generate and check each candidate to find the set of frequent items. On the other hand frequent items having the same support counts as representative items can be identified directly by joining the representative item with all the combinations of Coalesce matrix. So, it is proven that coalesce based Binary Table is panacea to cut short the time in identifying the frequent itemsets hence the efficiency is improved.

  • References

    1. [1] Han.J, Kamber.M, “Data Mining: Concepts and Techniquesâ€, Morgan kaufmann Publishers, Book, 2000.

      [2] R. Agrawal, T. Imielinski, A. Swami, “Mining associations between sets of items in large databases, Proceedings of the ACM SIGMOD 1993 Conference Washington DC, USA, May 1993.

      [3] R. Agarwal and R. Srikant, “ Fast Algorithm for mining association rulesâ€, Proceedings of the 20th international conference on very large databases , Margunkaufmann , PP. 487-499.

      [4] Huan Wu, Zhigang Lu, Lin Pan, RongshengXu, “An Improved Apriori-based Algorithm for Association Rules Mining“, Sixth International Conference on Fuzzy Systems and Knowledge Discovery, pp. 51-55, 2009.

      [5] Jaishree Singh, Hari Ram, Dr. J.S.Sodhi, “ Improving Efficiency of Apriori Algorithm Using Transaction Reductionâ€, International Journal of Scientific and Research Publications, Vol.3, 2013.

      [6] V. Vijayalakshmi, Dr. A Pethalakshmi, “Mining of Frequent Itemsets with an Enhanced Apriori Algorithm†International Journal of Computer Applications(0975-8887) Volume 81 – No. 4. November 2013.

      [7] V. Vijayalakshmi, Dr. A Pethalakshmi, “An Efficient Count Based Transaction Reduction Approach For Mining Frequent Patternsâ€, Procedia Computer Science, Vol.47, PP. 52-61, 2015.

      [8] Marghny .H, Mohamed .M, and Darwieesh, “ Efficient Mining Frequent Itemset Algorithms â€, International Journal of Machine Learninbg and Cybernatics, Vol. 5, PP. 823-833, 2013.

      [9] Zhuang Chen, Shiban Cai, Qiulin Song, and Chonglai Zhu, “ An Improved Apriori Algorithm Based on Pruning Optimization and Transaction Reductionâ€, Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC), PP. 1908-19011, Aug-2011.

      [10] Jiawei Han, Jianpei, and Yiwenyini, “Mininig Frequent Patterns without Candidate Generationâ€, Proceedings of the ACM SIGMOD International Conference on Management of Data Pages , PP. 1-12, 2000.

      [11] Mohammed J. Zaki and Karam Gouda, “Fast Vertical Mining using Diffsets†Proceedings of the ASM SIGKDD ’03 Washiton, DC, USA, Aug-2003.

      [12] Mingjun Song, and SanguthevarRajasekaran, “A transaction mapping Algorithm for frequent itemset mining “, in IEEE transactions on knowledge and Data Engg.

      [13] Jie Dong, Min Han “BitTableFI: An efficient mining frequent itemsets Algorithm“, Knowlwdge-Based Systems, vol.20, pp.329-335, 2007.

      [14] Jaishree Singh, Hari Ram, Dr. J.S.Sodhi, “ Improving Efficiency of Apriori Algorithm Using Transaction Reductionâ€, International Journal of Scientific and Research Publications, Vol.3, 2013.

      [15] Dr. Seetaiah Kilaru, Harikishore K, Sravani T, Anvesh Chowdary L, Balaji T “Review and Analysis of Promising Technologies with Respect to fifth Generation Networksâ€, 2014 First International Conference on Networks & Soft Computing, pp.270-273,August2014.

      [16] Rajesh, M., and J. M. Gnanasekar. "Congestion control in heterogeneous wireless ad hoc network using FRCC." Australian Journal of Basic and Applied Sciences 9.7 (2015): 698-702.

      [17] S.V.Manikanthan and V.Rama“Optimal Performance Of Key Predistribution Protocol In Wireless Sensor Networks†International Innovative Research Journal of Engineering and Technology ,ISSN NO: 2456-1983,Vol-2,Issue –Special –March 2017.

      [18] T. Padmapriya and V. Saminadan, “Inter-cell Load Balancing Technique for Multi- class Traffic in MIMO - LTE - A Networksâ€, International Conference on Advanced Computer Science and Information Technology , Singapore, vol.3, no.8, July 2015.

  • Downloads

  • How to Cite

    Sireesha, M., Vemuru, S., & TirumalaRao, S. N. (2017). Coalesce based binary table: an enhanced algorithm for mining frequent patterns. International Journal of Engineering & Technology, 7(1.5), 51-55. https://doi.org/10.14419/ijet.v7i1.5.9121

    Received date: 2018-01-11

    Accepted date: 2018-01-11

    Published date: 2017-12-31