Issue No. 04 - April (2009 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.186
Ruibin Xi , Washington University in St. Louis, St. Louis
Yixin Chen , Washington University in St Louis, St Louis
Nan Lin , Washington University in St. Louis, St. Louis
Logistic regression is an important technique for analyzing and predicting data with categorical attributes. In this paper, We consider supporting online analytical processing (OLAP) of logistic regression analysis for multi-dimensional data in a data cube where it is expensive in time and space to build logistic regression models for each cell from the raw data. We propose a novel scheme to compress the data in such a way that we can reconstruct logistic regression models to answer any OLAP query without accessing the raw data. Based on a first-order approximation to the maximum likelihood estimating equations, we develop a compression scheme that compresses each base cell into a small compressed data block with essential information to support the aggregation of logistic regression models. Aggregation formulae for deriving high-level logistic regression models from lower level component cells are given. We prove that the compression is nearly lossless in the sense that the aggregated estimator deviates from the true model by an error that is bounded and approaches to zero when the data size increases. The results show that the proposed compression and aggregation scheme can make feasible OLAP of logistic regression in a data cube.
Data mining, Statistical databases
Ruibin Xi, Yixin Chen, Nan Lin, "Compression and Aggregation for Logistic Regression Analysis in Data Cubes", IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 479-492, April 2009, doi:10.1109/TKDE.2008.186