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 "restricted boltzmann machines with gaussian visible units guided by pairwise constraints"):
  Abstract: Restricted Boltzmann machines (RBMs) and their variants are usually trained by contrastive divergence (CD) learning, but the training procedure is an unsupervised learning approach, without any guidances of the background knowledge. To enhance the expression ability of traditional RBMs, in this paper, we propose pairwise constraints restricted Boltzmann machine with Gaussian visible units (pcGRBM) model, in which the learning procedure is guided by pairwise constraints and the process of encoding is conducted under these guidances. The pairwise constraints are encoded in hidden layer features of pcGRBM. Then, some pairwise hidden features of pcGRBM flock together and another part of them are separated by the guidances. In order to deal with real-valued data, the binary visible units are replaced by linear units with Gausian noise in the pcGRBM model. In the learning process of pcGRBM, the pairwise constraints are iterated transitions between visible and hidden units during CD learning procedure. Then, the proposed model is inferred by approximative gradient descent method and the corresponding learning algorithm is designed in this paper. In order to compare the availability of pcGRBM and traditional RBMs with Gaussian visible units, the features of the pcGRBM and RBMs hidden layer are used as input 'data' for K-means, spectral clustering (SP) and affinity propagation (AP) algorithms, respectively. A thorough experimental evaluation is performed with sixteen image datasets of Microsoft Research Asia Multimedia (MSRA-MM). The experimental results show that the clustering performance of K-means, SP and AP algorithms based on pcGRBM model are significantly better than traditional RBMs. In addition, the pcGRBM model for clustering task shows better performance than some semi-supervised clustering algorithms.

Includes members:
  Member "gaussian binary restricted boltzmann machines for modeling natural image statistics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning tensor latent features")
  Member "estimating 3d trajectories from 2d projections via disjunctive factored four way conditional restricted boltzmann machines":
    also connected through other hyperedges:
      (none)
  Member "theta rbm unfactored gated restricted boltzmann machine for rotation invariant representations":
    also connected through other hyperedges:
      (none)
  Member "a novel feature extraction method for scene recognition based on centered convolutional restricted boltzmann machines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "plug and play rescaling based crowd counting in static images")
  Member "deep transductive semi supervised maximum margin clustering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "self learning local supervision encoding framework to constrict and disperse feature distribution for clustering")
  Member "a generative restricted boltzmann machine based method for high dimensional motion data modeling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "variational conditional dependence hidden markov models for human action recognition")
  Member "speech recognition with deep recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "centrality graph convolutional networks for skeleton based action recognition")
  Member "modeling documents with deep boltzmann machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative neural networks conn exploiting prior independence structure for improved classification")

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.LG(Machine Learning)