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 "a unifying view of explicit and implicit feature maps of graph kernels"):
  Abstract: Non-linear kernel methods can be approximated by fast linear ones using suitable explicit feature maps allowing their application to large scale problems. We investigate how convolution kernels for structured data are composed from base kernels and construct corresponding feature maps. On this basis we propose exact and approximative feature maps for widely used graph kernels based on the kernel trick. We analyze for which kernels and graph properties computation by explicit feature maps is feasible and actually more efficient. In particular, we derive approximative, explicit feature maps for state-of-the-art kernels supporting real-valued attributes including the GraphHopper and graph invariant kernels. In extensive experiments we show that our approaches often achieve a classification accuracy close to the exact methods based on the kernel trick, but require only a fraction of their running time. Moreover, we propose and analyze algorithms for computing random walk, shortest-path and subgraph matching kernels by explicit and implicit feature maps. Our theoretical results are confirmed experimentally by observing a phase transition when comparing running time with respect to label diversity, walk lengths and subgraph size, respectively.

Includes members:
  Member "a survey on graph kernels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalization and representational limits of graph neural networks")
  Member "graph convolutional neural networks for web scale recommender systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "tree based kernel for graphs with continuous attributes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast haar transforms for graph neural networks")
  Member "representation learning on graphs methods and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning to segment 3d point clouds in 2d image space")
  Member "neural message passing for quantum chemistry":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")
  Member "semi supervised classification with graph convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relatext exploiting visual relationships for arbitrary shaped scene text detection with graph convolutional networks")
  Member "convolutional neural networks on graphs with fast localized spectral filtering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on deep geometry learning from a representation perspective")
  Member "subgraph2vec learning distributed representations of rooted sub graphs from large graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "strategies for pre training graph neural networks")

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)