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 "on the knowledge graph completion using translation based embedding the loss is as important as the score"):
  Abstract: Knowledge graphs (KGs) represent world's facts in structured forms. KG completion exploits the existing facts in a KG to discover new ones. Translation-based embedding model (TransE) is a prominent formulation to do KG completion. Despite the efficiency of TransE in memory and time, it suffers from several limitations in encoding relation patterns such as many-to-many relation patterns, symmetric, reflexive etc. To tackle this problem, most of the attempts have circled around the revision of the score function of TransE i.e., proposing a more complicated score function such as Trans(A, D, G, H, R, etc) to mitigate the limitations. In this paper, we tackle this problem from a different perspective. We pose theoretical investigations of the main limitations of TransE in the light of loss function rather than the score function. To the best of our knowledge, this has not been investigated so far comprehensively. We show that by a proper selection of the loss function for training the TransE model, the main limitations of the model are mitigated. This is explained by setting upper-bound for the scores of positive samples, showing the region of truth (i.e., the region that a triple is considered positive by the model). Our theoretical proofs with experimental results fill the gap between the capability of translation-based class of embedding models and the loss function. The theories emphasize the importance of the selection of the loss functions for training the models. Our experimental evaluations on different loss functions used for training the models justify our theoretical proofs and confirm the importance of the loss functions on the performance.

Includes members:
  Member "rotate knowledge graph embedding by relational rotation in complex space":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "soft marginal transe for scholarly knowledge graph completion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward understanding the effect of loss function on then performance of knowledge graph embedding")
  Member "improved knowledge graph embedding using background taxonomic information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diachronic embedding for temporal knowledge graph completion")
  Member "improving knowledge graph embedding using simple constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interpretable and fair comparison of link prediction or entity alignment methods with adjusted mean rank")
  Member "knowledge graph embedding with iterative guidance from soft rules":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "knowledge graphs")
  Member "on multi relational link prediction with bilinear models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rdfframes knowledge graph access for machine learning tools")
  Member "toruse knowledge graph embedding on a lie group":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "analogical inference for multi relational embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")

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)