Abstract
In this paper we use the novel concept of minimal cube transversals on the cube lattice of a categorical database relation for mining the borders of the difference of two datacubes. The problem of finding cube transversals is a sub-problem of hypergraph transversal discovery since there exists an order-embedding from the cube lattice to the power set lattice of binary attributes. Based on this result, we propose a levelwise algorithm and an optimization which uses the frequency of the disjunction for mining minimal cube transversals. Using cube transversals, we introduce a new OLAP functionality: discovering the difference of two uni-compatible datacubes or the most frequent elements in the difference. Finally we propose a merging algorithm for mining the boundary sets of the difference without computing the two related datacubes. Provided with such a difference of two datacubes capturing similar informations but computed at different dates, a user can focus on what is new or more generally on how evolve the previously observed trends.
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
Bayardo Jr., R.J.: Efficiently Mining Long Patterns from Databases. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 85–93 (1998)
Beyer, K., Ramakrishnan, R.: Bottom-Up Computation of Sparse and Iceberg CUBEs. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 359–370 (1999)
Calders, T., Ng, R., Wijsen, J.: Searching for Dependencies at Multiple Abstraction Levels. ACM Transactions on Database Systems, ACM TODS 27(3), 229–260 (2002)
Casali, A., Cicchetti, R., Lakhal, L.: Cube Lattices: a Framework for Multidimensional Data Mining. In: Proceedings of the 3rd SIAM International Conference on Data Mining, SDM, pp. 304–308 (2003)
Casali, A., Cicchetti, R., Lakhal, L.: Extracting semantics from data cubes using cube transversals and closures. In: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining, KDD, pp. 69–78 (2003)
Casali, A., Cicchetti, R., Lakhal, L.: Mining Concise Représentations of Frequent Multidimensional Patterns. In: Proceedings of the 11th International Conference on Conceptual Structures, ICCS (2003)
Dong, G., Li, J.: Efficient Mining of Emerging Patterns: Discovering Trends and Differences. In: Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining, KDD, pp. 43–52 (1999)
Eiter, T., Gottlob, G.: Identifying The Minimal Transversals of a Hypergraph and Related Problems. SIAM Journal on Computing 24(6), 1278–1304 (1995)
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining and Knowledge Discovery 1(1), 29–53 (1997)
Gunopulos, D., Mannila, H., Khardon, R., Toivonen, H.: Data mining, hypergraph transversals, and machine learning. In: Proceedings of the 16th Symposium on Principles of Database Systems, PODS, pp. 209–216 (1997)
Han, J., Pei, J., Dong, G., Wang, K.: Efficient Computation of Iceberg Cubes with Complex Measures. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 441–448 (2001)
Lakshmanan, L., Pei, J., Han, J.: Quotient Cube: How to Summarize the Semantics of a Data Cube. In: Proceedings of the 28th International Conference on Very Large Databases, VLDB (2002)
Lopes, S., Petit, J., Lakhal, L.: Efficient Discovery of Functional Dependencies and Armstrong Relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 350–364. Springer, Heidelberg (2000)
Mannila, H., Toivonen, H.: Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery 1(3), 241–258 (1997)
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
Casali, A. (2004). Mining Borders of the Difference of Two Datacubes. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2004. Lecture Notes in Computer Science, vol 3181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30076-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-30076-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22937-7
Online ISBN: 978-3-540-30076-2
eBook Packages: Springer Book Archive