A Response to ’’On method overfitting‘‘

Authors:
Ian P. Gent
Affiliations:
Department of Computer Science, University of Strathclyde, Glasgow G1 1XH, United Kingdom
Venue:
Journal of Heuristics
Year:
1999

Citing 5
Cited 2

Very Simple Classification Rules Perform Well on Most Commonly Used Datasets

Machine Learning
Evaluating evolutionary algorithms

Artificial Intelligence - Special volume on empirical methods
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic Solution of Open Bin Packing Problems

Journal of Heuristics
On Method Overfitting

Journal of Heuristics

Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics

Journal of Heuristics
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

If special-purposemethods can be overfitted to benchmarks, so can general methods.