.png){kind=icon}
Return
Mining multiple-level fuzzy blocks from multidimensional data
.png){kind=icon}
OA
AI
DOI：10.1016/j.fss.2008.01.011.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multidimensional databases are now recognized as being the standard way to store aggregated and historized data. Multidimensional databases are designed to store information on measures (also known as indicators) regarding a set of dimensions. One important issue in this framework is the identification of homogeneous areas in data cubes, which allows users to summarize and visualize the data through the main trends they contain. In our previous work, we have proposed a levelwise approach to mine homogeneous areas of the data, called blocks that can be interpreted, for instance, as If product is Chocolate and month is between January and March and city is London or Pat-is, then the number of sales is 5. However, in this work, the information provided by the hierarchies defined over the dimensions is not taken into account. In this paper, we consider the case where measure values are discretized using a fuzzy partition, and we extend our method so as to mine multiple-level fuzzy blocks, that is, blocks that are defined using hierarchies and that characterize fuzzy measure values. Moreover, in order to avoid redundancies in the output set of blocks, only the most specific ones (according to hierarchies) are computed. We show that our algorithms are linear in the size of the cube, thus providing an efficient method for summarizing data cubes. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
multidimensional databases
hierarchies
levelwise algorithms
fuzzy data mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
7.6K
Citations:
1.5W
.png){kind=icon}
