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: "Constructing Nominal Xof-N Attributes"
  Abstract: Most constructive induction researchers focus only on new boolean attributes. This paper reports a new constructive induction algorithm, called XofN, that constructs new nominal attributes in the form of Xof-N representations. An Xof-N is a set containing one or more attribute-value pairs. For a given instance, its value corresponds to the number of its attribute-value pairs that are true. The promising preliminary experimental results, on both artificial and real-world domains, show that constructing new nominal attributes in the form of Xof-N representations can significantly improve the performance of selective induction in terms of both higher prediction accuracy and lower theory complexity.

Connected through hyperedge HE-1 (induced by source paper "Effects of Different Types of New Attribute on Constructive Induction"):
  with members:
    - "ID2-of-3: Constructive Induction of M of-N Concepts for Discriminators in Decision Trees"
    - "A Comparative Study of ID3 and Backpropagation for English Text-to-Speech Mapping"
    - "Continuous-valued Xof-N Attributes Versus Nominal Xof-N Attributes for Constructive Induction: A Case Study"

Connected through hyperedge HE-2 (induced by source paper "Continuous-valued Xof-N Attributes Versus Nominal Xof-N Attributes for Constructive Induction: A Case Study"):
  with members:
    - "ID2-of-3: Constructive Induction of M of-N Concepts for Discriminators in Decision Trees"
    - "A Comparative Study of ID3 and Backpropagation for English Text-to-Speech Mapping"
    - "CONSTRUCTING CONJUNCTIVE TESTS FOR DECISION TREES"
    - "Effects of Different Types of New Attribute on Constructive Induction"

Connected through hyperedge HE-3 (induced by source paper "A Comparative Study of ID3 and Backpropagation for English Text-to-Speech Mapping"):
  with members:
    - "Experiments on the Transfer of Knowledge between Neural Networks Reprinted from: Computational Learning Theory and"
    - "Statistical Tests for Comparing Supervised Classification Learning Algorithms"
    - "Improving accuracy by combining rule-based and case-based reasoning"
    - "Framework for Combining Symbolic and Neural Learning rule extraction from neural networks the KBANN algorithm"
    - "Mingers, 1989 J. Mingers. An empirical comparison of pruning methods for decision tree induction. Machine"
    - "Draft Symbolic Representation of Neural Networks"
    - "Learning the Past Tense of English Verbs: The Symbolic Pattern Associator vs. Connectionist Models"
    - "Generalizing from Case Studies: A Case Study"

Connected through hyperedge HE-4 (induced by source paper "ID2-of-3: Constructive Induction of M of-N Concepts for Discriminators in Decision Trees"):
  with members:
    - "Constructing Conjunctions using Systematic Search on Decision Trees"
    - "Extending Theory Refinement to M-of-N Rules"
    - "Rerepresenting and Restructuring Domain Theories: A Constructive Induction Approach"
    - "What do Constructive Learners Really Learn?"
    - "Unsupervised Constructive Learning"
    - "Parity: The Problem that Won't Go Away"
    - "Discovering Representation Space Transformations for Learning Concept Descriptions Combining DNF and M-of-N Rules"
    - "CONSTRUCTING CONJUNCTIVE TESTS FOR DECISION TREES"

Connected through hyperedge HE-5 (induced by source paper "Multivariate versus Univariate Decision Trees"):
  with members:
    - "EE380L:Neural Networks for Pattern Recognition  POp Trees  under the guidance of"
    - "Multivariate Decision Trees"
    - "Constructing Conjunctions using Systematic Search on Decision Trees"
    - "Learning NonLinearly Separable Boolean Functions With Linear Threshold Unit Trees and Madaline-Style Networks"
    - "Generating Neural Networks Through the Induction of Threshold Logic Unit Trees (Extended Abstract)"
    - "Recursive Automatic Algorithm Selection for Inductive Learning"
    - "Dynamic Automatic Model Selection"

Connected through hyperedge HE-6 (induced by source paper "CONSTRUCTING CONJUNCTIVE TESTS FOR DECISION TREES"):
  with members:
    - "Constructing Conjunctions using Systematic Search on Decision Trees"
    - "ID2-of-3: Constructive Induction of M of-N Concepts for Discriminators in Decision Trees"
    - "A BENCHMARK FOR CLASSIFIER LEARNING"
    - "Continuous-valued Xof-N Attributes Versus Nominal Xof-N Attributes for Constructive Induction: A Case Study"

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