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: "The Effective Size of a Neural Network: A Principal Component Approach"
  Abstract: Often when learning from data, one attaches a penalty term to a standard error term in an attempt to prefer simple models and prevent overfitting. Current penalty terms for neural networks, however, often do not take into account weight interaction. This is a critical drawback since the effective number of parameters in a network usually differs dramatically from the total number of possible parameters. In this paper, we present a penalty term that uses Principal Component Analysis to help detect functional redundancy in a neural network. Results show that our new algorithm gives a much more accurate estimate of network complexity than do standard approaches. As a result, our new term should be able to improve techniques that make use of a penalty term, such as weight decay, weight pruning, feature selection, Bayesian, and prediction-risk tech niques.

Connected through hyperedge HE-1 (induced by source paper "Using Sampling and Queries to Extract Rules from Trained Neural Networks"):
  with members:
    - "Generalization and Exclusive Allocation of Credit in Unsupervised Category Learning"
    - "Extracting Provably Correct Rules from Artificial Neural Networks"
    - "Learning Symbolic Rules Using Artificial Neural Networks"

Connected through hyperedge HE-2 (induced by source paper "A Practical Bayesian Framework for Backprop Networks"):
  with members:
    - "Density Networks and their Application to Protein Modelling"
    - "PREDICTING SUNSPOTS AND EXCHANGE RATES WITH CONNECTIONIST NETWORKS"
    - "FLAT MINIMA Neural Computation 9(1):1-42 (1997)"
    - "Using Neural Networks for Descriptive Statistical Analysis of Educational Data"
    - "Ensemble Learning and Evidence Maximization"
    - "Probabilistic Networks: New Models and New Methods"
    - "Keeping Neural Networks Simple by Minimizing the Description Length of the Weights"
    - "Bayesian Non-linear Modelling for the Prediction Competition"

Connected through hyperedge HE-3 (induced by source paper "Irrelevant Features and the Subset Selection Problem"):
  with members:
    - "Theory Revision in Fault Hierarchies"
    - "An Optimized Theory Revision Module"
    - "Expectation-Based Selective Attention for Visual Monitoring and Control of a Robot Vehicle"
    - "Feature Subset Selection as Search with Probabilistic Estimates"
    - "NP-Completeness of Searches for Smallest Possible Feature Sets a subset of the set of all"
    - "Cost-sensitive feature reduction applied to a hybrid genetic algorithm"
    - "Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms"
    - "Machine Learning Methods for International Conflict Databases: A Case Study in Predicting Mediation Outcome"

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