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 Markov chains with variable memory length from noisy output"
  Abstract: The problem of modeling complicated data sequences, such as DNA or speech, often arises in practice. Most of the algorithms select a hypothesis from within a model class assuming that the observed sequence is the direct output of the underlying generation process. In this paper we consider the case when the output passes through a memoryless noisy channel before observation. In particular, we show that in the class of Markov chains with variable memory length, learning is affected by factors, which, despite being super-polynomial, are still small in some practical cases. Markov models with variable memory length, or probabilistic finite suffix automata, were introduced in learning theory by Ron, Singer and Tishby who also described a polynomial time learning algorithm [11, 12]. We present a modification of the algorithm which uses a noise-corrupted sample and has knowledge of the noise structure. The same algorithm is still viable if the noise is not known exactly but a good estimation is available. Finally, some experimental results are presented for removing noise from corrupted English text, and to measure how the performance of the learning algorithm is affected by the size of the noisy sample and the noise rate.

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 "Learning Probabilistic Automata with Variable Memory Length"):
  with members:
    - "Using and combining predictors that specialize"
    - "Machine Learning 27(1):51-68, 1997. Predicting nearly as well as the best pruning of a decision tree"
    - "Category: Control, Navigation and Planning. Key words: Reinforcement learning, Exploration, Hidden state. Prefer oral presentation."
    - "Learning to Use Selective Attention and Short-Term Memory in Sequential Tasks"
    - "Efficient Learning of Typical Finite Automata from Random Walks (Extended Abstract)"
    - "On the Learnability and Usage of Acyclic Probabilistic Finite Automata"

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