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: "bayesian sparse tucker models for dimension reduction and tensor completion"
  Abstract: Tucker decomposition is the cornerstone of modern machine learning on tensorial data analysis, which have attracted considerable attention for multiway feature extraction, compressive sensing, and tensor completion. The most challenging problem is related to determination of model complexity (i.e., multilinear rank), especially when noise and missing data are present. In addition, existing methods cannot take into account uncertainty information of latent factors, resulting in low generalization performance. To address these issues, we present a class of probabilistic generative Tucker models for tensor decomposition and completion with structural sparsity over multilinear latent space. To exploit structural sparse modeling, we introduce two group sparsity inducing priors by hierarchial representation of Laplace and Student-t distributions, which facilitates fully posterior inference. For model learning, we derived variational Bayesian inferences over all model (hyper)parameters, and developed efficient and scalable algorithms based on multilinear operations. Our methods can automatically adapt model complexity and infer an optimal multilinear rank by the principle of maximum lower bound of model evidence. Experimental results and comparisons on synthetic, chemometrics and neuroimaging data demonstrate remarkable performance of our models for recovering ground-truth of multilinear rank and missing entries.

Connected through hyperedge HE-1 (induced by source paper "tensor computation a new framework for high dimensional problems in eda"):
  with members:
    - "a big data approach to handle process variations uncertainty quantification by tensor recovery"
    - "a big data approach to handle many process variations tensor recovery and applications"
    - "tensorizing neural networks"
    - "enabling high dimensional hierarchical uncertainty quantification by anova and tensor train decomposition"
    - "tensor decompositions for signal processing applications from two way to multiway component analysis"
    - "bayesian cp factorization of incomplete tensors with automatic rank determination"
    - "uncertainty quantification for integrated circuits stochastic spectral methods"
    - "stochastic testing simulator for integrated circuits and mems hierarchical and sparse techniques"

Connected through hyperedge HE-2 (induced by source paper "vectorial dimension reduction for tensors based on bayesian inference"):
  with members:
    - "tensorizing neural networks"
    - "dictionary learning and sparse coding for third order super symmetric tensors"
    - "heterogeneous tensor decomposition for clustering via manifold optimization"
    - "a tensor based dictionary learning approach to tomographic image reconstruction"
    - "a bayesian tensor factorization model via variational inference for link prediction"
    - "robust recovery of subspace structures by low rank representation"
    - "sparse subspace clustering algorithm theory and applications"
    - "infinite tucker decomposition nonparametric bayesian models for multiway data analysis"

Connected through hyperedge HE-3 (induced by source paper "linked component analysis from matrices to high order tensors applications to biomedical data"):
  with members:
    - "bayesian robust tensor factorization for incomplete multiway data"
    - "smooth parafac decomposition for tensor completion"
    - "efficient nonnegative tucker decompositions algorithms and uniqueness"
    - "robust principal component analysis on graphs"
    - "tensor decompositions for signal processing applications from two way to multiway component analysis"
    - "bayesian cp factorization of incomplete tensors with automatic rank determination"
    - "tensor networks for big data analytics and large scale optimization problems"
    - "independent vector analysis identification conditions and performance bounds"

Connected through hyperedge HE-4 (induced by source paper "efficient nonnegative tucker decompositions algorithms and uniqueness"):
  with members:
    - "linked component analysis from matrices to high order tensors applications to biomedical data"
    - "decomposition of big tensors with low multilinear rank"
    - "accelerated canonical polyadic decomposition using mode reduction"
    - "mach fast randomized tensor decompositions"
    - "nonnegative approximations of nonnegative tensors"
    - "non negative sparse coding"

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)