S. Ramaswamy, S. Mahajan, and A. Silberschatz. Calendric association rules. Technical report, Bell Labs, 1997. Submitted for publication. Available upon request.  Home/Search   Document Not in Database   Summary   Related Articles

....the usefulness of these techniques through an extensive experimental study. The study showed that performance benefits ranging from 5 to several hundred percent can be obtained through the use of the optimizations when compared to the more straightforward approach. Recently, we have explored, in [RMS97], the integration of calendars into an association rule mining framework. This lets us consider rules like, X Y , the first working day of every month. In [RMS97] we also address the problem of approximate matching, which relaxes the rather rigid definition of when a cycle belongs to an ....

....be obtained through the use of the optimizations when compared to the more straightforward approach. Recently, we have explored, in [RMS97] the integration of calendars into an association rule mining framework. This lets us consider rules like, X Y , the first working day of every month. In [RMS97], we also address the problem of approximate matching, which relaxes the rather rigid definition of when a cycle belongs to an association rule. Interesting open problems include the handling of multiple time units (like hours, weeks, days, etc. simultaneously and efficiently, integrating cycles ....

S. Ramaswamy, S. Mahajan, and A. Silberschatz. Calendric association rules. Technical report, Bell Labs, 1997. Submitted for publication. Available upon request.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC