human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent groups of papers sharing a common citing paper.

Details of the hypergraph:
Center node: "Incremental Reduced Error Pruning"
  Abstract: This paper outlines some problems that may occur with Reduced Error Pruning in relational learning algorithms, most notably efficiency. Thereafter a new method, Incremental Reduced Error Pruning, is proposed that attempts to address all of these problems. Experiments show that in many noisy domains this method is much more efficient than alternative algorithms, along with a slight gain in accuracy. However, the experiments show as well that the use of the algorithm cannot be recommended for domains which require a very specific concept description.

Connected through hyperedge HE-1 (induced by source paper "Mingers, 1989 J. Mingers. An empirical comparison of pruning methods for decision tree induction. Machine"):
  with members:
    - "Pessimistic decision tree pruning based on tree size"
    - "Multivariate Decision Trees"
    - "Dynamic Automatic Model Selection"
    - "Finding new rules for incomplete theories: Explicit biases for induction with contextual information. In Proceedings"
    - "Induction of Oblique Decision Trees"
    - "Data Analyses Using Simulated Breeding and Inductive Learning Methods"
    - "Learning Decision Trees from Decision Rules:"
    - "The Estimation of Probabilities in Attribute Selection Measures for Decision Tree Induction"

Connected through hyperedge HE-2 (induced by source paper "Rule Induction with CN2: Some Recent Improvements"):
  with members:
    - "Stochastically Guided Disjunctive Version Space Learning"
    - "Using Qualitative Models to Guide Inductive Learning"
    - "Case-Based Sonogram Classification"
    - "Relating Relational Learning Algorithms"
    - "Generalizing from Case Studies: A Case Study"
    - "What do Constructive Learners Really Learn?"
    - "Unsupervised Constructive Learning"
    - "Fossil: A Robust Relational Learner"

Connected through hyperedge HE-3 (induced by source paper "An investigation of noise-tolerant relational concept learning algorithms"):
  with members:
    - "Utilizing Prior Concepts for Learning"
    - "Mingers, 1989 J. Mingers. An empirical comparison of pruning methods for decision tree induction. Machine"
    - "Fossil: A Robust Relational Learner"
    - "A Comparison of Pruning Methods for Relational Concept Learning"
    - "Top-Down Pruning in Relational Learning"
    - "Stochastic search in inductive concept learning"

Question: Please tell me which class the center node belongs to. The 7 classes are: Neural_Networks, Reinforcement_Learning, Probabilistic_Methods, Theory, Genetic_Algorithms, Case_Based, Rule_Learning. Directly output the class name.

gpt: Rule_Learning