Abstract
In the field of Knowledge Discovery, graphs of concepts are an expressive and versatile modeling technique that provides ways to reason about information implicit in the data. Typically, nodes of these graphs represent unstructured closed patterns, such as sets of items, and edges represent the relationships of specificity among them. In this paper we want to consider the case where data keeps an order, and nodes of the concept graph represent complex structured patterns. We contribute by first characterizing a lattice of closed partial orders that precisely summarizes the original ordered data; and second, we show that this lattice can be obtained via coproduct transformations on a simpler graph of so-called stable sequences. In the practice, this graph transformation implies that algorithms for mining plain sequences can efficiently transform the discovered patterns into a lattice of closed partial orders, and so, avoiding the complexity of the mining operation for the partial orders directly from the data.
This work is supported in part by MCYT TIC 2002-04019-C03-01 (MOISES).
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
Adamek, J., Herrlich, H., Strecker, G.: Abstract and Concrete Categories. John Wiley, New York (1990)
Agrawal, R., Srikant, S.: Mining Sequential Patterns. In: Proc. of the Int’l Conf. on Data Engineering, pp. 3–14 (1995)
Balcázar, J.L., Baixeries, J.: Discrete Deterministic Datamining as Knowledge Compilation. In: Workshop on Discrete Mathematics and Data Mining, in SIAM Int. Conf. (2003)
Casas-Garriga, G.: Towards a Formal Framework for Mining General Patterns from Structured Data. In: Proc. of the 2nd. Multi-relational Datamining, in KDD Int. Conf. (2003)
Davey, B.A., Priestly, H.A.: Introduction to Lattices and Order. Cambridge (2002)
Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1998)
Mannila, H., Meek, C.: Global Partial Orders from Sequential Data. In: Int. Conf. on Knowledge Discovery in Databases (2000)
Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1(3), 259–289 (1997)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Closed set based discovery of small covers for association rules. In: Proc. of the 15th. Conference on Advanced Databases, pp. 361–381 (1999)
Pfaltz, J.L., Taylor, C.M.: Scientific Knowledge Discovery through Iterative transformations of Concept Lattices. In: Workshop on Discrete Mathematics and Data Mining, in SIAM Int. Conf., pp. 65–74 (2002)
Yan, X., Han, J., Afshar, R.: CloSpan: Mining Closed Sequential Patterns in Large Datasets. In: Int. Conference SIAM Data Mining (2003)
Wang, J., Han, J.: BIDE: Efficient Mining of Frequent Closed Sequences. In: Int. Conf. on Data Engineering (2004)
Zaki, M.: Generating non-redundant Association Rules. In: Proc. of the Sixth Int. Conference on Knowledge Discovery and Data Mining, pp. 34–43 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Casas-Garriga, G., Balcázar, J.L. (2004). Coproduct Transformations on Lattices of Closed Partial Orders. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds) Graph Transformations. ICGT 2004. Lecture Notes in Computer Science, vol 3256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30203-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30203-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23207-0
Online ISBN: 978-3-540-30203-2
eBook Packages: Springer Book Archive