Skip to Main content Skip to Navigation
Book sections

Summarizing Data Cubes Using Blocks

Abstract : In the context of multidimensional data, OLAP tools are appropri- ate for the navigation in the data, aiming at discovering pertinent and abstract knowledge. However, due to the size of the data set, a system- atic and exhaustive exploration is not feasible. Therefore, the problem is to design automatic tools to ease the navigation in the data and their visualization. In this paper, we present a novel approach allow- ing to build automatically blocks of similar values in a given data cube that are meant to summarize the content of the cube. Our method is based on a levelwise algorithm (a la Apriori) whose complexity is shown to be polynomial in the number of scans of the data cube. The experiments reported in the paper show that our approach is scalable, in particular in the case where the measure values present in the data cube are discretized using crisp or fuzzy partitions.
Document type :
Book sections
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Anne Laurent Connect in order to contact the contributor
Submitted on : Tuesday, February 13, 2007 - 3:20:44 PM
Last modification on : Friday, August 5, 2022 - 2:46:00 PM
Long-term archiving on: : Saturday, May 14, 2011 - 2:13:09 AM


  • HAL Id : lirmm-00130718, version 1


Yeow Wei Choong, Anne Laurent, Dominique Laurent. Summarizing Data Cubes Using Blocks. F. Masseglia, P. Poncelet, M. Teisseire. Data Mining Patterns: New Methods and Applications, IDEA Group Inc., pp.36, 2007. ⟨lirmm-00130718⟩



Record views


Files downloads