CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

An Efficient Binary to Decimal Conversion Approach for Discovering Frequent Patterns

by Kapil Chaturvedi, Ravindra Patel, D. K. Swami
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 75 - Number 12
Year of Publication: 2013
Authors: Kapil Chaturvedi, Ravindra Patel, D. K. Swami
10.5120/13165-0858

Kapil Chaturvedi, Ravindra Patel, D. K. Swami . An Efficient Binary to Decimal Conversion Approach for Discovering Frequent Patterns. International Journal of Computer Applications. 75, 12 ( August 2013), 29-34. DOI=10.5120/13165-0858

@article{ 10.5120/13165-0858,
author = { Kapil Chaturvedi, Ravindra Patel, D. K. Swami },
title = { An Efficient Binary to Decimal Conversion Approach for Discovering Frequent Patterns },
journal = { International Journal of Computer Applications },
issue_date = { August 2013 },
volume = { 75 },
number = { 12 },
month = { August },
year = { 2013 },
issn = { 0975-8887 },
pages = { 29-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume75/number12/13165-0858/ },
doi = { 10.5120/13165-0858 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:44:06.933854+05:30
%A Kapil Chaturvedi
%A Ravindra Patel
%A D. K. Swami
%T An Efficient Binary to Decimal Conversion Approach for Discovering Frequent Patterns
%J International Journal of Computer Applications
%@ 0975-8887
%V 75
%N 12
%P 29-34
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Association Rule Mining(ARM) is a most vital field of data mining to discover interesting relationship between items from huge transaction databases it analysis the data and discover strong rules using different measures such as (support, confidence, lift, conviction) etc, various ARM algorithms are available in literature for discovering frequent patterns. Market Basket analysis is one of the most essential applications of ARM; other applications are pattern recognition, weblog data mining and special data analysis etc. In this paper we proposed B2DCARM algorithm to discover frequent pattern which use Boolean matrix based technique. This algorithm adopts binary to decimal conversion approach to discover frequent itemsets from huge transaction database which outperforms in both of the cases where support threshold is low or high and also better performs from efficiency point of view compare to available tree based approaches.

References
  1. U. M. Fayyad, et al. : "From Data Mining to Knowledge Discovery: An Overview", "Advances in Knowledge Discovery and Data Mining", AAAI Press/ MIT Press, pp 1-34, 1996.
  2. J. Han, M. Kamber, "Data Mining Concepts and Techniques", Morgan Kaufmann Publishers, San Francisco, USA, ISBN 1558604898, 2001.
  3. C Q Zhang, S C Zhang. "Association Rule Mining: Models and Algorithms". New York: Springer, 2002.
  4. R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Databases", In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 207-216, 1993.
  5. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules", Proceedings 20th Very Large Databases Conference, Santiago, Chile, pp. 487–499, 1994.
  6. J. Han, J. Pei,and, Y. Yin. "Mining frequent patterns without candidate generation", In Proceedings of the 2000 ACM SIGMOD international conference on Man agement of data, pp 1–12, 2000.
  7. M. J. Zaki. "Fast vertical mining using diffsets. Technical" Report 01-1, Rensselaer Polytechnic Institute, Troy, New York, 2001
  8. Hunbing Liu and Baishen Wang, "An Association Rule Mining Algorithm Based On Boolean Matrix", Data Science Journal,Volume 6,Supplement9, 2007 pp-63-66.
  9. ZHANG ZONG-YU, ZHANG YA-PING,"A parallel algorithm of frequent itemsets mining based on bit matrix", International Conference on Industrial Control and Electronics Engineering, 2012, pp. 1210-1213
  10. Agrawal, R. , Imielinski, T. , Swami,A. , "Database mining: A performance perspective. IEEE Trans. Knowledge and Data Eng. ", 5(6) ,1993, pp-914-925.
  11. Yubo Yuan, Tingzhu Huang, "A Matrix Algorithm for Mining Association Rules", Springer-Verlag Berlin Heidelberg 2005, pp-370-379
  12. Pratima Gautam, K. R. Pardasani, "A Fast Algorithm for Mining Multilevel Association Rule Based on Boolean Matrix", (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 03, 2010, pp 746-752
  13. Pav´on, J. , S. Viana, and S. G´omez, "Matrix apriori: Speeding up the search for frequent patterns". In Proceedings of the 24th IASTED International Conference on Database and Applications, DBA'06, Anaheim, CA, USA ACTA Press, 2006 pp. 75–82.
  14. Database URL: http://www2. cs. uregina. ca/~dbd/ cs831/notes/itemsets/datasets. php.
  15. An Implementation of FP-growth, "http://cgi. csc. liv. ac. uk/~frans/KDD/Software/FPgrowth/fpGrowth. html", Department of Computer Science, The University of Liverpool.
  16. Neelu Khare, Neeru Adlakha, K. R. Pardasani, "An Algorithm for Mining Multidimensional Association Rules using Boolean Matrix", IEEE International Conference on Recent Trends in Information, Telecommunication and Computing, 2010, pp. 95-99
  17. Xuezhi Chi, "A New Matrix-Based Association Rules Mining Algorithm", 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2012), 2012,pp. 633-636
Index Terms

Computer Science
Information Sciences

Keywords

ARM B2DCARM Frequent Pattern mining Boolean matrix

Powered by PhDFocusTM