scientific article; zbMATH DE number 45100

MaRDI QIDQ3995624zbMATH OpenFDO

Authors Jorma Rissanen

Publication date 17 September 1992

Cited in

(only showing first 100 items - show all)

Data mining based Bayesian networks for best classification
Minimum message length shrinkage estimation
On some properties of the NML estimator for Bernoulli strings
Modeling nonlinear dynamics and chaos: a review
Structural break estimation of noisy sinusoidal signals
An entropy criterion for assessing the number of clusters in a mixture model
Averaging over decision trees
Strong approximation of vector-valued stochastic integrals
Data compression and histograms
Counterexamples to parsimony and BIC
Model selection and prediction: Normal regression
Failure-time prediction
Stochastic complexity and model selection from incomplete data
On model selection via stochastic complexity in robust linear regression
A maximum likelihood method for latent class regression involving a censored dependent variable
Strong approximation of the recursive prediction error estimator of the parameters of an ARMA process
A wavelet regularization method for diffusion radar-target imaging and speckle noise reduction
Minimum entropy of error principle in estimation
On Rissanen's predictive stochastic complexity for stationary ARMA processes
Bounded rationality, neural network and folk theorem in repeated games with discounting
Recognition
The discovery of algorithmic probability
Stochastic complexity in learning
Learning about the parameter of the Bernoulli model
On-line maximum likelihood prediction with respect to general loss functions
Classification of binary vectors by stochastic complexity.
Predicting a binary sequence almost as well as the optimal biased coin
Scalability of the Bayesian optimization algorithm.
The generalized universal law of generalization.
Regression spline smoothing using the minimum description length principle
Applying MDL to learn best model granularity
On the complexity of additive clustering models
Efficient data reconciliation
Law of iterated logarithm and consistent model selection criterion in logistic regression
Open problems in universal induction \& intelligence
Fast nonparametric active contour adapted to quadratic inhomogeneous intensity fluctuations
Image transforms for determining fit-for-purpose complexity of geostatistical models in flow modeling
Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series
Automatic identification of rock fracture sets using finite mixture models
Discovery of time-series motif from multi-dimensional data based on MDL principle
Thermodynamics of natural selection. III: Landauer's principle in computation and chemistry
Clustering of fuzzy data and simultaneous feature selection: a model selection approach
Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions
Spatial sampling design based on stochastic complexity.
Models of knowing and the investigation of dynamical systems
The calculi of emergence: Computation, dynamics and induction
On selecting models for nonlinear time series
The consistency of the BIC Markov order estimator.
Asymptotically minimax regret procedures in regression model selection and the magnitude of the dimension penalty.
Selecting optimal multistep predictors for autoregressive processes of unknown order.
Optimal embedding parameters: a modelling paradigm
Local discriminant bases and their applications
Modeling chaotic motions of a string from experimental data
A network of autoregressive processing units for time series modeling
Locally uniform prior distributions
Test for homogeneity of several populations by stochastic complexity
Local bandwidth selection via second derivative segmentation
Towards long-term prediction
Embedding as a modeling problem
Measures of statistical complexity: why?
Comparisons of new nonlinear modeling techniques with applications to infant respiration.
Variable length Markov chains
Akaike's information criterion and recent developments in information complexity
Model selection based on minimum description length
Generalized threshold latent variable model
Information and complexity, or: where is the information?
The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models
Law of iterated logarithm and model selection consistency for generalized linear models with independent and dependent responses
Multiple changepoint detection with partial information on changepoint times
Brownian warps for non-rigid registration
On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model
On universal prediction and Bayesian confirmation
`Ideal learning' of natural language: positive results about learning from positive evidence
Suboptimal behavior of Bayes and MDL in classification under misspecification
The ambiguity of simplicity in quantum and classical simulation
Study and development of the DTD generation system for XML documents
Robust growing neural gas algorithm with application in cluster analysis
A unified view on clustering binary data
Selecting nonlinear stochastic process rate models using information criteria
An algebra of human concept learning
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Network tomography: recent developments
Accumulative prediction error and the selection of time series models
Model selection by normalized maximum likelihood
An empirical study of minimum description length model selection with infinite parametric complexity
Stochastic motion and the level set method in computer vision: stochastic active contours
Flexible scan statistic test to detect disease clusters in hierarchical trees
A BYY scale-incremental EM algorithm for Gaussian mixture learning
Varieties of Helmholtz machine
Simultaneous modeling of nonlinear deterministic and stochastic dynamics
Real patterns and indispensability
Subset selection in linear regression using sequentially normalized least squares: asymptotic theory
On consistency of minimum description length model selection for piecewise autoregressions
Detecting abrupt changes in the spectra of high-energy astrophysical sources
Statistical learning theory, model identification and system information content
Entropy concentration and the empirical coding game
Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes
Exploring Validity Indices for Clustering Textual Data
Minimum description length modelling of musical structure
Three-objective subgraph mining using multiobjective evolutionary programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3995624)