Bayesian information criteria and smoothing parameter selection in radial basis function networks
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
By extending Schwarz's (1978) basic idea we derive a Bayesian information criterion which enables us to evaluate models estimated by the maximum penalised likelihood method or the method of regularisation. The proposed criterion is applied to the choice of smoothing parameters and the number of basis functions in radial basis function network models. Monte Carlo experiments were conducted to examine the performance of the nonlinear modelling strategy of estimating the weight parameters by regularisation and then determining the adjusted parameters by the Bayesian information criterion. The simulation results show that our modelling procedure performs well in various situations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Regression and time series model selection in small samples
HURVICH, C. M., & TSAI, C.-L. (1989) · Biometrika · doi:10.1093/biomet/76.2.297 · Cited by 6,586
A practical Bayesian framework for backpropagation networks
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.448 · Cited by 2,917
Bayesian Measures of Model Complexity and Fit
Spiegelhalter, D. J., Best, N. G., Carlin, B. P., & Van Der Linde, A. (2002) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00353 · Cited by 151
Cited by
A Comparative Review of Dimension Reduction Methods in Approximate Bayesian Computation
Blum, M. G. B., Nunes, M. A., Prangle, D., & Sisson, S. A. (2013) · Statistical Science · doi:10.1214/12-sts406 · Cited by 353
Kim, S., Imoto, S., & Miyano, S. (2004) · Biosystems · doi:10.1016/j.biosystems.2004.03.004 · Cited by 224
Bayesian Methods for Neural Networks and Related Models
Titterington, D. M. (2004) · Statistical Science · doi:10.1214/088342304000000099 · Cited by 162
A Bayesian machine scientist to aid in the solution of challenging scientific problems
Guimerà, R., Reichardt, I., Aguilar-Mogas, A., Massucci, F. A., Miranda, M., Pallarès, J., & Sales-Pardo, M. (2020) · Science Advances · doi:10.1126/sciadv.aav6971 · Cited by 136
“This is a first-order approximation to the description length and holds when the likelihood p(D∣fi, qi) is peaked around the maximum likelihood parameters qi and the prior is smooth in this region; when the number of experimental points is small, the approximation may fail, and one would need to get more precise estim…”
BackgroundInfluential
Metadata
- Authors
- Konishi, S.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-03-01
- Volume
- 91
- Issue
- 1
- Pages
- 27-43
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W2130177815
- Cited by
- 127
- References
- 5
- FWCI
- 6.23
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Bayesian information criteria and smoothing parameter selection in radial basis function networks. https://app.cochat.ai/papers/10.1093/biomet/91.1.27
- The paper
- Konishi, S. (2004). Bayesian information criteria and smoothing parameter selection in radial basis function networks. Biometrika. https://doi.org/10.1093/biomet/91.1.27
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.