Discovering calendar-based temporal association rules

  • Authors:
  • Yingjiu Li;Peng Ning;X. Sean Wang;Sushil Jajodia

  • Affiliations:
  • Center for Secure Information Systems, George Mason University, Fairfax, VA;Department of Computer Science, North Carolina State University, Raleigh, NC;Center for Secure Information Systems, George Mason University, Fairfax, VA;Center for Secure Information Systems, George Mason University, Fairfax, VA

  • Venue:
  • Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

We study the problem of mining association rules and related time intervals, where an association rule holds either in all or some of the intervals. To restrict to meaningful time intervals, we use calendar schemas and their calendar-based patterns. A calendar schema example is (year, month, day) and a calendar-based pattern within the schema is (*, 3, 15), which represents the set of time intervals each corresponding to the 15th day of a March. Our focus is finding efficient algorithms for this mining problem by extending the well-known Apriori algorithm with effective pruning techniques. We evaluate our techniques via experiments.