Summarizing Data Cubes Using Blocks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Book Sections Year : 2007

Summarizing Data Cubes Using Blocks

Yeow Wei Choong
  • Function : Author
  • PersonId : 838141
Anne Laurent


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.
Fichier principal
Vignette du fichier
choong_dmbook.pdf (309 Ko) Télécharger le fichier

Dates and versions

lirmm-00130718 , version 1 (13-02-2007)


  • 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⟩
106 View
347 Download


Gmail Facebook X LinkedIn More