DOI: https://doi.org/10.16925/.v14i0.2228

Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree

Pankaj Gupta, Bharat Bhushan Sagar

Abstract


Introduction: The research “Determining weighted, utility-based time variant association rules using frequent pattern tree” was conducted at Birla Institute of Technology, Off Campus: Noida, India, in 2017. 

Methods: To assess the efficiency of the proposed approach for information mining a method and an algorithm was proposed for mining time-variant weighted, utility-based association rules using FP-tree.

Results: A method is suggested to find association rules on time-oriented frequency-weighted, utility-based data, employing a hierarchy for pulling-out of item-sets and establish their association-ship.

Conclusions: The dimensions adopted while developing the approach compressed a large time-variant dataset to a lesser data structure at the same time FP-tree keep away from the repetitive dataset, which finally gives us a noteworthy advantage in articulations of time and memory use.

Originality: In current period, high utility recurrent-pattern pulling-out is one of the mainly noteworthy study areas in time-variant information mining due to its capability to account the frequency rate of item-sets and assorted utility rate of every item-set. This research contributes to maintain it at a corresponding level, which ensures to avoid generation of a big amount of candidate-sets, which make sure further development of less execution time and search spaces.

Limitations: The research results demonstrated that the projected approach was efficient on tested datasets with pre-defined weight and utility calculations.

Keywords


association rule; frequent pattern tree; information mining; time variant; weighted transactions

References


Ivancsy, R. and Vajk, I., 2005. Fast discovery of frequent itemsets: a cubic structure-based approach, Informatica, Vol. 29, pp. 71–78. doi:https://10.1.1.60.8890&rep=rep1&type=pdf

Agrawal, R., Imielinski, T. and Swami, A., 1993. Mining association rules between sets of items in large databases, In: Proceedings of the ACM sigmod international conference on management of data, Washington, D.C, pp. 207-216. doi:https://doi.org/10.1145/170036.170072

Agrawal, R. and Srikant, R., 1994. Fast algorithms for mining association rules, In: Proceedings of the 20th international conference on very large databases, Santiago, Chile, pp. 487-499. doi:http://doi.org/10.1.1.219.6784

Wang, W. Yang, J. And Philip, S. Yu., 2000. Efficient mining of weighted association rules, In: Proceeding of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, CA, USA. doi:https://doi.org/10.1145/312129.312191

Nazar, N. B. and Senthilkumar, R., 2017. An online approach for feature selection for classification in big data, Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 25, pp. 163–171. doi:https://doi.org/10.3906/elk-1501-98

Pillai, J., Soni, S., Vyas, O.P. and Muyeba, M., 2010. A conceptual approach to temporal weighted itemset utility mining, International Journal of Computer Applications, Vol. 28, pp. 0887-0895. doi:https://doi.org/10.5120/510-827

Kim, Yh., Kim, Wy. and Kim, Um., 2010. Mining frequent itemsets with normalized weight in continuous data streams, Journal of Information Processing Systems, Vol. 6, pp. 79-90. doi:https://doi.org/10.3745/JIPS.2010.6.1.079

Christian, B., 2005. An implementation of the fp-growth algorithm, In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, Chicago, Illinois, pp. 1-5. doi:https://doi.org/10.1145/1133905.1133907

Gatuha, G. and Jiang, T., 2017. Smart frequent itemsets mining algorithm based on fp-tree and diffset data structures, Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 25, pp. 2096-2107. doi:http://doi.org/10.3906/elk-1602-113

Tseng, V.S., Shie, B.E., Wu, C. W. and Yu, P. S., 2013. Efficient algorithms for mining high utility itemsets from transactional databases, IEEE TKDE, Vol. 25, pp. 1772–1786. doi:http://doi.org/10.1109/TKDE.2012.59

Goyal, V. and Sureka, A., 2015. Efficient skyline itemsets mining, In: Proceedings of the eighth international C3S2E conference on computer science & software engineering, Japan. doi:https://doi.org/10.1145/2790798.2790816

Cankurt, S. and Subasi, A., 2016. Tourism demand modelling and forecasting using data mining techniques in multivariate time series: a case study in turkey, Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 24, pp. 3388-3404. doi:http://doi.org/10.3906/elk-1311-134

Hu, J. and Mojsilovic, A., 2007. High utility pattern mining: a method for discovery of high utility item sets, Pattern Recognition, Vol. 40, pp. 3317-3324. doi:https://doi.org/10.1016/j.patcog.2007.02.003

Li, Y. C., Yeh, J.S. and Chang, C.C., 2008. Isolated items discarding strategy for discovering high utility itemsets, Data & Knowledge Engineering, Vol. 64, pp. 198-217. doi:https://doi.org/10.1016/j.datak.2007.06.009

Yao, H. and Hamilton, H. J., 2006. Mining itemset utilities from transaction databases, Data & Knowledge Engineering, Vol. 59, pp. 603-626. doi:https://doi.org/10.1016/j.datak.2005.10.004

Ahmed, C. F., Tanbeer, S. K., Jeong, B. S. and Lee, Y. K., 2009. An efficient candidate pruning technique for high utility pattern mining, Advances in Knowledge Discovery and Data Mining, Lecture Notes in Computer Science, Vol. 76, pp. 749-756. doi:https://doi.org/10.1007/978-3-642-01307-2_76

Tseng, V. S., Chu, C. J. and Liang, T., 2008. An efficient mining of temporal high utility itemsets from data streams, Journal of System and Software, Vol. 81 pp.1105-1117. doi:https://doi.org/10.1016/j.jss.2007.07.026

Ahmed, A., Makky, N. El. and Taha, Y., 2008. Incremental mining of constrained association rules, In: Proceeding of the First Siam Conference on Data Mining, Atlanta. doi:https://doi.org/10.1137/1.9781611972719.24

Li, Y., Ning, P., Wang, X. S. and Jajodia, S., 2003. Discovering calendar based temporal association rules, Data and Knowledge Engineering, Vol. 44, pp. 193-214. doi:http://doi.org/10.1016/S0169-023X(02)00135-0

Gupta, P. and Sagar, B.B., 2015. Discovering weighted time varying temporal relationship, Advances in Intelligent Systems and Computing, Springer. doi:http://doi.org/ 10.1007/978-3-319-69096-4

Ale, J. M. and Rossi, G. H., 2000. An approach to discovering temporal association rules, In: ACM Symposium on Applied Computing, Italy. doi:https://doi.org/10.1145/335603.335770

Mittal, V. and Kashyap, I., 2016. Empirical study of impact of various concept drifts in data stream mining methods, International Journal of Intelligent Systems and Applications (IJISA), Vol. 8, pp. 65-72. doi:http://doi.org/10.5815/ijisa.2016.12.08

Novitasari, W., Hermawan, A., Abdullah, Z. and Herawan, T., 2015. A method of discovering interesting association rules from student admission dataset, International Journal of Software Engineering and Its Applications, Vol. 9, pp. 51-66. doi:https://doi.org/10.14257/ijseia.2015.9.8.05

Wang, J., 2017. Application of association rule mining algorithm in logistics information system design, Journal of Software Engineering, Vol. 11, pp. 217-22370. doi:http://doi.org/10.3923/jse.2017.217.223


comments powered by Disqus

Article Metrics

Metrics Loading ...

Metrics powered by PLOS ALM


Revista indexada en:

----

Contacto

Línea gratuita nacional

01 8000 420101

Dirección

Facultad de Ingeniería
Avenida Caracas no. 37-15 
Bogotá, D.C.

Teléfono

(57) (1) 3323565

(57) 3004956353

Revista en OJS implementada por Biteca Ltda.