Abstract
In this article we define a formalism for a methodology that has as purpose the discovery of knowledge, represented in the form of general Horn clauses, inferred from databases with a temporal dimension. To obtain what we called temporal rules, a discretisation phase that extracts events from raw data is applied first, followed by an induction phase, which constructs classification trees from these events. The theoretical framework we proposed, based on first-order temporal logic, permits us to define the main notions (event, temporal rule, constraint) in a formal way. The concept of consistent linear time structure allows us to introduce the notions of general interpretation and of confidence. These notions open the possibility to use statistical approaches in the design of algorithms for inferring higher order temporal rules, denoted temporal meta-rules.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Cotofrei, P., Stoffel, K. First-Order Logic Based Formalism for Temporal Data Mining*. In: Young Lin, T., Ohsuga, S., Liau, CJ., Hu, X., Tsumoto, S. (eds) Foundations of Data Mining and knowledge Discovery. Studies in Computational Intelligence, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11498186_12
Download citation
DOI: https://doi.org/10.1007/11498186_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26257-2
Online ISBN: 978-3-540-32408-9
eBook Packages: EngineeringEngineering (R0)