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 "composing knowledge graph embeddings via word embeddings"):
  Abstract: Learning knowledge graph embedding from an existing knowledge graph is very important to knowledge graph completion. For a fact $(h,r,t)$ with the head entity $h$ having a relation $r$ with the tail entity $t$, the current approaches aim to learn low dimensional representations $(\mathbf{h},\mathbf{r},\mathbf{t})$, each of which corresponds to the elements in $(h, r, t)$, respectively. As $(\mathbf{h},\mathbf{r},\mathbf{t})$ is learned from the existing facts within a knowledge graph, these representations can not be used to detect unknown facts (if the entities or relations never occur in the knowledge graph). #R##N#This paper proposes a new approach called TransW, aiming to go beyond the current work by composing knowledge graph embeddings using word embeddings. Given the fact that an entity or a relation contains one or more words (quite often), it is sensible to learn a mapping function from word embedding spaces to knowledge embedding spaces, which shows how entities are constructed using human words. More importantly, composing knowledge embeddings using word embeddings makes it possible to deal with the emerging new facts (either new entities or relations). Experimental results using three public datasets show the consistency and outperformance of the proposed TransW.

Includes members:
  Member "incorporating gan for negative sampling in knowledge representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficiently embedding dynamic knowledge graphs")
  Member "a novel embedding model for knowledge base completion based on convolutional neural network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "kbgan adversarial learning for knowledge graph embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "toruse knowledge graph embedding on a lie group":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "a comprehensive survey of graph embedding problems techniques and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning to segment 3d point clouds in 2d image space")
  Member "complex embeddings for simple link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "modeling relation paths for representation learning of knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "from one point to a manifold knowledge graph embedding for precise link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an evaluation of knowledge graph embeddings for autonomous driving data experience and practice")

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.AI(Artificial Intelligence)