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: "0 Inductive learning of compact rule sets by using efficient hypotheses reduction"
  Abstract: A method is described which reduces the hypotheses space with an efficient and easily interpretable reduction criteria called a - reduction. A learning algorithm is described based on a - reduction and analyzed by using probability approximate correct learning results. The results are obtained by reducing a rule set to an equivalent set of kDNF formulas. The goal of the learning algorithm is to induce a compact rule set describing the basic dependencies within a set of data. The reduction is based on criterion which is very exible and gives a semantic interpretation of the rules which fulfill the criteria. Comparison with syntactical hypotheses reduction show that the a reduction improves search and has a smaller probability of missclassification.

Connected through hyperedge HE-1 (induced by source paper "An Improved Algorithm for Incremental Induction of Decision Trees"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"
    - "Theory Revision in Fault Hierarchies"
    - "Integration of Case-Based Reasoning and Neural Networks Approaches for Classification"
    - "Lazy Induction Triggered by CBR"
    - "Induction of Oblique Decision Trees"
    - "Learning Classification Trees"
    - "Relating Relational Learning Algorithms"
    - "Geometric Comparison of Classifications and Rule Sets*"

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: Theory