A Weighted Frequent Itemset Mining Algorithm for Intelligent Decision in Smart System

Authors(3) :-A. Kowsalya, S. Uma Parameswari, N. Kokila

Identifying the frequent item set is the challenging task in data mining as data is increased day by day in all fields. To analyze the accurate item set in that data like market basket is the key factor of improving the economical strategy of the marketing management. Frequent itemset mining, as an imperative of association rule examination, one of the mainly essential study fields in data mining. Weighted frequent itemset mining in vague databases equally the current prospect and significance of items into version in order to discover frequent itemsets of great importance to users. But many data are inconsistency because of the incomplete field in the collected data. This brings less stability in predicting the accurate information in the data which has the many fields. Many existing research have developed many technique or algorithm to bring the stable procedure to predict the data. But achieving the 100% accurate data from the collected dataset is still not completed. In this thesis, the proposed system will bring various parameters that will analyze dataset with Apriori and weighted Downwards Frequency Itemset Mining (WDFIM). In this analysis the minimum support, confidence level and time consumption are the parameters that analyzed where WDFIM is analyzing more accurate result when compared to Apiori algorithm.

Authors and Affiliations

A. Kowsalya
Assistant Professor, K. S. Rangasamy College of Arts and Science, Tiruchengode, Namakkal, Tamil Nadu, India
S. Uma Parameswari
Assistant Professor, K. S. Rangasamy College of Arts and Science, Tiruchengode, Namakkal, Tamil Nadu, India
N. Kokila
Assistant Professor, K. S. Rangasamy College of Arts and Science, Tiruchengode, Namakkal, Tamil Nadu, India

Data mining, WDFIM, Apiori Algorithm

  1. R. Ishita and A. Rathod, “Frequent Itemset Mining in Data Mining: A Survey,” International Journal of Computer Applications, vol. 139, no. 9, pp.15-18, April 2016.
  2. L. Yue, “Review of Algorithm for Mining Frequent Patterns,” International Journal of Computer Science and Network Security, vol. 15, no.6, pp.17-21, June 2015.
  3. T. G. Green and V. Tannen, “Models for incomplete and probabilistic information,” Lecture Notes in Computer Science, vol. 29, no.1, pp.278-296, Oct. 2006.
  4. C. C. Aggarwal and P. S. Yu, “A Survey of Uncertain Data Algorithms and Applications,” IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 5, pp. 609-623, May, 2009.
  5. D. Suciu, “Probabilistic databases,” Acm Sigact News,vol.39, no.2, pp.111-124, Feb. 2011.

Publication Details

Published in : Volume 5 | Issue 5 | September-October 2019
Date of Publication : 2019-10-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 249-255
Manuscript Number : CSEIT195518
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

A. Kowsalya, S. Uma Parameswari, N. Kokila, "A Weighted Frequent Itemset Mining Algorithm for Intelligent Decision in Smart System", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 5, Issue 5, pp.249-255, September-October-2019. Available at doi : https://doi.org/10.32628/CSEIT195518
Journal URL : https://res.ijsrcseit.com/CSEIT195518 Citation Detection and Elimination     |      |          | BibTeX | RIS | CSV

Article Preview