A probabilistic model for data cube compression and query approximation

DOLAP: Proceedings of the ACM International Workshop on Data Warehousing and OLAP

Volumn , Issue , 2007, Pages 33-40

  Missaoui, Rokia ^a   Goutte, Cyril ^b   Choupo, Anicet Kouomou ^a   Boujenoui, Ameur ^c  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b NATIONAL RESEARCH COUNCIL CANADA   (Canada)

^c UNIVERSITY OF OTTAWA   (Canada)

Author keywords

approximation; compression; data cubes; data mining; data warehousing; log linear modeling; non negative multi way array factorization; OLAP

Indexed keywords

DATA COMPRESSION; DATA MINING; DECISION MAKING; FACTORIZATION; GEOMETRY; REGRESSION ANALYSIS;

APPROXIMATION; COMPRESSION; DATA CUBE; DATA SET; LOGLINEAR MODEL; MODELLING TECHNIQUES; NON NEGATIVES; NON-NEGATIVE MULTI-WAY ARRAY FACTORIZATION; OLAP; PROBABILISTIC MODELS;

DATA WAREHOUSES;

EID: 67650401472     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1317331.1317338     Document Type: Conference Paper

References (29)

1. H. Akaike. A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19(6):716-723, 1974.
2. J. L. Ambite, C. Shahabi, R. R. Schmidt, and A. Philpot. Fast approximate evaluation of OLAP queries for integrated statistical data. In Proceedings of the First National Conference on Digital Government Research, 2001.
3. B. Babcock, S. Chaudhuri, and G. Das. Dynamic sample selection for approximate query processing. In SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 539-550, New York, NY, USA, 2003. ACM Press.
4. D. Barbara and X. Wu. Using loglinear models to compress datacubes. In WAIM '00: Proceedings of the First International Conference on Web-Age Information Management, pages 311-322, London, UK, 2000. Springer-Verlag.
5. D. Barbara and X. Wu. Loglinear-based quasi cubes. J. Intell. Inf. Syst., 16(3):255-276, 2001. (Pubitemid 32886815)
6. A. Boujenoui and D. Zéghal. Effet de la structure des droits de vote sur la qualité des mécanismes internes de gouvernance: cas des entreprises canadiennes. Canadian Journal of Administrative Sciences, 23(3):183-201, 2006.
7. K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. The VLDB Journal, 10(2-3):199-223, 2001. (Pubitemid 33404198)
8. S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology. SIGMOD Rec., 26(1):65-74, 1997. (Pubitemid 127458202)
9. R. Christensen. Log-linear Models. Springer-Verlag, New York, 1997.
10. W. Deming and F. Stephan. On a least squares adjustment of a sampled frequency table when the expected marginal totals are known. The Annals of Mathematical Statistics, 11(4):427-444, 1940.
11. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1-38, 1977.
12. I. S. Dhillon and S. Sra. Generalized nonnegative matrix approximations with Bregman divergences. In Advances in Neural Information Processing Systems 17, pages 283-290, 2005.
13. V. Ganti, M.-L. Lee, and R. Ramakrishnan. Icicles: Self-tuning samples for approximate query answering. In VLDB '00: Proceedings of the 26th International Conference on Very Large Data Bases, pages 176-187, San Francisco, CA, USA, 2000. Morgan Kaufmann Publishers Inc.
14. E. Gaussier and C. Goutte. Relation between PLSA and NMF and implications. In SIGIR '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, pages 601-602, New York, NY, USA, 2005. ACM Press.
15. C. Goutte, R. Missaoui, and A. Boujenoui. Data cube approximation and mining using probabilistic modelling. Technical Report NRC 49284, National Research Council, 2007. http://iit-iti.nrc-cnrc.gc.ca/publications/nrc-49284-e. html.
16. S. Haberman. Analysis of qualitative data, Volume 1. Academic Press, New York, 1978.
17. T. Hofmann. Probabilistic latent semantic analysis. In UAI'99, pages 289-296. Morgan Kaufmann, 1999.
18. T. Imielinski, L. Khachiyan, and A. Abdulghani. Cubegrades: Generalizing association rules. Data Min. Knowl. Discov., 6(3):219-257, 2002. (Pubitemid 37113865)
19. L. V. S. Lakshmanan, J. Pei, and Y. Zhao. Quotient cube: How to summarize the semantics of a data cube. In Proceedings of the 28th International Conference on Very Large Databases, VLDB, pages 778-789, 2002.
20. D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788-791, 1999.
21. H. Lu, L. Feng, and J. Han. Beyond intratransaction association analysis: mining multidimensional intertransaction association rules. ACM Trans. Inf. Syst., 18(4):423-454, 2000.
22. S. Naouali and R. Missaoui. Flexible query answering in data cubes. In DaWaK, pages 221-232, 2005.
23. T. Palpanas, N. Koudas, and A. Mendelzon. Using datacube aggregates for approximate querying and deviation detection. IEEE Transactions on Knowledge and Data Engineering, 17(11):1465-1477, 2005. (Pubitemid 41704835)
24. S. Sarawagi, R. Agrawal, and N. Megiddo. Discovery-driven exploration of OLAP data cubes. In EDBT '98: Proceedings of the 6th International Conference on Extending Database Technology, pages 168-182, London, UK, 1998. Springer-Verlag.
25. G. Schwartz. Estimating the dimension of a model. The Annals of Statistics, 6(2):461-464, 1978.
26. J. Shanmugasundaram, U. Fayyad, and P. S. Bradley. Compressed data cubes for OLAP aggregate query approximation on continuous dimensions. In KDD '99: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 223-232. ACM Press, 1999.
27. J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In Proceeding of the SIGMOD'99 Conference, pages 193-204, 1999.
28. M. Welling and M. Weber. Positive tensor factorization. Pattern Recognition Letters, 22(12):1255-1261, 2001. (Pubitemid 32784358)
29. F. Yu and W. Shan. Compressed data cube for approximate OLAP query processing. J. Comput. Sci. Technol., 17(5):625-635, 2002.