An Intelligent Decision in Smart Systems Using A Weighted Frequent Itemset Mining Algorithm

Authors

  • K. Lavanya  Computer Science and Engineering,VasireddyVenkatadri Institute of Technology, Guntur, Andhra Pradesh, India
  • K. Triveni  Computer Science and Engineering,VasireddyVenkatadri Institute of Technology, Guntur, Andhra Pradesh, India
  • K. Bala Mamatha3  Computer Science and Engineering,VasireddyVenkatadri Institute of Technology, Guntur, Andhra Pradesh, India
  • K. Meghana  Computer Science and Engineering,VasireddyVenkatadri Institute of Technology, Guntur, Andhra Pradesh, India
  • Dr. G. Sanjay Gandhi  Professor of CSE, VasireddyVenkatadri Institute of Technology, Guntur, Andhra Pradesh, India

DOI:

https://doi.org//10.32628/CSEIT1195296

Keywords:

Frequent itemset mining, Weight judgment, Downward closure property,Intelligent decision, Smart system, Association Rule Mining (ARM),Data mining.

Abstract

Intelligent decision is the key technology of smart systems. Data mining technology has been playing an increasingly important role in decision making activities. The introduction of weight makes the weighted frequent itemsets not satisfy the downward closure property any longer. As a result, the search space of frequent itemsets cannot be narrowed according to downward closure property which leads to a poor time efficiency. In this paper, the weight judgment downward closure property for weighted frequent itemsets and the existence property of weighted frequent subsets are introduced and proved first. The Fuzzy-based WARM satisfies the downward closure property and prunes the insignificant rules by assigning the weight to the itemset. This reduces the computation time and execution time. This paper presents an Enhanced Fuzzy-based Weighted AssociationRuleMining(E-FWARM) algorithm for efficient mining of the frequent itemsets. The pre-filtering method is applied to the input dataset to remove the item having low variance. Data discretization is performed and E-FWARM is applied for mining the frequent itemsets. The experimental results show that the proposed E-FWARM algorithm yields maximum frequent items, association rules, accuracy and minimum execution time than the existing algorithms.

References

  1. Xuejian Zhao, Xihui Zhang, Pan Wang, Songle Chen and Zhixin Sun “ A weighted frequent itemset mining algorithm,”2016
  2. C. K.-S. Leung, M. A. F. Mateo, and D. A. Brajczuk, "A tree-based approach for frequent pattern mining from uncertain data," in Proc.PAKDD, 2008, pp. 653 6621
  3. L. Wang, L. Feng, and M. Wu, "AT-Mine: An effcient algorithm of frequent itemset mining on uncertain dataset," J. Comput., vol. 8, no. 6, 1417 1427, Jun. 2013.
  4. G. Lee, U. Yun, and K. H. Ryu, "Sliding window based weighted maximal frequent pattern mining over data streams," Expert Syst. Appl., vol. 41, no. 2, pp. 694 708, Feb. 2014.
  5. L. Yue, "Review of algorithm for mining frequent patterns from uncer-tain data," Int. J. Comput. Sci. Netw. Secur., vol. 15, no. 6, pp. 17 21, Jun. 2015.
  6. J. Pei, J. Han, and W. Wang, "Constraint-based sequential pattern min-ing: The pattern-growth methods," J. Intell. Inf. Syst., vol. 28, no. 2, 133 160, Apr. 2007.
  7. C. C. Aggarwal and P. S. Yu, "A survey of uncertain data algorithms and applications," IEEE Trans. Knowl. Data Eng., vol. 21, no. 5, pp. 609 623, May 2009.
  8. D. Suciu, "Probabilistic databases," ACM Sigact News, vol. 39, no. 2, 111 124, Jun. 2008.
  9. C.-K. Chui, B. Kao, and E. Hung, "Mining frequent itemsets from uncer-tain data," in Proc. Paci c-Asia Conf. Knowl. Discovery Data Mining, 2007, pp. 47 58.
  10. C. K. Chui and B. Kao, "A decremental approach for mining frequent itemsets from uncertain data," in Proc. PAKDD, 2008, pp. 64 75.
  11. L. Wang, D. W.-L. Cheung, R. Cheng, S. D. Lee, and X. S. Yang, "Efcient mining of frequent item sets on large uncertain databases," IEEE Trans. Knowl. Data Eng., vol. 24, no. 12, pp. 2170 2183,Dec. 2012.
  12. X. Sun, L. Lim, and S. Wang, "An approximation algorithm of mining frequent itemsets from uncertain dataset," Int. J. Advancements Comput.Technol., vol. 4, no. 3, pp. 42 49, Feb. 2012.
  13. C. C. Aggarwal, Y. Li, J. Wang, and J. Wang, "Frequent pattern mining with uncertain data," in Proc. ACM KDD, 2009, pp. 29 38.
  14. C. K.-S. Leung and S. K. Tanbeer, "Fast tree-based mining of frequent itemsets from uncertain data," in Proc. Int. Conf. Database Syst. Adv.Appl., 2012, pp. 272 287.
  15. C. K.-S. Leung and S. K. Tanbeer, "PUF-Tree: A compact tree structure for frequent pattern mining of uncertain data," in Proc. Paci c-Asia Conf.Knowl. Discovery Data Mining, 2013, pp. 13 25.
  16. C. K.-S. Leung, R. K. Mackinnon, and S. K. Tanbeer, "Tightening upper bounds to the expected support for uncertain frequent pattern min-ing," in Proc. 18th Int. Conf. Knowl.-Based Intell. Inf. Eng. Syst., 2014, 328 337.
  17. C. W. Lin and T. P. Hong, "A new mining approach for uncertain databases using CUFP trees," Expert Syst. Appl., vol. 39, no. 4, pp. 4084 4093, Mar. 2012.
  18. G. Lee, U. Yun, and H. Ryang, "An uncertainty-based approach: Fre-quentitemset mining from uncertain data with different item importance," Knowl.-Based Syst., vol. 90, pp. 239 256, Dec. 2015.
  19. G. Lee and U. Yun, "A new efcient approach for mining uncertain frequent patterns using minimum data structure without false positives," Future Gener. Comput. Syst., vol. 68, pp. 89 110, Mar. 2017.
  20. W. Wang, J. Yang, and P. S. Yu, "Efcient mining of weighted association rules (war)," in Proc. 6th ACM SIGKDD Int. Conf. Knowl. Discovery DataMining, 2000, pp. 270 274.

Downloads

Published

2019-04-30

Issue

Section

Research Articles

How to Cite

[1]
K. Lavanya, K. Triveni, K. Bala Mamatha3, K. Meghana, Dr. G. Sanjay Gandhi, " An Intelligent Decision in Smart Systems Using A Weighted Frequent Itemset Mining Algorithm, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 5, Issue 2, pp.1109-1119, March-April-2019. Available at doi : https://doi.org/10.32628/CSEIT1195296