Reduced representations of Emerging Cubes for OLAP database mining

In this paper, we investigate reduced representations for the Emerging Cube. We use the borders, classical in data mining, for the Emerging Cube. These borders can support classification tasks to know whether a trend is emerging or not. However, the borders do not make possible to retrieve the measure values. This is why we introduce two new and reduced representations without measure loss: the L-Emerging Closed Cube and Emerging Quotient Cube. We state the relationship between the introduced representations. Experiments performed on various data sets are intended to measure the size of the three reduced representations.

[1]  Lotfi Lakhal,et al.  Upper Borders for Emerging Cubes , 2008, DaWaK.

[2]  Lotfi Lakhal,et al.  Emerging Cubes for Trends Analysis in OlapDatabases , 2007, DaWaK.

[3]  Jinyan Li,et al.  Mining border descriptions of emerging patterns from dataset pairs , 2005, Knowledge and Information Systems.

[4]  Alberto O. Mendelzon,et al.  OLAP dimension constraints , 2002, PODS '02.

[5]  Mohammed J. Zaki,et al.  Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.

[6]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[7]  Jiawei Han,et al.  Computing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach , 2007 .

[8]  Laks V. S. Lakshmanan,et al.  Quotient Cube: How to Summarize the Semantics of a Data Cube , 2002, VLDB.

[9]  Raghu Ramakrishnan,et al.  Bottom-up computation of sparse and Iceberg CUBE , 1999, SIGMOD '99.

[10]  Francesco Bonchi,et al.  On closed constrained frequent pattern mining , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[11]  Hongyan Liu,et al.  C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[12]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[13]  Hamid Pirahesh,et al.  Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.

[14]  Jian Pei,et al.  CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[15]  Luc De Raedt,et al.  The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding , 2001, IJCAI.

[16]  Gerd Stumme,et al.  Computing iceberg concept lattices with T , 2002, Data Knowl. Eng..

[17]  Lotfi Lakhal,et al.  Cube Lattices: A Framework for Multidimensional Data Mining , 2003, SDM.

[18]  Xiuzhen Zhang,et al.  Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions , 2007, IEEE Transactions on Knowledge and Data Engineering.

[19]  Laks V. S. Lakshmanan,et al.  Pushing Convertible Constraints in Frequent Itemset Mining , 2004, Data Mining and Knowledge Discovery.

[20]  Konstantinos Morfonios,et al.  Supporting the data cube lifecycle: the power of ROLAP , 2008, The VLDB Journal.

[21]  Lotfi Lakhal,et al.  Extracting semantics from data cubes using cube transversals and closures , 2003, KDD '03.

[22]  Konstantinos Morfonios,et al.  CURE for cubes: cubing using a ROLAP engine , 2006, VLDB.

[23]  Mohammed J. Zaki,et al.  CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.