Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
- 1 January 1994
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Efficient Algorithms for Minimizing Cross Validation ErrorPublished by Elsevier ,1994
- Irrelevant Features and the Subset Selection ProblemPublished by Elsevier ,1994
- Greedy Attribute SelectionPublished by Elsevier ,1994
- Overfitting avoidance as biasMachine Learning, 1993
- Very Simple Classification Rules Perform Well on Most Commonly Used DatasetsMachine Learning, 1993
- Empirical learning as a function of concept characterMachine Learning, 1990
- An application of the multiedit-condensing technique to the reference selection problem in a print recognition systemPattern Recognition, 1987
- An Examination of Procedures for Determining the Number of Clusters in a Data SetPsychometrika, 1985
- The reduced nearest neighbor rule (Corresp.)IEEE Transactions on Information Theory, 1972
- The condensed nearest neighbor rule (Corresp.)IEEE Transactions on Information Theory, 1968