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 "knowledge graph embedding with iterative guidance from soft rules"):
  Abstract: Embedding knowledge graphs (KGs) into continuous vector spaces is a focus of current research. Combining such an embedding model with logic rules has recently attracted increasing attention. Most previous attempts made a one-time injection of logic rules, ignoring the interactive nature between embedding learning and logical inference. And they focused only on hard rules, which always hold with no exception and usually require extensive manual effort to create or validate. In this paper, we propose Rule-Guided Embedding (RUGE), a novel paradigm of KG embedding with iterative guidance from soft rules. RUGE enables an embedding model to learn simultaneously from 1) labeled triples that have been directly observed in a given KG, 2) unlabeled triples whose labels are going to be predicted iteratively, and 3) soft rules with various confidence levels extracted automatically from the KG. In the learning process, RUGE iteratively queries rules to obtain soft labels for unlabeled triples, and integrates such newly labeled triples to update the embedding model. Through this iterative procedure, knowledge embodied in logic rules may be better transferred into the learned embeddings. We evaluate RUGE in link prediction on Freebase and YAGO. Experimental results show that: 1) with rule knowledge injected iteratively, RUGE achieves significant and consistent improvements over state-of-the-art baselines; and 2) despite their uncertainties, automatically extracted soft rules are highly beneficial to KG embedding, even those with moderate confidence levels. The code and data used for this paper can be obtained from this https URL

Includes members:
  Member "probabilistic reasoning via deep learning neural association models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint embedding learning of educational knowledge graphs")
  Member "harnessing deep neural networks with logic rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "natural language qa approaches using reasoning with external knowledge")
  Member "ssp semantic space projection for knowledge graph embedding with text descriptions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "can x2vec save lives integrating graph and language embeddings for automatic mental health classification")
  Member "lifted rule injection for relation embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "knowledge graphs")
  Member "complex embeddings for simple link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "knowledge graphs")
  Member "traversing knowledge graphs in vector space":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scalable neural methods for reasoning with a symbolic knowledge base")

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)