This paper presents a novel pattern called temporal indirect association. An indirect association pattern refers to a pair of items that rarely occur together but highly depend on the presence of a mediator itemset. The existing model of indirect association does not consider the lifespan of items. Consequently, some discovered patterns may be invalid while some useful patterns may not be covered. To overcome this drawback, in this paper, we take into account the lifespan of items to extend the current model to be temporal. An algorithm, MG-Grvwth, that finds the set of mediators in pattern-growth manner is developed. Then, we extend the framework of the algorithm to discover temporal indirect associations. Our experimental results demonstrated the efficiency and effectiveness of the proposed algorithms. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Chen, L., Bhowmick, S. S., & Li, J. (2006). Mining temporal indirect associations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3918 LNAI, pp. 425–434). Springer Verlag. https://doi.org/10.1007/11731139_49
Mendeley helps you to discover research relevant for your work.