Abstract
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approach the curse of dimensionality remains, given the large number of cuboids to compute, which produces, as we know, huge outputs. However, more recently, some efforts have been done on computing only closed cuboids. Nevertheless, for some of the dense databases, which are considered in this paper, even the set of all closed cuboids will be too large. An alternative would be to compute only the maximal cuboids. However, a pure maximal approaching implies loosing some information, this is one can generate the complete set of cuboids cells from its maximal but without their respective aggregation value. To play with some “loss of information” we need to add an interesting measure, that we call the correlated value of a cuboid cell. In this paper, we propose a new notion for reducing cuboids aggregation by means of computing only the maximal-correlated cuboids cells, and present the M3C-Cubing algorithm that brings out those cuboids. Our evaluation study shows that the method followed is a promising candidate for scalable data cubing, reducing the number of cuboids by at least an order of magnitude or more in comparison with that of closed ones.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Barbara, D., Sullivan, M.: Quasi-cubes: Exploiting Approximations in Multidimensional Databases. In: Proc. Int. Conference on Management of Data (SIGMOD) (1997)
Bayardo, R.: Efficiently Mining Long Patterns from Databases. In: Proc. Int. Conference on Management of Data (SIGMOD) (1998)
Beyer, K., Ramakrishnan, R.: Bottom-up Computation of Sparse and Iceberg Cubes. In: Proc. Int. Conference on Management of Data (SIGMOD) (1999)
Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In: Proc. Int. Conference on Data Engineering (ICDE), pp. 443–452 (2001)
Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman, J.D.: Computing Iceberg Queries Efficiently. In: Proc. Int. Conference on Very Large Databases (VLDB) (1998)
Feng, Y., Agrawal, D., Abbadi, A.-E., Metwally, A.: Range Cube: Efficient Cube Computation by Exploiting Data Correlation. In: Proc. Int. Conference on Data Engineering (ICDE) (2004)
Gouda, K., Zaki, J.: GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Data Mining and Knowledge Discovery 11, 1–20 (2005)
Gray, J., Bosworth, A., Layman, A., Pirahesh, A.: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. In: Proc. Int. Conference on Data Engineering (ICDE) (1996)
Han, J., Pei, J., Dong, G., Wank, K.: Efficient Computation of Iceberg Cubes with Complex Measures. In: Proc. Int. Conference on Management of Data (SIGMOD) (2001)
Kim, W.-Y., Lee, Y.-K., Han, J.: CCMine: Efficient Mining of Confidence-Closed Correlated Patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 569–579. Springer, Heidelberg (2004)
Lakshmanan, V.S., Pei, J., Han, J.: Quotient Cube: How to Summarize the Semantics of a Data Cube. In: Proc. Int. Conference on Very Large Databases (VLDB) (2002)
Omiecinski: Alternative Interest Measures for Mining Associations. IEEE Trans. Knowledge and Data Engineering 15, 57–69 (2003)
Rymon, R.: Search through Systematic Set Enumeration. In: Proc. Int. Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 539–550 (1992)
Shao, Z., Han, J., Xin, D.: MM-Cubing: Computing Iceberg Cubes by Factorizing the Lattice Space. In: Proc. Int. Conference on Scientific and Statistical Database Management (SSDBM) (2004)
Xin, D., Han, J., Shao, Z., Liu, H.: C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking. In: Proc. Int. Conference on Data Engineering (ICDE) (2006)
Xiong, H., Tan, P.-N., Kumar, V.: Mining Strong Affinity Associations Patterns in Data Sets with Skewed Support Distribution. In: Proc. Int. Conference on Data Mining (ICDM) (2003)
Zou, Q., Chu, W.-W., Lu, B.: SmartMiner: A Depth First Algorithm Guided by Tail Information for Mining Maximal Frequent Itemsets. In: Proc. Int. Conference on Data Mining (ICDM) (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alves, R., Belo, O. (2006). On the Computation of Maximal-Correlated Cuboids Cells. In: Tjoa, A.M., Trujillo, J. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2006. Lecture Notes in Computer Science, vol 4081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11823728_16
Download citation
DOI: https://doi.org/10.1007/11823728_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37736-8
Online ISBN: 978-3-540-37737-5
eBook Packages: Computer ScienceComputer Science (R0)