COMPARATIVE ANALYSIS OF THE DATA STRUCTURE FOR MINING ALL FREQUENT ITEMSETS
Discovering All Frequent Items is one of the most important steps in the association rules mining process. Typically, the minimum support is used as a criterion for selecting an interesting itemset. There are many researchers who focus to improve the efficiency of the entire data set algorithm in various ways. For example, data reduction, structuring of new data, and search space reduction. This study analyzes the advantages and disadvantages of four-type data structure: Map Itemset - Horizontal Data, Map Itemset - Vertical Data, Map Different Set -Horizontal Data, and Map Different Set - Vertical data. The experiment was conducted with 6 datasets, which are dense and sparse datasets from the UCI standard datasets. The results show that Map Differential - Horizontal Data can reduce the size of datasets better than other techniques that use dense datasets. Map Itemset - Horizontal Data can reduce the size of datasets better than other techniques that use sparse datasets.
B. Goethals. 2002, Efficient Frequent Pattern Mining. Phd Thesis in Transnationale University Limburg.
C.C.Aggarwal and J. Han, Frequent Pattern Mining. Springer International Publishing Switzerland, 2014.
F.Flouvat, F. De Marchi and J. Marc Petit. A new classiï¬cation of Datasets for frequent itemsets. J IntellInfSyst (2010) 34:1â€“19.
J.Han. Data Mining: Concepts and Techniques Second Edition. University of Illinois at Urbana- Champaign. Elsevier, 2006.
J.Han, J. Pei, and Y. Yin, Mining Frequent Patterns Without Candidate Generation, Proc. ACM-SIGMODIntâ€™l Conf. Management of Data, pp. 1-12, May 2000.
J.Han, et al, Frequent pattern mining: current status and future Directions.
J. Zhu. 2014, Efficiently Mining Frequent ItemsetsFrom Very Large Databases. Phd. Thesis. Concordia University, Canada.
K. Garg and D. Kumar. Comparing the Performance of Frequent Pattern Mining Algorithms. InternationalJournal of Computer Applications (0975-8887). V. 69. No.25, 2013.
K.Gouda and M.J.Zaki. Efficiently mining maximal frequent itemsets. In 1st IEEE International Conference onData Mining (ICDM), pages 163-170, San Jose, November 2001.
L.Vu, and G.Alaghband. Mining Frequent Patterns Based on Data Characteristics. IEEE Department ofComputer Science and Engineering, University of Colorado Denver, Denver, CO, USA.
L.XU. 2011, A Study of Frequent Pattern Mining in Transaction Datasets. Thesis of Doctor of Philosophy inComputer Science, Massey University, Palmerston North, New Zealand.
M.J.Zaki and K.Gouda. Fast Vertical Mining Using Diffsets.Rensselaer Polytechnic Institute, Troy, NY,USA. Kyushu University, Fukuoka Japan.
Santhosh, M., Kavitha, S., Keerthana, R., Suganya, L., & Krishnakumar, S. (2016). Electronic Voting Machine Using Internet. InternationalCommunication and computer Technologies.
M.J. Zaki, et al. New algorithms for fast discovery of association rules. In 3rdIntl. Conf. on KnowledgeDiscovery and Data Mining. 1997, 283-296.
M.J. Zaki and W.M. JR. Data Mining and Analysis Fundamental Concepts and Algorithms. CambridgeUniversity Press. New York, NY 10013-2473, USA. 2014.
P. Sengar and M. Barot. Discovering Frequent Patterns with New Mining Procedure. IOSR Journal of Computer Engineering (IOSR-JCE) V. 10, Issue 5. 2013, 32-37.
Q.Zou, et al. Mining Association Rule from Tabular Data Guided by Maximal Frequent Itemsets. This researchis supported by the NIH PPG Grant #4442511- 33780 and the NSF IIS Grant #97438.
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In J.B. Bocca, Proceedings of the 20thInternational Confrerence on Very Large Data Bases (VLDBâ€™94), Santiago dc Chile, Morgan Kaufmann,1994.
R. Agarwal, T. Imielinski, and A. Swami. Mining association rules Between Sets of Items in Large Databases.Proc. ACM SIGMOD International Conference on Management of Data (SIGMODâ€™93), Washington, D.C., USA, 2007.
R.C. Agarwal, C.C.Aggarwal, and V.V.V.Prasad. Depth first generation of long pattern, In Proceedings of thesixth ACM SIGKDD International conference on Knowledge discovery and data mining, Pages 108-118, 2000.
R.J. Bayardo. Efficiently Mining Long Patterns from Databases. Proc. ACM-SIGMOD Intâ€™l Conf.Management on Data, pp. 85-93, 1998.
T. Hu, et al. Discovery of maximum length frequent itemsets, Journal of Information Sciences. 2007.
T. Khongtuk, et.al. MapDiff-FI: Map Different Sets for Frequent Itemsets Mining, International Conference onApplied Science and Technology (ICAST. 2018), Penang, Malaysia, 10-12 April 2018.
T.Lu, S.Tian, and S.Wang. Header Table Recursion Algorithm for Mining Frequent Patterns. Advances in information Sciences and Service Sciences (AISS) Volume 5, No 2, 2013.
X. Zhu, H. Deng and Z. Chen. A Brief Review on Frequent Pattern Mining. Jianghan University, Wuhan, China. IEEE, 2011.
The submitter hereby warrants that the Work (collectively, the “Materials”) is original and that he/she is the author of the Materials. To the extent the Materials incorporate text passages, figures, data or other material from the works of others, the undersigned has obtained any necessary permissions. Where necessary, the undersigned has obtained all third party permissions and consents to grant the license above and has all copies of such permissions and consents.
The submitter represents that he/she has the power and authority to make and execute this assignment. The submitter agrees to indemnify and hold harmless the COMPUSOFT from any damage or expense that may arise in the event of a breach of any of the warranties set forth above. For authenticity, validity and originality of the research paper the author/authors will be totally responsible.