Block CUR: Decomposing Matrices Using Groups of Columns
Abstract
A common problem in large-scale data analysis is to approximate a matrix using a combination of specifically sampled rows and columns, known as CUR decomposition. In many real-world environments, the ability to sample specific individual rows or columns of the matrix is limited by either system constraints or cost. In this paper, we consider matrix approximation by sampling predefined blocks of columns (or rows) from the matrix. We present an algorithm for sampling useful column blocks and provide novel guarantees for the quality of the approximation. We demonstrate the effectiveness of the proposed algorithms for computing the Block CUR decomposition of large matrices in a distributed setting with multiple nodes in a compute cluster and in a biometric data analysis setting using real-world user data from content testing.
Cite
Text
Oswal et al. "Block CUR: Decomposing Matrices Using Groups of Columns." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2018. doi:10.1007/978-3-030-10928-8_22Markdown
[Oswal et al. "Block CUR: Decomposing Matrices Using Groups of Columns." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2018.](https://mlanthology.org/ecmlpkdd/2018/oswal2018ecmlpkdd-block/) doi:10.1007/978-3-030-10928-8_22BibTeX
@inproceedings{oswal2018ecmlpkdd-block,
title = {{Block CUR: Decomposing Matrices Using Groups of Columns}},
author = {Oswal, Urvashi and Jain, Swayambhoo and Xu, Kevin S. and Eriksson, Brian},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2018},
pages = {360-376},
doi = {10.1007/978-3-030-10928-8_22},
url = {https://mlanthology.org/ecmlpkdd/2018/oswal2018ecmlpkdd-block/}
}