Efficient Calendar Based Temporal Association Rule Keshri Verma and O. P. Vyas   View Paper (PDF)   Return to September 2005, Volume 34, Number 3 Abstract advantage of precisely predictable spaces overhead. It can be scaled up to large database by database partitioning, end when dataset becomes dense, conditionally temporal FP-tree. can be constructed dynamically as part of mining. ©2006 Association for Computing Machinery