Pages that link to "Item:Q1081991"

The following pages link to Stochastic complexity and modeling (Q1081991):

Displaying 50 items.

• Asymptotic accuracy of Bayes estimation for latent variables with redundancy (Q255357) (← links)
• VAR forecasting under misspecification (Q265016) (← links)
• On the selection of forecasting models (Q274892) (← links)
• Robust estimation of the number of components for mixtures of linear regression models (Q333392) (← links)
• Comparing two Bayes methods based on the free energy functions in Bernoulli mixtures (Q459428) (← links)
• Reexamination of an information geometric construction of entropic indicators of complexity (Q613216) (← links)
• Quantifying the complexity of geodesic paths on curved statistical manifolds through information geometric entropies and Jacobi fields (Q633725) (← links)
• Variable selection strategies in survival models with multiple imputations (Q636117) (← links)
• Averaging estimators for autoregressions with a near unit root (Q736566) (← links)
• Order selection in finite mixtures of linear regressions (Q744818) (← links)
• A general Hankel-norm approximation scheme for linear recursive filtering (Q752656) (← links)
• On the martingale approximation of the estimation error of ARMA parameters (Q807566) (← links)
• A methodology for developing Bayesian networks: an application to information technology (IT) implementation (Q858433) (← links)
• Stochastic complexities of general mixture models in variational Bayesian learning (Q872400) (← links)
• Comparing dynamic equilibrium models to data: a Bayesian approach (Q899524) (← links)
• Stock and bond return predictability: the discrimination power of model selection criteria (Q959244) (← links)
• A dual latent class unfolding model for two-way two-mode preference rating data (Q961773) (← links)
• A minimum description length approach to hidden Markov models with Poisson and Gaussian emissions. Application to order identification (Q1007478) (← links)
• Upper bound for variational free energy of Bayesian networks (Q1009332) (← links)
• Inferring decision trees using the minimum description length principle (Q1115845) (← links)
• Strong approximation of vector-valued stochastic integrals (Q1181106) (← links)
• Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
• Data compression and histograms (Q1203347) (← links)
• Counterexamples to parsimony and BIC (Q1206610) (← links)
• Model selection and prediction: Normal regression (Q1260697) (← links)
• The weighted average information criterion for order selection in time series and regression models (Q1265993) (← links)
• Failure-time prediction (Q1298697) (← links)
• Stochastic complexity and model selection from incomplete data (Q1298904) (← links)
• A comparative classification of complexity measures (Q1321736) (← links)
• Identification of time-varying systems with abrupt parameter changes (Q1322810) (← links)
• Predictive stochastic complexity and model estimation for finite-state processes (Q1330228) (← links)
• Jeffreys' prior is asymptotically least favorable under entropy risk (Q1333128) (← links)
• On Rissanen's predictive stochastic complexity for stationary ARMA processes (Q1338377) (← links)
• Stochastic complexity in learning (Q1370860) (← links)
• Learning about the parameter of the Bernoulli model (Q1370861) (← links)
• Mutual information, metric entropy and cumulative relative entropy risk (Q1383090) (← links)
• The generalized universal law of generalization. (Q1404969) (← links)
• Singularities in mixture models and upper bounds of stochastic complexity. (Q1422259) (← links)
• Accuracy of latent-variable estimation in Bayesian semi-supervised learning (Q1669141) (← links)
• An adaptive heuristic for feature selection based on complementarity (Q1722737) (← links)
• Asymptotic analysis of Bayesian generalization error with Newton diagram (Q1784534) (← links)
• Information theory and superefficiency (Q1807151) (← links)
• Suboptimal measures of predictive complexity for absolute loss function (Q1854535) (← links)
• Twenty-one ML estimators for model selection (Q1902566) (← links)
• Ockham's razor in interval identification (Q1904305) (← links)
• A network of autoregressive processing units for time series modeling (Q1914640) (← links)
• Akaike's information criterion and recent developments in information complexity (Q1977905) (← links)
• The importance of complexity in model selection (Q1977911) (← links)
• A latent class MDS model with spatial constraints for non-stationary spatial covariance estimation (Q2001947) (← links)
• Price probabilities: a class of Bayesian and non-Bayesian prediction rules (Q2059056) (← links)