Above are papers related to the following paper: [Paper_ID] Paper #1104769. 	[Title] DART/HYESS Users Guide  recursive covering approach to local learning [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #641956. 	[Title] Adaptive Noise Injection for Input Variables Relevance Determination [Abstract] In this paper we consider the application of training with noise in multi-layer perceptron to input variables relevance determination. Noise injection is modified in order to penalize irrelevant features. The proposed algorithm is attractive as it requires the tuning of a single parameter. This parameter controls the penalization of the inputs together with the complexity of the model. After the presentation of the method, experimental evidences are given on simulated data sets. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1126503. 	[Title] LEARNING MORE FROM LESS DATA: EXPERIMENTS WITH LIFELONG ROBOT LEARNING [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #25772. 	[Title] Flexible Metric Nearest Neighbor Classiflcation [Abstract] The K-nearest-neighbor decision rule assigns an object of unknown class to the plurality class among the K labeled "training" objects that are closest to it. Closeness is usually deflned in terms of a metric distance on the Euclidean space with the input measurement variables as axes. The metric chosen to deflne this distance can strongly efiect performance. An optimal choice depends on the problem at hand as characterized by the respective class distributions on the input measurement space, and within a given problem, on the location of the unknown object in that space. In this paper new types of K-nearest-neighbor procedures are described that estimate the local relevance of each input variable, or their linear combinations, for each individual point to be classifled. This information is then used to separately customize the metric used to deflne distance from that object in flnding its nearest neighbors. These procedures are a hybrid between regular K-nearest-neighbor methods and treestructured recursive partitioning techniques popular in statistics and machine learning. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1105932. 	[Title] An adaptation of Relief for attribute estimation in regression [Abstract] Heuristic measures for estimating the quality of attributes mostly assume the independence of attributes so in domains with strong dependencies between attributes their performance is poor. Relief and its extension ReliefF are capable of correctly estimating the quality of attributes in classification problems with strong dependencies between attributes. By exploiting local information provided by different contexts they provide a global view. We present the analysis of Reli-efF which lead us to its adaptation to regression (continuous class) problems. The experiments on artificial and real-world data sets show that Re-gressional ReliefF correctly estimates the quality of attributes in various conditions, and can be used for non-myopic learning of the regression trees. Regressional ReliefF and ReliefF provide a unified view on estimating the attribute quality in regression and classification. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1997. 	[Title] Cross-Validation and the Bootstrap: Estimating the Error Rate of a Prediction Rule [Abstract] A training set of data has been used to construct a rule for predicting future responses. What is the error rate of this rule? The traditional answer to this question is given by cross-validation. The cross-validation estimate of prediction error is nearly unbiased, but can be highly variable. This article discusses bootstrap estimates of prediction error, which can be thought of as smoothed versions of cross-validation. A particular bootstrap method, the 632+ rule, is shown to substantially outperform cross-validation in a catalog of 24 simulation experiments. Besides providing point estimates, we also consider estimating the variability of an error rate estimate. All of the results here are nonparametric, and apply to any possible prediction rule: however we only study classification problems with 0-1 loss in detail. Our simulations include "smooth" prediction rules like Fisher's Linear Discriminant Function, and unsmooth ones like Nearest Neighbors. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #116528. 	[Title] Selection of Relevant Features and Examples in Machine Learning [Abstract] In this survey, we review work in machine learning on methods for handling data sets containing large amounts of irrelevant information. We focus on two key issues: the problem of selecting relevant features, and the problem of selecting relevant examples. We describe the advances that have been made on these topics in both empirical and theoretical work in machine learning, and we present a general framework that we use to compare different methods. We close with some challenges for future work in this area. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1122580. 	[Title] Virtual Seens and the Frequently Used Dataset [Abstract] The paper considers the situation in which a learner's testing set contains close approximations of cases which appear in the training set. Such cases can be considered `virtual seens' since they are approximately seen by the learner. Generalisation measures which do not take account of the frequency of virtual seens may be misleading. The paper shows that the 1-NN algorithm can be used to derive a normalising baseline for gen-eralisation statistics. The normalisation process is demonstrated though application to Holte's [1] study in which the generalisation performance of the 1R algorithm was tested against C4.5 on 16 commonly used datasets. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #77758. 	[Title] Parzen. On estimation of a probability density function and mode. Annual Mathematical Statistics, 33:1065-1076, 1962. [Abstract] To apply the algorithm for classification we assign each class a separate set of codebook Gaussians. Each set is only trained with patterns from a single class. After having trained the codebook Gaussians, each set provides an estimate of the probability function of one class; just as with Parzen window estimation, we take as the estimate of the pattern distribution the average of all Gaussians in the set. Classification of a pattern may now be done by calculating the probability of each class at the respective sample point, and assigning to the pattern the class with the highest probability. Hence the whole codebook plays a role in the classification of patterns. This is not the case with regular classification schemes using codebooks. We have tested the classification scheme on several classification tasks including the two spiral problem. We compared our algorithm to various other classification algorithms and it came out second; the best algorithm for the applications is the Parzen window estimation. However, the computing time and memory for Parzen window estimation are excessive when compared to our algorithm, and hence, in practical situations, our algorithm is to be preferred. We have developed a fast algorithm which combines attractive properties of both Parzen window estimation and vector quantization. The scale parameter is tuned adaptively and, therefore, is not set in an ad hoc manner. It allows a classification strategy in which all the codebook vectors are taken into account. This yields better results than the standard vector quantization techniques. An interesting topic for further research is to use radially non-symmetric Gaussians. Please summarise all the given information.

Paper #1104769 has the title `DART/HYESS Users Guide  recursive covering approach to local learning  
` and the abstract ` 
`.
Question: Which category should Paper #1104769 be classified as ?
You can select one from ['Neural_Networks', 'Case_Based', 'Theory', 'Reinforcement_Learning', 'Probabilistic_Methods', 'Rule_Learning', 'Genetic_Algorithms'].


Paper #1104769 has the title `DART/HYESS Users Guide  recursive covering approach to local learning  
` and the abstract ` 
`.
Question: Which category should Paper #1104769 be classified as ?
You can select one from ['Neural_Networks', 'Case_Based', 'Theory', 'Reinforcement_Learning', 'Probabilistic_Methods', 'Rule_Learning', 'Genetic_Algorithms'].

This paper should be classified into: Probabilistic_Methods