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: "GIBBS-MARKOV MODELS"
  Abstract: In this paper we present a framework for building probabilistic automata parameterized by context-dependent probabilities. Gibbs distributions are used to model state transitions and output generation, and parameter estimation is carried out using an EM algorithm where the M-step uses a generalized iterative scaling procedure. We discuss relations with certain classes of stochastic feedforward neural networks, a geometric interpretation for parameter estimation, and a simple example of a statistical language model constructed using this methodology.

Connected through hyperedge HE-1 (induced by source paper "Hidden Markov Models in Computational Biology: Applications to Protein Modeling UCSC-CRL-93-32 Keywords: Hidden Markov Models,"):
  with members:
    - "The megaprior heuristic for discovering protein sequence patterns"
    - "Using Dirichlet Mixture Priors to Derive Hidden Markov Models for Protein Families"
    - "Minimum-Risk Profiles of Protein Families Based on Statistical Decision Theory"
    - "Homology Detection via Family Pairwise Search a straightforward generalization of pairwise sequence comparison algorithms to"
    - "A Gentle Guide to Multiple Alignment Version Please send comments, critique, flames and praise Instructions"
    - "Density Networks and their Application to Protein Modelling"
    - "Stochastic Decomposition of DNA Sequences Using Hidden Markov Models"
    - "A New Look at Tree Models for Multiple Sequence Alignment"

Connected through hyperedge HE-2 (induced by source paper "Mean Field Theory for Sigmoid Belief Networks"):
  with members:
    - "Large Deviation Methods for Approximate Probabilistic Inference, with Rates of Convergence a free parameter. The"
    - "GIBBS-MARKOV MODELS"
    - "GIBBS-MARKOV MODELS"
    - "Book Review  Introduction to the Theory of Neural Computation Reviewed by: 2"
    - "Learning Generative Models with the Up-Propagation Algorithm"
    - "A VIEW OF THE EM ALGORITHM THAT JUSTIFIES INCREMENTAL, SPARSE, AND OTHER VARIANTS"
    - "Localist Attractor Networks"
    - "Computing upper and lower bounds on likelihoods in intractable networks"

Connected through hyperedge HE-3 (induced by source paper "Equivalence of Linear Boltzmann Chains and Hidden Markov Models sequence L, is: where Z(; A;"):
  with members:
    - "GIBBS-MARKOV MODELS"
    - "GIBBS-MARKOV MODELS"
    - "Learning networks for face analysis and synthesis"
    - "Boltzmann Chains and Hidden Markov Models"

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