Pages that link to "Item:Q4879988"

The following pages link to Fisher information and stochastic complexity (Q4879988):

Displaying 50 items.

• Information optimality and Bayesian modelling (Q280206) (← links)
• Bayes factors, relations to minimum description length, and overlapping model classes (Q296927) (← links)
• Thou shalt identify! The identifiability of two high-threshold models in confidence-rating recognition (and super-recognition) paradigms (Q313070) (← links)
• Metabolic cost of neuronal information in an empirical stimulus-response model (Q353894) (← links)
• The effect of interspike interval statistics on the information gain under the rate coding hypothesis (Q395709) (← links)
• Model-based multidimensional clustering of categorical data (Q420818) (← links)
• Jeffreys versus Shtarkov distributions associated with some natural exponential families (Q537447) (← links)
• Variable selection in linear regression: several approaches based on normalized maximum likelihood (Q553666) (← links)
• Statistical complexity and Fisher-Shannon information measure of \(H^{+}_{2}\) (Q637279) (← links)
• Learning genetic population structures using minimization of stochastic complexity (Q653380) (← links)
• The flexibility of models of recognition memory: an analysis by the minimum-description length principle (Q654392) (← links)
• Clustgrams: an extension to histogram densities based on the minimum description length principle (Q692998) (← links)
• Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy (Q734517) (← links)
• Application of the evidence procedure to the estimation of wireless channels (Q836496) (← links)
• Application of the Fisher-Rao metric to structure detection (Q851812) (← links)
• Bayesian model learning based on predictive entropy (Q853783) (← links)
• A methodology for developing Bayesian networks: an application to information technology (IT) implementation (Q858433) (← links)
• Testing order constraints: qualitative differences between Bayes factors and normalized maximum likelihood (Q894591) (← links)
• The flexibility of models of recognition memory: the case of confidence ratings (Q899141) (← links)
• Consistency of discrete Bayesian learning (Q950201) (← links)
• On the minimum description length complexity of multinomial processing tree models (Q979181) (← links)
• Minimum message length shrinkage estimation (Q1017808) (← links)
• On some properties of the NML estimator for Bernoulli strings (Q1029082) (← links)
• Failure-time prediction (Q1298697) (← links)
• Stochastic complexity and model selection from incomplete data (Q1298904) (← links)
• On model selection via stochastic complexity in robust linear regression (Q1299010) (← links)
• Stochastic complexity in learning (Q1370860) (← links)
• Predicting a binary sequence almost as well as the optimal biased coin (Q1398365) (← links)
• Scalability of the Bayesian optimization algorithm. (Q1399504) (← links)
• Regarding the complexity of additive clustering models: comment on Lee (2001). (Q1404958) (← links)
• The generalized universal law of generalization. (Q1404969) (← links)
• Assessing model mimicry using the parametric bootstrap. (Q1431814) (← links)
• Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy (Q1602623) (← links)
• Law of iterated logarithm and consistent model selection criterion in logistic regression (Q1612976) (← links)
• High-dimensional penalty selection via minimum description length principle (Q1631787) (← links)
• Using the Bayesian Shtarkov solution for predictions (Q1658740) (← links)
• On model selection, Bayesian networks, and the Fisher information integral (Q1670496) (← links)
• A tutorial on Fisher information (Q1680996) (← links)
• Chentsov's theorem for exponential families (Q1713653) (← links)
• Ensuring privacy with constrained additive noise by minimizing Fisher information (Q1716667) (← links)
• Hierarchical two-part MDL code for multinomial distributions (Q1726276) (← links)
• A lower bound on compression of unknown alphabets (Q1770393) (← links)
• A Bayesian analysis of retention functions (Q1775814) (← links)
• On discriminative Bayesian network classifiers and logistic regression (Q1778143) (← links)
• Minimum message length inference of the Poisson and geometric models using heavy-tailed prior distributions (Q1799691) (← links)
• Spatial sampling design based on stochastic complexity. (Q1808839) (← links)
• A network of autoregressive processing units for time series modeling (Q1914640) (← links)
• Test for homogeneity of several populations by stochastic complexity (Q1923433) (← links)
• Prediction in several conventional contexts (Q1951650) (← links)
• Model selection based on minimum description length (Q1977908) (← links)