Data cube approximation and mining using probabilistic modelling

AuthorSearch for: ; Search for: ; Search for:
TypeTechnical Report
Subjectdata cubes; OLAP; data warehouses; multidimensional data; non-negative multiway factorization; log-linear modeling
AbstractOn-line Analytical Processing (OLAP) techniques commonly used in data warehouses allow the exploration of data cubes according to different analysis axes (dimensions) and different abstraction levels in a dimension hierarchy. However, such techniques are not appropriate for an automatic and efficient mining of multidimensional data. This is mainly due to multidimensionality and the generally large size of data. Since data cubes are nothing but multi-way tables, we propose to analyze the potential of two probabilistic modelling techniques, namely non-negative multi-way factorization and log-linear modelling, for the ultimate objective of compressing and mining aggregate and multidimensional values. For the former, we compute the set of components that best fit the initial data set and whose superposition coincides with the original data, while for the latter we identify a parsimonious model (i.e., one with a reduced set of parameters), highlight strong associations among dimensions and discover possible outliers in data cells. A real life example will be used to (i) discuss the potential benefits of the modelling output on cube exploration and mining, (ii) show how OLAP queries can be answered in an approximate way, and (iii) illustrate the strengths and limitations of these modelling approaches.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number49284
NPARC number8914032
Export citationExport as RIS
Report a correctionReport a correction
Record identifier69b5c3ee-3ae1-4c3b-9ee3-985a57a34de1
Record created2009-04-22
Record modified2016-10-03
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)