Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Deterministic CUR for improved large-scale data analysis: An empirical study

: Thurau, Christian; Kersting, Kristian; Bauckhage, Christian

Preprint urn:nbn:de:0011-n-2249688 (890 KByte PDF)
MD5 Fingerprint: e92f03a3f8f8e633f589b0bfd04e0e8f
Created on: 16.1.2013

Society for Industrial and Applied Mathematics -SIAM-, Philadelphia/Pa.:
12th SIAM International Conference on Data Mining. Proceedings : Anaheim, California, April 26 - 28, 2012
Madison, Wisconsin: Omnipress, 2012
ISBN: 978-1-61197-232-0
International Conference on Data Mining <12, 2012, Anaheim/Calif.>
Conference Paper, Electronic Publication
Fraunhofer IAIS ()
data mining; large-scale data; CUR decomposition

Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an alternative to the SVD because they naturally lead to interpretable decompositions which was shown to be successful in application such as fraud detection, fMRI segmentation, and collaborative filtering. The CUR decomposition of large matrices, for example, samples rows and columns according to a probability distribution that depends on the Euclidean norm of rows or columns or on other measures of statistical leverage. At the same time, there are various deterministic approaches that do not resort to sampling and were found to often yield factorization of superior quality with respect to reconstruction accuracy. However , these are hardly applicable to large matrices as they typically suffer from high computational costs. Consequently, many practitioners in the field of data mining have abandon deterministic approaches in favor of randomized ones when dealing with today's large-scale data sets. In this paper, we empirically disprove this prejudice. We do so by introducing a novel, linear-time, deterministic CUR approach that adopts the recently introduced Simplex Volume Maximization approach for column selection. The latter has already been proven to be successful for NMF-like decompositions of matrices of billions of entries. Our exhaustive empirical study on more than $30$ synthetic and real-world data sets demonstrates that it is also beneficial for CUR-like decompositions. Compared to other determinis tic CUR-like methods, it provides comparable reconstruction quality but operates much faster so that it easily scales to matrices of billions of elements. Compared to sampling-based methods, it provides competitive reconstruction quality while staying in the same run-time complexity class.