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: "Effects of Occam's Razor in Evolving Sigma-Pi Neural Nets"
  Abstract: Several evolutionary algorithms make use of hierarchical representations of variable size rather than linear strings of fixed length. Variable complexity of the structures provides an additional representational power which may widen the application domain of evolutionary algorithms. The price for this is, however, that the search space is open-ended and solutions may grow to arbitrarily large size. In this paper we study the effects of structural complexity of the solutions on their generalization performance by analyzing the fitness landscape of sigma-pi neural networks. The analysis suggests that smaller networks achieve, on average, better generalization accuracy than larger ones, thus confirming the usefulness of Occam's razor. A simple method for implementing the Occam's razor principle is described and shown to be effective in improv ing the generalization accuracy without limiting their learning capacity.

Connected through hyperedge HE-1 (induced by source paper "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."):
  with members:
    - "Measuring the Difficulty of Specific Learning Problems"
    - "Trading Spaces: Computation, Representation and the Limits of Uninformed Learning"
    - "Discovering Complex Othello Strategies Through Evolutionary Neural Networks"
    - "USING MARKER-BASED GENETIC ENCODING OF NEURAL NETWORKS TO EVOLVE FINITE-STATE BEHAVIOUR"
    - "Evolving Obstacle Avoidance Behavior in a Robot Arm"
    - "A Comparison of Selection Schemes used in Genetic Algorithms"
    - "Determining Successful Negotiation Strategies: An Evolutionary Approach"
    - "Genetic Programming and Redundancy"

Connected through hyperedge HE-2 (induced by source paper "Evolving Optimal Neural Networks Using Genetic Algorithms with Occam's Razor"):
  with members:
    (none)

Connected through hyperedge HE-3 (induced by source paper "Genetic Programming of Minimal Neural Nets Using Occam's Razor"):
  with members:
    - "Learning networks for face analysis and synthesis"
    - "Recombination Operator, its Correlation to the Fitness Landscape and Search Performance"

Connected through hyperedge HE-4 (induced by source paper "Fitness Landscapes and Difficulty in Genetic Programming"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "Genetic Programming and Redundancy"
    - "The Schema Theorem and Price's Theorem"
    - "A Simulation of Adaptive Agents in a Hostile Environment"
    - "Toward Simulated Evolution of Machine-Language Iteration"
    - "Evolving Non-Determinism: An Inventive and Efficient Tool for Optimization and Discovery of Strategies"
    - "Incremental Co-evolution of Organisms: A New Approach for Optimization and Discovery of Strategies"
    - "Complexity Compression and Evolution"

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