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 "logic rules powered knowledge graph embedding"):
  Abstract: Large scale knowledge graph embedding has attracted much attention from both academia and industry in the field of Artificial Intelligence. However, most existing methods concentrate solely on fact triples contained in the given knowledge graph. Inspired by the fact that logic rules can provide a flexible and declarative language for expressing rich background knowledge, it is natural to integrate logic rules into knowledge graph embedding, to transfer human knowledge to entity and relation embedding, and strengthen the learning process. In this paper, we propose a novel logic rule-enhanced method which can be easily integrated with any translation based knowledge graph embedding model, such as TransE . We first introduce a method to automatically mine the logic rules and corresponding confidences from the triples. And then, to put both triples and mined logic rules within the same semantic space, all triples in the knowledge graph are represented as first-order logic. Finally, we define several operations on the first-order logic and minimize a global loss over both of the mined logic rules and the transformed first-order logics. We conduct extensive experiments for link prediction and triple classification on three datasets: WN18, FB166, and FB15K. Experiments show that the rule-enhanced method can significantly improve the performance of several baselines. The highlight of our model is that the filtered Hits@1, which is a pivotal evaluation in the knowledge inference task, has a significant improvement (up to 700% improvement).

Includes members:
  Member "paragraphe a library for parallel knowledge graph embedding":
    also connected through other hyperedges:
      (none)
  Member "harnessing deep neural networks with logic rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "natural language qa approaches using reasoning with external knowledge")
  Member "modeling relation paths for representation learning of knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "holographic embeddings of knowledge graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "knowledge graphs")
  Member "connecting language and knowledge bases with embedding models for relation extraction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "infinite hidden relational models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "heterogeneous relational reasoning in knowledge graphs with reinforcement learning")
  Member "probabilistic similarity logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non parametric learning of gaifman models")

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)