# Compound Rank-k Projections for Bilinear Analysis

arXiv: https://arxiv.org/abs/1411.6231 · HTML: https://mlsanity.com/paper/1411.6231/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Nov 2014.

## Built on by (most cited first, 5 of 5)

- [Active Learning for Deep Visual Tracking](https://mlsanity.com/paper/2110.13259/) (2021)
- [On Sparse High-Dimensional Graphical Model Learning For Dependent Time Series](https://mlsanity.com/paper/2111.07897/) (2021)
- [A Deep Positive-Negative Prototype Approach to Integrated Prototypical Discriminative Learning](https://mlsanity.com/paper/2501.02477/) (2025)
- [Robust Regularized Locality Preserving Indexing for Fiedler Vector Estimation](https://mlsanity.com/paper/2107.12070/) (2021)
- [Dynamic Management of a Deep Learning-Based Anomaly Detection System for 5G Networks](https://mlsanity.com/paper/2601.15177/) (2026)

## Abstract (arXiv)

In many real-world applications, data are represented by matrices or high-order tensors. Despite the promising performance, the existing two-dimensional discriminant analysis algorithms employ a single projection model to exploit the discriminant information for projection, making the model less flexible. In this paper, we propose a novel Compound Rank-k Projection (CRP) algorithm for bilinear analysis. CRP deals with matrices directly without transforming them into vectors, and it therefore preserves the correlations within the matrix and decreases the computation complexity. Different from the existing two dimensional discriminant analysis algorithms, objective function values of CRP increase monotonically.In addition, CRP utilizes multiple rank-k projection models to enable a larger search space in which the optimal solution can be found. In this way, the discriminant ability is enhanced.