Discovery of incremental association rules based on a new FP-growth algorithm

Simple item page
dc.contributor.authorKreesuradej, Worapoj
dc.contributor.authorThurachon, Wannasiri
dc.date.accessioned2026-08-06T10:24:00Z
dc.date.available2026-08-06T10:24:00Z
dc.date.issued2019-02-01
dc.description.abstractIn this paper, we propose a new FP-Growth algorithm for incremental association rule discovery. We also design a new FPISC-tree based on the FUFP-tree structure. The new FPISC-tree is more suitable for the task of incremental association rule discovery than FUFP-tree structure. The basic ideas of the proposed algorithm are to retrieve the frequent itemsets from the original database and to use their support count in the update of the new support count of the incremental database so that the original paths do not need to be reprocessed as well as to strategically use them to discover frequent itemsets from the FPISC-tree. Experimental results show that the proposed algorithm was able to reduce the number of constructed subtrees and the execution time was significantly less than those of the FP-Growth and FUFP-tree.
dc.identifier.citation2019 IEEE 4th International Conference on Computer and Communication Systems Icccs 2019, 184-188, 2019
dc.identifier.doi10.1109/CCOMS.2019.8821700
dc.identifier.other2-s2.0-85072960651
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/9718
dc.source2019 IEEE 4th International Conference on Computer and Communication Systems Icccs 2019
dc.subjectBig data
dc.subjectData mining
dc.subjectFP-growth
dc.subjectFUFP-tree
dc.subjectIncremental association rule discovery
dc.titleDiscovery of incremental association rules based on a new FP-growth algorithm
dc.typeConference Paper

Files

Collections

Research