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: "The Utility of Feature Weighting in Nearest-Neighbor Algorithms"
  Abstract: Nearest-neighbor algorithms are known to depend heavily on their distance metric. In this paper, we investigate the use of a weighted Euclidean metric in which the weight for each feature comes from a small set of options. We describe Diet, an algorithm that directs search through a space of discrete weights using cross-validation error as its evaluation function. Although a large set of possible weights can reduce the learner's bias, it can also lead to increased variance and overfitting. Our empirical study shows that, for many data sets, there is an advantage to weighting features, but that increasing the number of possible weights beyond two (zero and one) has very little benefit and sometimes degrades performance.

Connected through hyperedge HE-1 (induced by source paper "Bias Plus Variance Decomposition for Zero-One Loss Functions"):
  with members:
    - "On learning hierarchical classifications"
    - "Machine Learning Bias, Statistical Bias, and Statistical Variance of Decision Tree Algorithms"
    - "Characterizing the generalization performance of model selection strategies"
    - "Error-Correcting Output Codes for Local Learners"
    - "Bias, variance and prediction error for classification rules"
    - "Why Does Bagging Work? A Bayesian Account and its Implications bagging's success, both in a"

Connected through hyperedge HE-2 (induced by source paper "A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features"):
  with members:
    - "Protein Secondary Structure Modelling with Probabilistic Networks (Extended Abstract)"
    - "Towards a Better Understanding of Memory-Based Reasoning Systems"
    - "Dynamical Selection of Learning Algorithms"
    - "A Comparative Study of ID3 and Backpropagation for English Text-to-Speech Mapping"
    - "Error-Based and Entropy-Based Discretization of Continuous Features"
    - "Fast NP Chunking Using Memory-Based Learning Techniques"
    - "Resolving PP attachment Ambiguities with Memory-Based Learning"
    - "Memory-Based Lexical Acquisition and Processing"

Connected through hyperedge HE-3 (induced by source paper "Irrelevant Features and the Subset Selection Problem"):
  with members:
    - "Theory Revision in Fault Hierarchies"
    - "An Optimized Theory Revision Module"
    - "Expectation-Based Selective Attention for Visual Monitoring and Control of a Robot Vehicle"
    - "Feature Subset Selection as Search with Probabilistic Estimates"
    - "NP-Completeness of Searches for Smallest Possible Feature Sets a subset of the set of all"
    - "Cost-sensitive feature reduction applied to a hybrid genetic algorithm"
    - "Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms"
    - "Machine Learning Methods for International Conflict Databases: A Case Study in Predicting Mediation Outcome"

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