Abstract
The goal of this chapter is to use FCA theory to formalize a new closure system that characterizes sequential data. Since we are not dealing with the classical unordered context of the preliminaries, setting all the conditions for the new Galois connection is not a trivial task. To start with, it departs from the unordered case in the very definition of intersection; whereas we saw in the last chapter that the intersection of two itemsets is another itemset, the intersection of two or more sequences is not necessarily a single sequence. Let us consider the following definition.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springe -Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Garriga, G.C. (2013). Lattice Theory for Sequences. In: Formal Methods for Mining Structured Objects. Studies in Computational Intelligence, vol 475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36681-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-36681-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36680-2
Online ISBN: 978-3-642-36681-9
eBook Packages: EngineeringEngineering (R0)