Abstract
In real world the knowledge used for aiding decision-making is always time varying. Most existing data mining approaches assume that discovered knowledge is valid indefinitely. Temporal features of the knowledge are not taken into account in mining models or processes. As a consequence, people who expect to use the discovered knowledge may not know when it became valid or whether it is still valid. This limits the usability of discovered knowledge. In this paper, temporal features are considered as important components of association rules for better decision-making. The concept of temporal association rules is formally defined and the problems of mining these rules are addressed. These include identification of valid time periods and identification of periodicities of an association rule, and mining of association rules with a specific temporal feature. A system has been designed and implemented for supporting the iterative process of mining temporal association rules, along with an interactive query and mining interface with an SQL-like mining language.
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
R. Agrawal, T. Imielinski, and A. Swami. Mining Associations between Sets of Items in Massive Databases, In Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 207–216, Washington D.C., USA 1993.
C. Bettini, C. E. Dyreson, W. S. Evans, R. T. Snodgrass, and X. S. Wang. A Glossary of Time Granularity Concepts, In Temporal Databases: Research and Practice, Springer-Verlag. 1998
X. Chen, I. Petrounias, and H. Heathfield. Discovering Temporal Association Rules in Temporal Databases, In Proceedings of International Workshop on Issues and Applications of Database Technology, pp. 312–319, Berlin, Germany 1998.
X. Chen and I. Petrounias, Mining Temporal Features in Association Rules, In Proceedings of of the 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 295–300, Prague, Czech Republic (1999).
T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Mining Optimized Association Rules for Numeric Attributes, In Proceedings of the 15th ACM SIGACT-AIGMOD-SIGART symposium on Principles of Database Systems, pp. 182–191, Montreal, Canada (1996).
R. Meo, G. Psaila, and S. Ceri. A New SQL Like Operator for Mining Association Rule, In Proceedings of the 22nd International Conference on Very Large Databases, pp. 122–133, Bombay, India (1996).
B. Ozden, S. Ramaswamy, and A. Silberschatz. Cyclic Association Rules, In Proc. of the 14th International Conference on Data Engineering, pp. 412–421, Orlando, Florida, USA (1998).
Ramaswamy, S., Mahajan, S., and Silberschatz, A., On the Discovery of Interesting Patterns in Association Rules, Proceedings of 24th VLDB Conference, New York, pp. 368–379, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X., Petrounias, I. (2000). An Integrated Query and Mining System for Temporal Association Rules. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2000. Lecture Notes in Computer Science, vol 1874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44466-1_33
Download citation
DOI: https://doi.org/10.1007/3-540-44466-1_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67980-6
Online ISBN: 978-3-540-44466-4
eBook Packages: Springer Book Archive