Abstract
This paper proposes an algorithm for discovering temporal patterns, represented in the Simple Temporal Problem (STP) formalism, that frequently occur in a set of temporal sequences. To focus the search, some initial knowledge can be provided as a seed pattern by a domain expert: the mining process will find those frequent temporal patterns consistent with the seed. The algorithm has been tested on a database of temporal events obtained from polysomnography tests in patients with Sleep Apnea-Hypopnea Syndrome (SAHS).
This is a preview of subscription content, log in via an institution to check access.
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
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. 11th Int. Conf. on Data Engineering, pp. 3–14. IEEE Computer Society Press, Los Alamitos (1995)
Álvarez, M.R., Félix, P., Cariñena, P., Otero, A.: A data mining algorithm for inducing temporal constraint networks. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds.) IPMU 2010. LNCS (LNAI), vol. 6178, pp. 300–309. Springer, Heidelberg (2010)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Dousson, C., Duong, T.: Discovering chronicles with numerical time constraints from alarm logs for monitoring dynamic systems. In: Proc. 16th IJCAI, pp. 620–626 (1999)
Garofalakis, M., Rastogi, R., Shim, K.: Spirit: Sequential pattern mining with regular expression constraints. In: Proc. 25th VLDB Conference, pp. 223–234 (1999)
Mannila, H., Toivonen, H., Verkamo, A.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1(3), 259–289 (1997)
Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans. on Knowledge and Data Engineering 16(11), 1424–1440 (2004)
Yager, R., Filev, D.: Approximate clustering via the mountain method. IEEE Trans. on Systems, Man and Cybernetics 24(4), 1279–1284 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Álvarez, M.R., Félix, P., Cariñena, P. (2011). Mining Temporal Constraint Networks by Seed Knowledge Extension. In: Peleg, M., Lavrač, N., Combi, C. (eds) Artificial Intelligence in Medicine. AIME 2011. Lecture Notes in Computer Science(), vol 6747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22218-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-22218-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22217-7
Online ISBN: 978-3-642-22218-4
eBook Packages: Computer ScienceComputer Science (R0)