PLI-X: Temporal Association Rules Mining in Customer Relationship Management Systems

Document Type : Machine Learning - Monsefi

Authors

1 Alzahra University

2 Qazvin

Abstract

The temporal association rules mining has recently become an important technology in the field of the Customer Relationship Management (CRM), which can be useful for improving the customer enterprise relationship. Also, the dynamic nature of the CRM systems is made necessity of using efficient and rapid algorithms in order to extract valid patterns in this field. Hence, this paper proposes an efficient algorithm of incremental mining for temporal association rules in CRM entitled PLI-X. The four significant features that are considered for this algorithm are:(1) generating  valid temporal association rules after adding the new transactions to the database, (2) performing algorithm on the whole temporal database instead of a small section of it, (3) performing the temporal transactional databases of the non-numeric, and (4) quickly generating the temporal association rules and reducing the run time by partitioning the candidate itemsets based on the previous partitions and scanning database when scan is necessary. Experimental result is the valid proof for the correctnessof this assertion. It seems that the PLI-X algorithm can be used as a strong tool in order to extract valid patterns and discover useful temporal association rules in the field of CRM.

Keywords


[1] Fares, A., Gama, J. and Campos, P.: Process mining for analyzing customer relationship management systems: A case study. In Learning from Data Streams in Evolving Environments, Part of the Studies in Big Data book series (SBD, volume 41), 209-221. Springer, (Cham. 2019)
[2] Srivastava, S.K., Chandra, B. and Srivastava, P.: The impact of knowledge management and data mining on CRM in the service industry. In Nanoelectronics, Circuits and Communication Systems, 37-52, Springer, Singapore. (2019)
[3] Rahman, N.: A taxonomy of data mining problems. In Cognitive Analytics: Concepts, Methodologies, Tools, and Applications, 512-528, IGI Global. (2020)
[4] Tembhurne, D.S., Adhikari, J. and Babu, R.: A Review study on Application of Data Mining Techniques in CRM of Pharmaceutical Industry. IJSRSTInternational Journal of Scientific Research in Science and Technology, Vol. 6, no. 2,1-7, (2019).
[5] Keyvanpour, M. R., Etaati, A.: Analytical Classification and Evaluation of Various Approaches in Temporal Data Mining. Advanced Information Technology in Education. In: Springer, 303-311. (2012)
[6] Grossmann, W., Rinderle-Ma, S.: Data Mining for Temporal Data. In: Fundamentals of Business Intelligence. Data-Centric Systems and Applications. Springer, Berlin, Heidelberg, 207-244. (2015)
[7] Radhakrishna, V., Kumar, P. V., Janaki, V.: A survey on temporal databases and data mining. In Proceeding of the The International, Conference on Engineering and MIS. ACM, New York, NY, USA, 52-58. (2015)
[8] Mehrmolaei, S. and Keyvanpour, M.R.: An enhanced hybrid model for event prediction in healthcare time series. International Journal of Knowledge-based and Intelligent Engineering Systems, vol. 23, no. 3, 131-147. (2019)
[9] Emtiyaz, S., Keyvanpour, M. R.: Customers behavior modeling by semi-supervised learning in customer relationship management. arXiv preprint arXiv:1201.1670. (2012)
[10] Tripathi, T. and Yadav, D.: Performance Evaluation of Methods for Mining Frequent Itemsets on Temporal Data. In International Conference on Computer Networks and Inventive Communication Technologies, 910-917. Springer, Cham. (2019)
[11] Chamazi, M.A. and Motameni, H.: Finding suitable membership functions for fuzzy temporal mining problems using fuzzy temporal bees method. Soft Computing, vol. 23, no. 10, pp.3501-3518. (2019)
[12] Sornalakshmi, M., Balamurali, S., Venkatesulu, M., Navaneetha Krishnan, M., Ramasamy, L.K., Kadry, S., Manogaran, G., Hsu, C.H. and Muthu, B.A.: Hybrid method for mining rules based on enhanced Apriori algorithm with sequential minimal optimization in healthcare industry. Neural Computing and Applications, 1-14. (2020)
[13] Ghorbani, M., Abessi, M.: A New Methodology for Mining Frequent Itemsets on Temporal Data. IEEE Transactions on Engineering Management, Vol. 64, No. 4, 566-573. (2017)
[14] Kiran, R. U., Reddy, P.P.C., Zettsu, K., Toyoda, M., Kitsuregawa, M. and Reddy, P.K.: Efficient Discovery of Weighted Frequent Neighborhood Itemsets in Very Large Spatiotemporal Databases. IEEE Access, 8, 27584-27596. (2020)
[15] Rachburee, N., et al.: Failure Part Mining Using an Association Rules Mining by FP-Growth and Apriori. Algorithms: Case of ATM Maintenance in Thailand. IT Convergence and Security. In: Springer, 19-26. (2018)
[16] Wang, C. and Zheng, X.: Application of improved time series Apriori algorithm by frequent itemsets in association rule data mining based on temporal constraint. Evolutionary Intelligence, vol. 13, no. 1, 39-49. (2020)
[17] Hareendran, S. A., Chandra, S. V.: Association Rule Mining in Healthcare Analytics. In International Conference on Data Mining and Big Data, In: Springer, 31-39. (2017)
[18] Wang, L., et al.: Mining temporal association rules with frequent itemsets tree. Applied Soft Computing, Vol. 62, 817-829. (2018)
[19] Ait-Mlouk, A., et al.: An improved approach for association rule mining using a multi-criteria. decision support system: a case study in road safety. European transport research review, Vol. 9, No. 3, 40. https://doi.org/10.1007/s12544-017-0257-5. (2017)
[20] Logeswaran, K., Suresh, P., Savitha, S. and KR, P.K.: Optimization of Evolutionary Algorithm Using Machine Learning Techniques for Pattern Mining in Transactional Database. In Handbook of Research on Applications and Implementations of Machine Learning Techniques (pp. 173-200). IGI Global. (2020)
[21] Telikani, A., Gandomi, A.H. and Shahbahrami, A.: A survey of evolutionary computation for association rule mining. Information Sciences, vol. 524, 318-352. (2020)
[22] Song, Y-G., et al.: Parallel Incremental Frequent Item set Mining for Large Data. Journal of Computer Science and Technology, Vol. 32, No. 2, 368-385. (2017)
[23] Li, H., et al.: A Heuristic Rule Based Approximate Frequent Item set Mining Algorithm. Procedia Computer Science, Vol. 91, 324-333. (2016)
[24] Agarwal, R.: Decision-Making with Temporal Association Rule Mining and Clustering in Supply Chains. In Optimization and Inventory Management, 459-470. Springer, Singapore. (2020)
[25] Mai, T., Vo, B., Nguyen, L. T.: A lattice-based approach for mining high utility association rules. Information Sciences, Vol. 399, 81-97. (2017)
[26] Lee, C-H., et al.: Progressive partition miner: an efficient algorithm for mining general temporal association rules. IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 4,1004-1017. (2003)
[27] Xiong, L., Liu, X., Guo, D. and Hu, Z.: Access patterns mining from massive spatio-temporal data in a smart city. Cluster Computing, vol. 22, no. 3, 6031-6041. (2019)
[28] Kadir, M., Sobhan, S. and Islam, M.Z.: Temporal relation extraction using Apriori algorithm. 5th International Conference on Informatics, Electronics and Vision (ICIEV), IEEE Xplore, 915-920, doi: 10.1109/ICIEV.2016.7760133. (2016)
[29] Maragatham, G., Lakshmi, M.: UTARM: an efficient algorithm for mining of utility-oriented temporal association rules. International Journal of Knowledge Engineering and Data Mining, Vol. 3, No. 2, 208-237. (2015)
[30] Hong, T. P., et al. Discovery of temporal association rules with hierarchical granular framework. Applied Computing and Informatics, Vol. 12, No. 2, 134-141. (2016)
[31] Tan, T. F., et al.: Temporal Association Rule Mining. In: He X. et al. (eds) Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. IScIDE. Lecture Notes in Computer Science, Vol. 9243. Springer, Cham. (2015)
[32] Ilham, A., GS, A.D., Laumal, F.E., Kurniasih, N., Iskandar, A., Manulangga, G., Iswara, I.B.A.I. and Rahim, R.: Market Basket Analysis Using Apriori and FP-Growth for Analysis Consumer Expenditure Patterns at Berkah Mart in Pekanbaru Riau. In Journal of Physics: Conference Series, Vol. 1114, no. 1, 1-10, IOP Publishing, doi :10.1088/1742-6596/1114/1/012131. (2018)
[33] Hasan, M.M. and Mishu, S.Z.: An Adaptive Method for Mining Frequent Itemsets Based on Apriori And FP Growth Algorithm. In IEEE xplore International Conference on Computer, Communication, Chemical, Material and Electronic Engineering (IC4ME2), 1-4. (2018)
[34] Hong, T.-P. , Yu Lin, Ch., Huang , W. M., Li , S. , M., Wang, S. L. , Lin, J. C. W.: Mining Temporal Fuzzy Utility Itemsets by Tree Structure, IEEE International Conference on Big Data (Big Data), 1-5, Los Angeles, CA, USA, USA, DOI: 10.1109/BigData47090.2019.9006317. (2019)
[35] Sathyavani, D. and Sharmila, D.: An improved memory adaptive up-growth to mine high utility itemsets from large transaction databases. Journal of Ambient Intelligence and Humanized Computing, 1-10. (2020)
[36] Wang, W., et al.:TAR: Temporal association rules on evolving numerical attributes. In Proceedings of IEEE 17th International Conference on Data Engineering, 283-292. (2001)
[37] Gharib, T. F., et al.: An efficient algorithm for incremental mining of temporal association rules. Data and Knowledge Engineering, Vol. 69, No. 8, 800-815. (2010)
[38] Huang, J-W., et al.: Twain: Two-end association miner with precise frequent exhibition periods. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 1, No. 2, 8. (2007)
[39] Kumar, B.P. and Paulraj, D.: Frequent mining analysis using pattern mining utility incremental algorithm based on relational query process. Journal of Ambient Intelligence and Humanized Computing, 1-11. (2020)
[40] Hui, L., Chen, Y.C., Weng, J.T.Y. and Lee, S.Y.: Incremental mining of temporal patterns in interval-based database. Knowledge and Information Systems, vol. 46, no.2, 423-448. (2016)
[41] Sun, J., Xun, Y., Zhang, J. and Li, J.: Incremental Frequent Itemsets Mining With FCFP Tree. IEEE Access, 7, 136511-136524. (2019)
[42] Matthews, S.G., Gongora, M.A., Hopgood, A.A.: Evolving temporal association rules with genetic algorithms, in: International Conference on Innovative Techniques and Applications of Artificial Intelligence, 107-120. (2010)
[43] Maragatham, G., Lakshmi, M.: A weighted particle swarm optimization technique for optimizing association rules, in: International Conference on Computing and Communication Systems, 655-664. (2011)
[44] Wen, F., Zhang, G., Sun, L., Wang, X., Xu, X.: A hybrid temporal association rules mining method for traffic congestion prediction, Computers & Industrial Engineering 130, 779-787. (2019)
[45] Matthews, S.G. , Gongora, M.A., Hopgood, A.A.: Evolving temporal fuzzy association rules from quantitative data with a multi-objective evolutionary algorithm, in: International Conference on Hybrid Artificial Intelligence Systems, 198-205. (2011)
[46] Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., Coello, C.A.C.: A survey of multiobjective evolutionary algorithms for data mining: Part I, IEEE Transactions on Evolutionary Computation, vol. 18, no. 1, 4-19. (2014)
[47] Ahmed, C. F., et al.: Interactive mining of high utility patterns over data streams. Expert Systems with Applications, Vol. 39, No. 15, 11979-11991. (2012)
[48] Bettini, C., et al.: Temporal Granularity. In: Liu L., zsu M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. (2016)
[49] Kusumakumari, V., et al.: Frequent pattern mining on stream data using Hadoop Can Tree-GTree. Procedia Computer Science, Vol. 115, 266-273. (2017)
[50] Lin CW, et al.: Mining High Utility Itemsets Based on the Pre-large Concept. In: Chang RS., Jain L., Peng SL. (eds) Advances in Intelligent Systems and Applications, Smart Innovation, Systems and Technologies, vol 20. Springer, Berlin, Heidelberg, 243-250. (2013)
[51] Junheng-Huang,W-W.: Efficient algorithm for mining temporal association rule. The International Journal of Computer Science and Network Security (IJCSNS), Vol. 7, No. 4, 268-271. (2007)
[52] Nguyen, L. T. T., Nguyen, N. T.: Incremental Mining Class Association Rules Using Diffsets. In: Le Thi H., Nguyen N., Do T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, Springer, Cham, Vol. 358, 197-208. (2015)