Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 202

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Automatic Parameter Selection by Minimizing Estimated Error

Kohavi, Ron, John, George H. · 1995 · Machine Learning Proceedings 1995

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/b978-1-55860-377-6.50045-1

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Research works printed but not linked: 22

  1. Brazdil, P., Gama, J. & Henery, B. (1994), Characterizing the applicability of classification algorithms using meta-level learning, in F. Bergadano & L. D. Raedt, eds, “Machine Learning: ECML- 94. European Conference on Machine Learning”, Lectures Notes in Artificial Intelligence, Springer-Verlag, Catania, Italy, pp. 83–102. · doi:10.1007/3-540-57868-4_52
  2. Caruana, R. & Freitag, D. (1994), Greedy attribute selection, in Hirsh & Cohen (1994), pp. 28–37.
  3. Craven, M. W. & Shavlik, J. W. (1993), Learning symbolic rules using artificial neural networks, in P. Utgoff, ed., “Proceedings of the Tenth International Conference on Machine Learning”, Morgan Kaufmann, pp. 73–80. · DOI
  4. Finnoff, 1993, “Improving model selection by nonconvergent methods”, Neural Networks, 6, 771, 10.1016/S0893-6080(05)80122-4 · DOI · Paper page
  5. Gasser, 1991, “A flexible and fast method for automatic smoothing”, Journal of the American Statistical Association, 86, 643, 10.1080/01621459.1991.10475090 · DOI
  6. Hirsh, H. & Cohen, W., eds (1994), Machine Learning: Proceedings of the Eleventh International Conference, Morgan Kaufmann.
  7. Holte, 1993, “Very simple classification rules perform well on most commonly used datasets”, Machine Learning, 11, 63, 10.1023/A:1022631118932 · DOI · Paper page
  8. John, G., Kohavi, R. & Pfleger, K. (1994), Irrelevant features and the subset selection problem, in Hirsh & Cohen (1994), pp. 121–129. Available by anonymous ftp in starry.Stanford.EDU: pub/gjohn/papers/relevance4.ps. · DOI · Paper page
  9. Kohavi, R. (1994), Feature subset selection as search with probabilistic estimates, in “AAAI Fall Symposium on Relevance”. Available by anonymous ftp in starry.Stanford.EDU: pub/ronnyk/aaaiSymposium94.ps.
  10. Kohavi, R. (1995a), The power of decision tables, in N. Lavrac & S. Wrobel, eds, “Machine Learning: ECML-95 (Proc. European Conf. on Machine Learning)”, Spriner Verlag, pp. 174–189. Available by anonymous ftp from starry.Stanford.EDU:pub/ronnyk/tables.ps. · DOI · Paper page
  11. Lang, 1990, “A time-delay neural network architecture for isolated word recognition”, Neural Networks, 3, 23, 10.1016/0893-6080(90)90044-L · DOI · Paper page
  12. Langley, P. & Sage, S. (1994), Induction of selective bayesian classifiers, in “Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence”, Morgan Kaufmann, Seattle, WA, pp. 399–406.
  13. Mangasarian, 1990, “Cancer diagnosis via linear programming”, SIAM News, 23, 1,18
  14. Mitchell, 1982, “Generalization as search”, Artificial Intelligence, 18, 203, 10.1016/0004-3702(82)90040-6 · DOI · Paper page
  15. Moore, A. & Lee, M. (1994), Efficient algorithms for minimizing cross-validation error, in Hirsh & Cohen (1994), pp. 190–198.
  16. Moore, A. W., Hill, D. J. & Johnson, M. P. (1992), An empirical investigation of brute force to choose features, smoothers and function approximators, in “Computational Learning Theory and Natural Learning Systems Conference”.
  17. Press, 1992
  18. Schaffer, 1993, “Selecting a classification method by cross-validation”, Machine Learning, 13, 135, 10.1007/BF00993106 · DOI · Paper page
  19. Schaffer, C. (1994), A conservation law for generalization performance, in Hirsh & Cohen (1994), pp. 259–267.
  20. Stone, 1974, “Cross-validatory choice and assessment of statistical predictions”, Journal of the Royal Statistical Society B, 36, 111, 10.1111/j.2517-6161.1974.tb00994.x · DOI · Paper page
  21. Utans, J. & Moody, J. (1991), Selecting neural network architectures via the prediction risk: Application to corporate bond rating prediction, in “The First International Conference on Artificial Intelligence Applications on Wall Street”, IEEE Computer Society Press. · DOI
  22. Weigend, A. S. (1994), On overfitting and the effective number of hidden units, in M. C. Mozer, P. Smolensky, D. S. Touretzky, J. L. Elman & A. S. Weigend, eds, “Proceedings of the 1993 Connectionist Models Summer School”, Erlbaum Associates, Hillsdale, NJ, pp. 335–342.

Cited by

See all 202

Metadata

Authors
Kohavi, R., & John, G. H.
Venue
Machine Learning Proceedings 1995
Publisher
Elsevier
Published
1995
Pages
304-312
OpenAlex
W1539741229
Cited by
202
References
2
FWCI
16.13
Type
book chapter
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Automatic Parameter Selection by Minimizing Estimated Error. https://app.cochat.ai/papers/10.1016/b978-1-55860-377-6.50045-1
The paper
Kohavi, R., & John, G. H. (1995). Automatic Parameter Selection by Minimizing Estimated Error. Machine Learning Proceedings 1995. https://doi.org/10.1016/b978-1-55860-377-6.50045-1

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.