Cyclic association rules

Top Cited Papers
Publisher Website
Google Scholar
Abstract
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may observe seasonal variation where certain rules are true at approximate,ly the same month each year. Similarly, association rules can also display regular hourly, daily, weekly, etc., variation that is cyclical in nature. We demonstrate that existing methods,cannot be naively extended,to solve this problem of cyclic association rules. We then present two new algorithms for discovering such rules. The first one, which we call the sequential algorithm, treats association rules and cycles more or less independently. By studying the interaction between association rules and time, we devise a new technique called cycle pruning, which reduces the amount of time needed to find cyclic association rules. The second algorithm, which we call the interleaved algorithm, uses cycle pruning and other optimization techniques for discovering cyclic asso ciation rules. We demonstrate,the effectiveness of the interleaved algorithm through a series of experiments. These experiments,show that the interleaved algorithm can yield significant performance benefits when compared,to the sequential algorithm. Performance improvements,range from 5% to several hundred percent.

This publication has 3 references indexed in Scilit: