Temporal association rules discovery algorithm based on improved index tree

5Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

With the rapid increase of information generated from all kinds of sources, temporal big data mining in business area has been paid more and more attention recently. A novel data mining algorithm for mining temporal association is proposed. Mining temporal association can not only provide better predictability for customer behaviour but also help organisations with better strategies and marketing decisions. To compare the proposed algorithm, two methods to mine temporal association are presented. One is improved based on a traditional mining algorithm, Apriori. The other is based on an Index-Tree. Moreover, the proposed method is extended to mine temporal association in multi-dimensional space. The experimental results show that the Index-Tree method outperforms the Apriori-modified method in all cases.

Cite

CITATION STYLE

APA

Yuanyuan, C., Rui, W., Bin, Z., & Griffith, W. S. (2021). Temporal association rules discovery algorithm based on improved index tree. Applied Mathematics and Nonlinear Sciences, 6(1), 115–128. https://doi.org/10.2478/amns.2021.1.00016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free