Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: Robust Subspace Clustering via Tighter Rank Approximation
Robust Subspace Segmentation by Low-Rank Representation
Clustering Affine Subspaces: Hardness and Algorithms
Robust moment estimation and improved clustering via sum of squares
Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization
Robust principal component analysis?
Robust Subspace Segmentation with Block-Diagonal Prior
Algebraic Clustering of Affine Subspaces
Detecting Stable Clusters Using Principal Component Analysis
Learning the Distribution Preserving Semantic Subspace for Clustering.
Guaranteed Rank Minimization via Singular Value Projection
Clicks: An effective algorithm for mining subspace clusters in categorical datasets
Sharp analysis of low-rank kernel matrix approximations
Beyond union of subspaces: Subspace pursuit on Grassmann manifold for data representation
Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization
Iterative Concave Rank Approximation for Recovering Low-Rank Matrices
Coresets and sketches for high dimensional subspace approximation problems
Relevant Subspace Clustering: Mining the Most Interesting Non-redundant Concepts in High Dimensional Data
Enhanced Low-Rank Matrix Approximation
Hyperplane Clustering Via Dual Principal Component Pursuit
Robust Kernel Low-Rank Representation
Literacy acquisition reduces the influence of automatic holistic processing of faces and houses
Evaluating the cost of software quality
Attention-based Context Aggregation Network for Monocular Depth Estimation
An improved phase-locked loop method for automatic resonance frequency tracing based on static capacitance broadband compensation for a high-power ultrasonic transducer
Locality-sensitive hashing scheme based on p-stable distributions