Generalized Matrix Local Low Rank Representation by Random Projection and Submatrix Propagation
- PMID: 38948121
- PMCID: PMC11211019
- DOI: 10.1145/3580305.3599361
Generalized Matrix Local Low Rank Representation by Random Projection and Submatrix Propagation
Abstract
Matrix low rank approximation is an effective method to reduce or eliminate the statistical redundancy of its components. Compared with the traditional global low rank methods such as singular value decomposition (SVD), local low rank approximation methods are more advantageous to uncover interpretable data structures when clear duality exists between the rows and columns of the matrix. Local low rank approximation is equivalent to low rank submatrix detection. Unfortunately, existing local low rank approximation methods can detect only submatrices of specific mean structure, which may miss a substantial amount of true and interesting patterns. In this work, we develop a novel matrix computational framework called RPSP (Random Probing based submatrix Propagation) that provides an effective solution for the general matrix local low rank representation problem. RPSP detects local low rank patterns that grow from small submatrices of low rank property, which are determined by a random projection approach. RPSP is supported by theories of random projection. Experiments on synthetic data demonstrate that RPSP outperforms all state-of-the-art methods, with the capacity to robustly and correctly identify the low rank matrices when the pattern has a similar mean as the background, background noise is heteroscedastic and multiple patterns present in the data. On real-world datasets, RPSP also demonstrates its effectiveness in identifying interpretable local low rank matrices.
Keywords: Computing methodologies→Machine learning algorithms; Local low rank matrix; Random projection; Randomized matrix approximation; Representation learning; Sub-matrix detection.
Figures





References
-
- Achlioptas Dimitris. 2003. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of computer and System Sciences 66, 4 (2003), 671–687
-
- Banerjee Arindam, Dhillon Inderjit, Ghosh Joydeep, Merugu Srujana, and Modha Dharmendra S. 2007. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. Journal of Machine Learning Research 8, Aug (2007), 1919–1986.
-
- Bingham Ella and Mannila Heikki. 2001. Random projection in dimensionality reduction: applications to image and text data. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining.
-
- Bouwmans Thierry and Zahzah El Hadi. 2014. Robust PCA via principal component pursuit: A review for a comparative evaluation in video surveillance. Computer Vision and Image Understanding 122 (2014), 22–34.