Abstract
A time-profiled association is an association pattern consistent with a query sequence over time, e.g., identifying the interacting relationship of droughts and wild fires in Australia with the El Nino phenomenon in the past 50 years. Traditional association rule mining approaches reveal the generic dependency among variables in association patterns but do not capture the evolution of these patterns over time. Incorporating the temporal evolution of association patterns and identifying the co-occurring patterns consistent over time can be done by time-profiled association mining. Mining time-profiled associations is computationally challenging due to the large size of the itemset space and the long time points in practice. In this paper, we propose a novel one-step algorithm to unify the generation of statistical parameter sequences and sequence retrieval. The proposed algorithm substantially reduces the itemset search space by pruning candidate itemsets based on the monotone property of the lower bounding measure of the sequence of statistical parameters. Experimental results show that our algorithm outperforms a naive approach.
This work was partially supported by NSF grant 0431141 and Army High Performance Computing Research Center contract number DAAD19-01-2-0014. The content of this work does not necessarily reflect the position or policy of the government and no official endorsement should be inferred. AHPCRC and Minnesota Supercomputer Institute provided access to computing facilities. Readers may refer to the technical report [9] for more details.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
NOAA El Nino Page, http://www.elnino.noaa.gov/
Agarwal, R., Srikant, R.: Fast algorithms for Mining association rules. In: Proc. of the 20th VLDB Conference (1994)
Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Databases. In: Proc. Int. Conference on Foundations of Data Organization (1993)
Agrawal, R., Psaila, G.: Active Data Mining. In: Proc. The First International Conference on Knowledge Discovery and Data Mining (1995)
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series database. In: Proc. ACM SIGMOD Conference (1993)
Gunopulos, D., Das, G.: Time Series Similarity Measures and Time Series Indexing. SIGMOD Record 30(2) (2001)
Li, Y., Ning, P., Wang, X., Jajodia, S.: Discovering Calendar-Based Temporal Assocation Rules. In: Proc. Symp. Temporal Representation and Reasoning (2001)
Ozden, B., Ramaswamy, S., Silberschatz, A.: Cyclic Association Rules. In: Proc. of IEEE Int. Conference on Data Engineering (1998)
Yoo, J.S., Zhang, P., Shekhar, S.: Mining Time-Profiled Associations: A Preliminary Study. University of Minnesota (2005)
Zhang, P., Steinbach, M., Kumar, V., Shekhar, S., Tan, P., Klooster, S., Potter, C.: Discovery of Patterns of Earth Science Data Using Data Mining. In: Kantardzic, M., Zurada, J. (eds.) Next Generation of Data Mining Applications. IEEE Press, Los Alamitos (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoo, J.S., Zhang, P., Shekhar, S. (2005). Mining Time-Profiled Associations: An Extended Abstract. In: Ho, T.B., Cheung, D., Liu, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science(), vol 3518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430919_17
Download citation
DOI: https://doi.org/10.1007/11430919_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26076-9
Online ISBN: 978-3-540-31935-1
eBook Packages: Computer ScienceComputer Science (R0)