A Scalable Approach to Column-Based Low-Rank Matrix Approximation
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1600-1605.
Abstract
In this paper, we address the column-based low-rank matrix approximation problem using a novel parallel approach. Our approach is based on the divide-and-combine idea. We first perform column selection on submatrices of an original data matrix in parallel, and then combine the selected columns into the final output. Our approach enjoys a theoretical relative-error upper bound. In addition, our column-based low-rank approximation partitions data in a deterministic way and makes no assumptions about matrix coherence. Compared with other traditional methods, our approach is scalable on large-scale matrices. Finally, experiments on both simulated and real world data show that our approach is both efficient and effective.
@inproceedings{ijcai2013p238,
title = {A Scalable Approach to Column-Based Low-Rank Matrix Approximation},
author = {Pi, Yifan and Peng, Haoruo and Zhou, Shuchang and Zhang, Zhihua},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {1600--1605},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/238},
}
TY - CPAPER TI - A Scalable Approach to Column-Based Low-Rank Matrix Approximation AU - Pi, Yifan AU - Peng, Haoruo AU - Zhou, Shuchang AU - Zhang, Zhihua T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 1600 EP - 1605 UR - https://ijcai.org/proceedings/2013/238 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: