human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "noisy subspace clustering via matching pursuits"
  Abstract: Sparsity-based subspace clustering algorithms have attracted significant attention thanks to their excellent performance in practical applications. A prominent example is the sparse subspace clustering (SSC) algorithm by Elhamifar and Vidal, which performs spectral clustering based on an adjacency matrix obtained by sparsely representing each data point in terms of all the other data points via the Lasso. When the number of data points is large or the dimension of the ambient space is high, the computational complexity of SSC quickly becomes prohibitive. Dyer  et al.  observed that SSC-orthogonal matching pursuit (OMP) obtained by replacing the Lasso by the greedy OMP algorithm results in significantly lower computational complexity, while often yielding comparable performance. The central goal of this paper is an analytical performance characterization of SSC-OMP for noisy data. Moreover, we introduce and analyze the SSC-matching pursuit (MP) algorithm, which employs MP in lieu of OMP. Both SSC-OMP and SSC-MP are proven to succeed even when the subspaces intersect and when the data points are contaminated by severe noise. The clustering conditions we obtain for SSC-OMP and SSC-MP are similar to those for SSC and for the thresholding-based subspace clustering (TSC) algorithm due to Heckel and Bolcskei. Analytical results in combination with numerical results indicate that both SSC-OMP and SSC-MP with a data-dependent stopping criterion automatically detect the dimensions of the subspaces underlying the data. Experiments on synthetic and on real data show that SSC-MP often matches or exceeds the performance of the computationally more expensive SSC-OMP algorithm. Moreover, SSC-MP compares very favorably to SSC, TSC, and the nearest subspace neighbor algorithm, both in terms of clustering performance and running time. In addition, we find that, in contrast to SSC-OMP, the performance of SSC-MP is very robust with respect to the choice of parameters in the stopping criteria.

Connected through hyperedge HE-1 (induced by source paper "restricted connection orthogonal matching pursuit for sparse subspace clustering"):
  with members:
    - "robust subspace clustering by cauchy loss function"
    - "active orthogonal matching pursuit for sparse subspace clustering"
    - "structured sparse subspace clustering a joint affinity learning and subspace clustering framework"
    - "oracle based active set algorithm for scalable elastic net subspace clustering"
    - "scalable sparse subspace clustering by orthogonal matching pursuit"
    - "algebraic clustering of affine subspaces"
    - "robust and efficient subspace segmentation via least squares regression"
    - "robust recovery of subspace structures by low rank representation"

Connected through hyperedge HE-2 (induced by source paper "basis pursuit and orthogonal matching pursuit for subspace preserving recovery theoretical analysis"):
  with members:
    - "provable self representation based outlier detection in a union of subspaces"
    - "scalable sparse subspace clustering by orthogonal matching pursuit"
    - "robust subspace clustering"
    - "sparse modeling for image and vision processing"
    - "sparse representation of a polytope and recovery of sparse signals and low rank matrices"
    - "greedy feature selection for subspace clustering"
    - "one condition for solution uniqueness and robustness of both l1 synthesis and l1 analysis minimizations"
    - "a remark on the restricted isometry property in orthogonal matching pursuit"

Connected through hyperedge HE-3 (induced by source paper "transformed subspace clustering"):
  with members:
    - "kernel transform learning"
    - "active orthogonal matching pursuit for sparse subspace clustering"
    - "deep clustering for unsupervised learning of visual features"
    - "towards k means friendly spaces simultaneous deep learning and clustering"
    - "a deep matrix factorization method for learning attribute representations"
    - "robust recovery of subspace structures by low rank representation"
    - "sparse subspace clustering algorithm theory and applications"

Connected through hyperedge HE-4 (induced by source paper "sparse subspace clustering via two step reweighted l1 minimization algorithm and provable neighbor recovery rates"):
  with members:
    - "iteratively reweighted ell_1 approaches to sparse composite regularization"
    - "robust subspace clustering"
    - "greedy feature selection for subspace clustering"
    - "a geometric analysis of subspace clustering with outliers"
    - "lasso screening rules via dual polytope projection"
    - "improving the thresholds of sparse recovery an analysis of a two step reweighted basis pursuit algorithm"
    - "recovering compressively sampled signals using partial support information"

Connected through hyperedge HE-5 (induced by source paper "evolutionary self expressive models for subspace clustering"):
  with members:
    - "evolutionary clustering via message passing"
    - "active orthogonal matching pursuit for sparse subspace clustering"
    - "theoretical analysis of sparse subspace clustering with missing entries"
    - "structured sparse subspace clustering a joint affinity learning and subspace clustering framework"
    - "high dimensional low rank plus sparse matrix decomposition"
    - "innovation pursuit a new approach to subspace clustering"
    - "a randomized greedy algorithm for near optimal sensor scheduling in large scale sensor networks"
    - "accelerated sparse subspace clustering"

Connected through hyperedge HE-6 (induced by source paper "active orthogonal matching pursuit for sparse subspace clustering"):
  with members:
    - "restricted isometry property of gaussian random projection for finite set of subspaces"
    - "structured sparse subspace clustering a joint affinity learning and subspace clustering framework"
    - "constructing the l2 graph for robust subspace learning and subspace clustering"
    - "oracle based active set algorithm for scalable elastic net subspace clustering"
    - "correntropy induced l2 graph for robust subspace clustering"
    - "correlation adaptive subspace segmentation by trace lasso"
    - "scalable sparse subspace clustering by orthogonal matching pursuit"
    - "robust and efficient subspace segmentation via least squares regression"

Connected through hyperedge HE-7 (induced by source paper "structured sparse subspace clustering a joint affinity learning and subspace clustering framework"):
  with members:
    - "connections between nuclear norm and frobenius norm based representations"
    - "constructing the l2 graph for robust subspace learning and subspace clustering"
    - "oracle based active set algorithm for scalable elastic net subspace clustering"
    - "sssc am a unified framework for video co segmentation by structured sparse subspace clustering with appearance and motion features"
    - "convex sparse spectral clustering single view to multi view"
    - "correntropy induced l2 graph for robust subspace clustering"
    - "correlation adaptive subspace segmentation by trace lasso"
    - "scalable sparse subspace clustering by orthogonal matching pursuit"

Question: Please tell me which class the center node 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.LG(Machine Learning)