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: "Improving Regressors using Boosting Techniques"
  Abstract: In the regression context, boosting and bagging are techniques to build a committee of regressors that may be superior to a single regressor. We use regression trees as fundamental building blocks in bagging committee machines and boosting committee machines. Performance is analyzed on three non-linear functions and the Boston housing database. In all cases, boosting is at least equivalent, and in most cases better than bagging in terms of prediction error.

Connected through hyperedge HE-1 (induced by source paper "A Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with"):
  with members:
    - "Rigorous Learning Curve Bounds from Statistical Mechanics"
    - "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 model f w depending on a set of parameters w is used to estimate"
    - "Preventing "Overfitting" of Cross-Validation Data"

Connected through hyperedge HE-2 (induced by source paper "A System for Induction of Oblique Decision Trees"):
  with members:
    - "Decision Tree Function Approximation in Reinforcement Learning"
    - "A hierarchical ensemble of decision trees applied to classifying data from a psychological experiment"
    - "Lazy Induction Triggered by CBR"
    - "Induction of Oblique Decision Trees"
    - "Geometry in Learning"
    - "Lookahead and Pathology in Decision Tree Induction"
    - "A Decision Tree System for Finding Genes in DNA"
    - "Decision Tree Induction: How Effective is the Greedy Heuristic?"

Connected through hyperedge HE-3 (induced by source paper "A decision-theoretic generalization of on-line learning and an application to boosting how the weight-update rule"):
  with members:
    - "Learning Sparse Perceptrons"
    - "Boosting a weak learning algorithm by majority To be published in Information and Computation"
    - "An Efficient Boosting Algorithm for Combining Preferences"
    - "BOOSTING AND NAIVE BAYESIAN LEARNING"
    - "Actively Searching for an Effective Neural-Network Ensemble"
    - "Learning to Order Things"
    - "The Sources of Increased Accuracy for Two Proposed Boosting Algorithms"
    - "Context-sensitive learning methods for text categorization"

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