Proceedings

A Scalable Approach to Column-Based Low-Rank Matrix Approximation

Download BibTeX Cite

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.

Yifan Pi, Haoruo Peng, Shuchang Zhou, and Zhihua Zhang. 2013. A Scalable Approach to Column-Based Low-Rank Matrix Approximation. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13. IJCAI, 1600–1605. https://ijcai.org/proceedings/2013/238
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards