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: "LEARNING BY ERROR-DRIVEN DECOMPOSITION"
  Abstract: In this paper we describe a new selforganizing decomposition technique for learning high-dimensional mappings. Problem decomposition is performed in an error-driven manner, such that the resulting subtasks (patches) are equally well approximated. Our method combines an unsupervised learning scheme (Feature Maps [Koh84]) with a nonlinear approximator (Backpropagation [RHW86]). The resulting learning system is more stable and effective in changing environments than plain backpropagation and much more powerful than extended feature maps as proposed by [RS88, RMS89]. Extensions of our method give rise to active exploration strategies for autonomous agents facing unknown environments. The appropriateness of our general purpose method will be demonstrated with an ex ample from mathematical function approximation.

Connected through hyperedge HE-1 (induced by source paper "Representation and Evolution of Neural Networks"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "Dynamic Parameter Encoding for Genetic Algorithms"
    - "Feature selection through Functional Links with Evolutionary Computation for Neural Networks"
    - "Genetic Encoding Strategies for Neural Networks"

Connected through hyperedge HE-2 (induced by source paper "Cholinergic suppression of transmission may allow combined associative memory function and self-organization in the neocortex."):
  with members:
    - "Multiassociative Memory"
    - "Convergence-Zone Episodic Memory: Analysis and Simulations"
    - "Topography And Ocular Dominance: A Model Exploring Positive Correlations"
    - "Self-Organization and Functional Role of Lateral Connections and Multisize Receptive Fields in the Primary Visual Cortex"
    - "Neural Network Applicability: Classifying the Problem Space"
    - "Competitive Anti-Hebbian Learning of Invariants"
    - "Multiple Network Systems (Minos) Modules: Task Division and Module Discrimination 1"
    - "Living in a partially structured environment: How to bypass the limitations of classical reinforcement techniques"

Connected through hyperedge HE-3 (induced by source paper "Exploration and Model Building in Mobile Robot Domains"):
  with members:
    - "Learning to Act using Real-Time Dynamic Programming"
    - "Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming"
    - "The Efficient Learning of Multiple Task Sequences"
    - "A Modular Q-Learning Architecture for Manipulator Task Decomposition `Data storage in the cerebellar model ar"
    - "Lazy Acquisition of Place Knowledge"
    - "The Influence of Domain Properties on the Performance of Real-Time Search Algorithms"
    - "Case-Based Acquisition of Place Knowledge"

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