The DOI matches its Crossref record.
STOCHASTIC COMPLEXITY IN STATISTICAL INQUIRY
Abstract
By J. Rissanen: 178 pp., £29.00, ISBN 9 971 50859 1 (World Scientific Publishing, 1989.)
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
Cited by
Rao, R. P. N., & Ballard, D. H. (1999) · Nature Neuroscience · doi:10.1038/4580 · Cited by 5,483
Region competition: unifying snakes, region growing, and Bayes/MDL for multiband image segmentation
Zhu, S. C., & Yuille, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.537343 · Cited by 1,913
The analysis of observed chaotic data in physical systems
Abarbanel, H. D. I., Brown, R., Sidorowich, J. J., & Tsimring, L. S. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.1331 · Cited by 1,848
Blobworld: image segmentation using expectation-maximization and its application to image querying
Carson, C., Belongie, S., Greenspan, H., & Malik, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1023800 · Cited by 1,410
The context-tree weighting method: basic properties
Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382012 · Cited by 919
Comparing dynamic causal models.
Penny, W. D., Stephan, K. E., Mechelli, A., & Friston, K. J. (2004) · NeuroImage · doi:10.1016/j.neuroimage.2004.03.026 · Cited by 848
The calculi of emergence: computation, dynamics and induction
Crutchfield, J. P. (1994) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(94)90273-9 · Cited by 754
Akaike's Information Criterion and Recent Developments in Information Complexity
Bozdogan, H. (2000) · Journal of Mathematical Psychology · doi:10.1006/jmps.1999.1277 · Cited by 674
Predicting Gene Expression from Sequence
Beer, M. A., & Tavazoie, S. (2004) · Cell · doi:10.1016/s0092-8674(04)00304-6 · Cited by 599
How smart are our environments? An updated look at the state of the art
Cook, D. J., & Das, S. K. (2007) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2006.12.001 · Cited by 589
Support vector machines for SAR automatic target recognition
Zhao, Q., & Principe, J. C. (2001) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.937475 · Cited by 540
Distributional regularity and phonotactic constraints are useful for segmentation
Brent, M. R., & Cartwright, T. A. (1996) · Cognition · doi:10.1016/s0010-0277(96)00719-6 · Cited by 514
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
Analysis of multiresolution image denoising schemes using generalized Gaussian and complexity priors
Moulin, P., & Liu, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761332 · Cited by 500
Rogers, L. L., & Dowla, F. U. (1994) · Water Resources Research · doi:10.1029/93wr01494 · Cited by 486
Crutchfield, J. P. (2012) · Nature Physics · doi:10.1038/nphys2190 · Cited by 446
Learning Bayesian Networks with Local Structure
Friedman, N., & Goldszmidt, M. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_15 · Cited by 397
An Efficient, Probabilistically Sound Algorithm for Segmentation and Word Discovery
Brent, M. R. (1999) · Machine Learning · doi:10.1023/a:1007541817488 · Cited by 351
Advantage of rare HLA supertype in HIV disease progression
Trachtenberg, E., Korber, B., Sollars, C., Kepler, T. B., Hraber, P. T., Hayes, E., Funkhouser, R., Fugate, M., Theiler, J., Hsu, Y. S., et al. (2003) · Nature Medicine · doi:10.1038/nm893 · Cited by 348
Data mining with decision trees and decision rules
Apté, C., & Weiss, S. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00021-6 · Cited by 307
3 Parts and wholes: Implicative patterns in inflectional paradigms
Ackerman, F., Blevins, J. P., & Malouf, R. (2009) · Analogy in Grammar · doi:10.1093/acprof:oso/9780199547548.003.0003 · Cited by 302
Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions
Azoury, K. S., & Warmuth, M. K. (2001) · Machine Learning · doi:10.1023/a:1010896012157 · Cited by 298
The Possible-Word Constraint in the Segmentation of Continuous Speech
Norris, D., Mcqueen, J. M., Cutler, A., & Butterfield, S. (1997) · Cognitive Psychology · doi:10.1006/cogp.1997.0671 · Cited by 295
Promises and challenges of evolvable hardware
Yao, X., & Higuchi, T. (1999) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.740672 · Cited by 283
Locally recurrent globally feedforward networks: a critical review of architectures
Tsoi, A. C., & Back, A. D. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279187 · Cited by 279
Feedforward Neural Network Methodology
Rao, M. B. (2000) · Technometrics · doi:10.1080/00401706.2000.10485725 · Cited by 279
Deformable template models: A review
Jain, A. K., Zhong, Y., & Dubuisson-Jolly, M.-P. (1998) · Signal Processing · doi:10.1016/s0165-1684(98)00139-x · Cited by 255
Morph-based speech recognition and modeling of out-of-vocabulary words across languages
Creutz, M., Hirsimäki, T., Kurimo, M., Puurula, A., Pylkkönen, J., Siivola, V., Varjokallio, M., Arisoy, E., Saraçlar, M., & Stolcke, A. (2007) · ACM Transactions on Speech and Language Processing · doi:10.1145/1322391.1322394 · Cited by 127
Computing Accurate Correspondences across Groups of Images
Cootes, T. F., Twining, C. J., Petrovic, V. S., Babalola, K. O., & Taylor, C. J. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.193 · Cited by 70
Metadata
- Authors
- Dawid, A. P.
- Venue
- Bulletin of the London Mathematical Society
- Publisher
- Wiley
- Published
- 1991-01
- Volume
- 23
- Issue
- 1
- Pages
- 106-108
- ISSN
- 0024-6093 (ISSN-L)
- OpenAlex
- W2573934436
- Cited by
- 651
- References
- 0
- FWCI
- 30.72
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.