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 "beyond markov logic efficient mining of prediction rules in large graphs"):
  Abstract: Graph representations of large knowledge bases may comprise billions of edges. Usually built upon human-generated ontologies, several knowledge bases do not feature declared ontological rules and are far from being complete. Current rule mining approaches rely on schemata or store the graph in-memory, which can be unfeasible for large graphs. In this paper, we introduce HornConcerto, an algorithm to discover Horn clauses in large graphs without the need of a schema. Using a standard fact-based confidence score, we can mine close Horn rules having an arbitrary body size. We show that our method can outperform existing approaches in terms of runtime and memory consumption and mine high-quality rules for the link prediction task, achieving state-of-the-art results on a widely-used benchmark. Moreover, we find that rules alone can perform inference significantly faster than embedding-based methods and achieve accuracies on link prediction comparable to resource-demanding approaches such as Markov Logic Networks.

Includes members:
  Member "knowledge base completion baselines strike back":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "analogical inference for multi relational embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "complex embeddings for simple link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "knowledge graphs")
  Member "rockit exploiting parallelism and symmetry for map inference in statistical relational models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finding minimal cost herbrand models with branch cut and price")
  Member "improving the accuracy and efficiency of map inference for markov logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "xor sampling for network design with correlated stochastic events")
  Member "tuffy scaling up statistical inference in markov logic networks using an rdbms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "nonlinear equation solving a faster alternative to feedforward computation")

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.DB(Databases)