IPOC: an efficient approach for dynamic association rule generation using incremental data with updating supports

P. Naresh, R. Suguna


According to recent statistics, there was drastic growth in online business sector where more number of customers intends to purchase items. Due to these retailers accumulates huge volumes of data from day to day operations and engrossed in analyzing the data to watch the behavior of customers at items which strengthen the business promotions and catalog management. It reveals the customer interestingness and frequent items from large data. To carry out this there was known algorithms present which deals with static and dynamic data. Some of them are lag time and memory consuming and involves unnecessary process. This paper intents to implement an efficient incremental pre ordered coded tree (IPOC) generation for data updates and applies frequent item set generation algorithm on the tree. While incremental generation of tree, new data items will link to previous nodes in tree by increasing its support count. This removes the lagging issues in existing algorithms and does not need to mine from scratch and also reduces the time, memory consumption by the use of nodeset data structure. The results of proposed method was observed and analyzed with existing methods. The anticipated method shows improved results by means of generated items, time and memory.


Dataset; Incremental tree generation; IPOC; Nodeset;

Full Text:


DOI: http://doi.org/10.11591/ijeecs.v24.i2.pp1084-1090


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics