• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

PROBEN1 - a set of neural network benchmark problems and benchmarking rules (1994)

Cached

  • Download as a PDF

Download Links

  • [www.ii.uam.es]
  • [ftp.cis.ohio-state.edu]
  • [wwwipd.ira.uka.de]
  • [ftp.informatik.uni-freiburg.de]
  • [wwwipd.ira.uka.de]
  • [page.mi.fu-berlin.de]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Lutz Prechelt
Citations:156 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Prechelt94proben1-,
    author = {Lutz Prechelt},
    title = {PROBEN1 - a set of neural network benchmark problems and benchmarking rules},
    institution = {},
    year = {1994}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Proben1 is a collection of problems for neural network learning in the realm of pattern classification and function approximation plus a set of rules and conventions for carrying out benchmark tests with these or similar problems. Proben1 contains 15 data sets from 12 different domains. All datasets represent realistic problems which could be called diagnosis tasks and all but one consist of real world data. The datasets are all presented in the same simple format, using an attribute representation that can directly be used for neural network training. Along with the datasets, Proben1 defines a set of rules for how to conduct and how to document neural network benchmarking. The purpose of the problem and rule collection is to give researchers easy access to data for the evaluation of their algorithms and networks and to make direct comparison of the published results feasible. This report describes the datasets and the benchmarking rules. It also gives some basic performance measures indicating the difficulty of the various problems. These measures can be used as baselines for comparison.

Citations

634 Hierarchical mixtures of experts and the EM algorithm - Jordan, Jacobs - 1994
537 Neural networks and the bias/variance dilemma - Geman, Bienenstock, et al. - 1992
505 A direct adaptive method for faster back-propagation learning: the RPROP algorithm - Riedmiller, Braun - 1993
233 Neural Network Classifiers Estimate Bayesian a posteriori Probabilities - Richard, Lippmann - 1991
151 A time-delay neural network architecture for isolated word recognition - Lang, Waibel, et al. - 1990
118 Learning to tell two spirals apart - Lang, Witbrock - 1988
113 Simplifying neural networks by soft weight-sharing - Nowlan, Hinton - 1992
111 A technique for trimming the fat from a network via relevance assessment - Mozer, Smolensky, et al. - 1988
51 Improving model selection by nonconvergent methods - Finnoff, Hergert, et al. - 1993
47 A quantitative study of experimental evaluations of neural network algorithms: Current research practice, Neural network - Prechelt
44 A scaled conjugate gradient algorithm for fast supervised learning - Mller - 1993
34 Generalization and parameter estimation in feedforward nets: some experiments - Morgan, Bourlard - 1990
12 A benchmark for classifier learning - Zheng - 1993
9 Energy functions for minimizing misclassification error with minimum complexity networks - Telfer, Szu - 1994
2 A Conceptual Approach to Generalisation in Dynamic Neural Networks - Sjgaard - 1991
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University