human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "fast robust pca on graphs"):
  Abstract: Mining useful clusters from high dimensional data have received significant attention of the computer vision and pattern recognition community in the recent years. Linear and nonlinear dimensionality reduction has played an important role to overcome the curse of dimensionality. However, often such methods are accompanied with three different problems: high computational complexity (usually associated with the nuclear norm minimization), nonconvexity (for matrix factorization methods), and susceptibility to gross corruptions in the data. In this paper, we propose a principal component analysis (PCA) based solution that overcomes these three issues and approximates a low-rank recovery method for high dimensional datasets. We target the low-rank recovery by enforcing two types of graph smoothness assumptions, one on the data samples and the other on the features by designing a convex optimization problem. The resulting algorithm is fast, efficient, and scalable for huge datasets with O(n log(n)) computational complexity in the number of data samples. It is also robust to gross corruptions in the dataset as well as to the model parameters. Clustering experiments on 7 benchmark datasets with different types of corruptions and background separation experiments on 3 video datasets show that our proposed model outperforms 10 state-of-the-art dimensionality reduction models. Our theoretical analysis proves that the proposed model is able to recover approximate low-rank representations with a bounded error for clusterable data.

Includes members:
  Member "connections between nuclear norm and frobenius norm based representations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep dictionary learning a parametric network approach")
  Member "stationary signal processing on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "predicting graph signals using kernel regression where the input signal is agnostic to a graph")
  Member "fast randomized singular value thresholding for nuclear norm minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bilinear factor matrix norm minimization for robust pca algorithms and applications")
  Member "robust principal component analysis on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wasserstein based graph alignment")
  Member "shape interaction matrix revisited and robustified efficient subspace clustering with corrupted and incomplete data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi level representation learning for deep subspace clustering")
  Member "gspbox a toolbox for signal processing on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graphbgs background subtraction via recovery of graph signals")
  Member "unlocbox a matlab convex optimization toolbox using proximal splitting methods":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stationary signal processing on graphs")
  Member "matrix completion on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "context aware visual compatibility prediction")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CV(Computer Vision and Pattern Recognition)