Article Open Access Logo

USING CYCLIC ASSOCIATION RULES IN TEMPORAL DATABASE

Nguyen Dinh Ngoc 1
Nguyen Xuan Huy 2
Nguyen Dinh Thuan 3
Volume & Issue: Vol. 7 No. 8 (2004) | Page No.: 12-19 | DOI: 10.32508/stdj.v7i8.3237
Published: 2004-08-31

Online metrics


Statistics from the website

  • Abstract Views: 3936
  • Galley Views: 1072

Statistics from Dimensions

Copyright The Author(s) 2023. This article is published with open access by Vietnam National University, Ho Chi Minh city, Vietnam. This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0) which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited. 

Abstract

Because the data being mined in the temporal database will evolve with time, many researchers have focused on the incremental mining of frequent sequences in temporal database [3,8,9]. In this paper, we study the problem of discovering association rules that display regular cyclic variation over time. For example, bread and coffee are frequently sold together in morning hours, or moon cake, lantern and candle are often sold before Mid-autumn Festival. This paper extends the Apriori algorithm and develop the optimization technique for discovering cyclic association rules.

Comments