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: "Statistical Tests for Comparing Supervised Classification Learning Algorithms"
  Abstract: This paper reviews five statistical tests for determining whether one learning algorithm outperforms another on a particular learning task. These tests are compared experimentally to determine their probability of incorrectly detecting a difference when no difference exists (type 1 error). Two widely-used statistical tests are shown to have high probability of Type I error in certain situations and should never be used. These tests are (a) a test for the difference of two proportions and (b) a paired-differences t test based on taking several random train/test splits. A third test, a paired-differences t test based on 10-fold cross-validation, exhibits somewhat elevated probability of Type I error. A fourth test, McNemar's test, is shown to have low Type I error. The fifth test is a new test, 5x2cv, based on 5 iterations of 2-fold cross-validation. Experiments show that this test also has good Type I error. The paper also measures the power (ability to detect algorithm differences when they do exist) of these tests. The 5x2cv test is shown to be slightly more powerful than McNemar's test. The choice of the best test is determined by the computational cost of running the learning algorithm. For algorithms that can be executed only once, McNemar's test is the only test with acceptable Type I error. For algorithms that can be executed ten times, the 5x2cv test is recommended, because it is slightly more powerful and because it directly measures variation due to the choice of training set.

Connected through hyperedge HE-1 (induced by source paper "A Comparative Study of ID3 and Backpropagation for English Text-to-Speech Mapping"):
  with members:
    - "Experiments on the Transfer of Knowledge between Neural Networks Reprinted from: Computational Learning Theory and"
    - "Constructing Nominal Xof-N Attributes"
    - "Improving accuracy by combining rule-based and case-based reasoning"
    - "Framework for Combining Symbolic and Neural Learning rule extraction from neural networks the KBANN algorithm"
    - "Mingers, 1989 J. Mingers. An empirical comparison of pruning methods for decision tree induction. Machine"
    - "Draft Symbolic Representation of Neural Networks"
    - "Learning the Past Tense of English Verbs: The Symbolic Pattern Associator vs. Connectionist Models"
    - "Generalizing from Case Studies: A Case Study"

Connected through hyperedge HE-2 (induced by source paper "Back Propagation is Sensitive to Initial Conditions"):
  with members:
    - "Multiassociative Memory"
    - "Experiments on the Transfer of Knowledge between Neural Networks Reprinted from: Computational Learning Theory and"
    - "Scaling-up RAAMs"
    - "Replicability of Neural Computing Experiments"
    - "Representing and Learning Visual Schemas in Neural Networks for Scene Analysis"
    - "Hyperplane Dynamics as a Means to Understanding Back-Propagation Learning and Network Plasticity"
    - "Neural Network Implementation in SAS R Software"

Connected through hyperedge HE-3 (induced by source paper "Rigorous Learning Curve Bounds from Statistical Mechanics"):
  with members:
    - "Self bounding learning algorithms"
    - "Markov Decision Processes in Large State Spaces"
    - "Learning Curve Bounds for Markov Decision Processes with Undiscounted Rewards"
    - "A General Lower Bound on the Number of Examples Needed for Learning"
    - "Where Genetic Algorithms Excel"
    - "An Experimental and Theoretical Comparison of Model Selection Methods on simple model selection problems, the"
    - "Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation"
    - "A Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with"

Connected through hyperedge HE-4 (induced by source paper "Pessimistic decision tree pruning based on tree size"):
  with members:
    - "Self bounding learning algorithms"
    - "Mingers, 1989 J. Mingers. An empirical comparison of pruning methods for decision tree induction. Machine"
    - "Theory and Applications of Agnostic PAC-Learning with Small Decision Trees"
    - "A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization"
    - "Scaling Up the Accuracy of Naive-Bayes Classifiers: a Decision-Tree Hybrid"

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