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: "Parallel Markov chain Monte Carlo sampling."
  Abstract: Markov chain Monte Carlo (MCMC) samplers have proved remarkably popular as tools for Bayesian computation. However, problems can arise in their application when the density of interest is high dimensional and strongly correlated. In these circumstances the sampler may be slow to traverse the state space and mixing is poor. In this article we offer a partial solution to this problem. The state space of the Markov chain is augmented to accommodate multiple chains in parallel. Updates to individual chains are based around a genetic style crossover operator acting on `parent' states drawn from the population of chains. This process makes efficient use of gradient information implicitly encoded within the distribution of states across the population. Empirical studies support the claim that the crossover operator acting on a parallel population of chains improves mixing. This is illustrated with an example of sampling a high dimensional posterior probability density from a complex predictive model. By adopting a latent variable approach the methodology is extended to deal with variable selection and model averaging in high dimensions. This is illustrated with an example of knot selection for a spline interpolant.

Connected through hyperedge HE-1 (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-2 (induced by source paper "Model Selection and Accounting for Model Uncertainty in Linear Regression Models"):
  with members:
    - "Approximate Bayes Factors and Accounting for Model Uncertainty in Generalized Linear Models"
    - "The out-of-bootstrap method for model averaging and selection"
    - "Stacked Density Estimation"
    - "Bayesian Graphical Models for Discrete Data"
    - "Accounting for Model Uncertainty in Survival Analysis Improves Predictive Performance"
    - "Model Selection for Generalized Linear Models via GLIB, with Application to Epidemiology 1"
    - "Markov Chain Monte Carlo Model Determination for Hierarchical and Graphical Log-linear Models"
    - "Decomposable graphical Gaussian model determination"

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