Advertisement

On the Computation of Maximal-Correlated Cuboids Cells

  • Ronnie Alves
  • Orlando Belo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4081)

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.

Keywords

Data Engineer Data Cube Cuboid Cell Minimum Support Threshold Density Degree 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barbara, D., Sullivan, M.: Quasi-cubes: Exploiting Approximations in Multidimensional Databases. In: Proc. Int. Conference on Management of Data (SIGMOD) (1997)Google Scholar
  2. 2.
    Bayardo, R.: Efficiently Mining Long Patterns from Databases. In: Proc. Int. Conference on Management of Data (SIGMOD) (1998)Google Scholar
  3. 3.
    Beyer, K., Ramakrishnan, R.: Bottom-up Computation of Sparse and Iceberg Cubes. In: Proc. Int. Conference on Management of Data (SIGMOD) (1999)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Gouda, K., Zaki, J.: GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. Data Mining and Knowledge Discovery 11, 1–20 (2005)CrossRefMathSciNetGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    Omiecinski: Alternative Interest Measures for Mining Associations. IEEE Trans. Knowledge and Data Engineering 15, 57–69 (2003)CrossRefGoogle Scholar
  13. 13.
    Rymon, R.: Search through Systematic Set Enumeration. In: Proc. Int. Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 539–550 (1992)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ronnie Alves
    • 1
  • Orlando Belo
    • 1
  1. 1.Department of Informatics, School of EngineeringUniversity of MinhoBragaPortugal

Personalised recommendations