Pages that link to "Item:Q4528251"

The following pages link to Counting probability distributions: Differential geometry and model selection (Q4528251):

Displaying 31 items.

• Information geometric complexity of a trivariate Gaussian statistical model (Q296465) (← links)
• Prototypes, exemplars and the response scaling parameter: a Bayes factor perspective (Q296949) (← links)
• A tutorial on Bayes factor estimation with the product space method (Q645486) (← links)
• The flexibility of models of recognition memory: an analysis by the minimum-description length principle (Q654392) (← links)
• Application of the Fisher-Rao metric to structure detection (Q851812) (← links)
• Computational analysis of CFSE proliferation assay (Q883800) (← links)
• The flexibility of models of recognition memory: the case of confidence ratings (Q899141) (← links)
• Avoiding the dangers of averaging across subjects when using multidimensional scaling. (Q1398360) (← links)
• Regarding the complexity of additive clustering models: comment on Lee (2001). (Q1404958) (← links)
• The generalized universal law of generalization. (Q1404969) (← links)
• A tutorial on Fisher information (Q1680996) (← links)
• A Bayesian analysis of retention functions (Q1775814) (← links)
• Least informative distributions in maximum \(q\)-log-likelihood estimation (Q2153174) (← links)
• State trace analysis: what it can and cannot do (Q2154155) (← links)
• On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model (Q2320933) (← links)
• An empirical study of minimum description length model selection with infinite parametric complexity (Q2507908) (← links)
• Bayes factors: Prior sensitivity and model generalizability (Q2519503) (← links)
• The Fisher-Rao metric for projective transformations of the line (Q2577834) (← links)
• On sampling and modeling complex systems (Q3301678) (← links)
• Information geometric analysis of phase transitions in complex patterns: the case of the Gray-Scott reaction–diffusion model (Q3302611) (← links)
• Sparse model selection in the highly under-sampled regime (Q3302832) (← links)
• Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach (Q3536225) (← links)
• A Note on the Applied Use of MDL Approximations (Q4823699) (← links)
• Maximal relevance and optimal learning machines (Q4992314) (← links)
• Minimum description length revisited (Q4997077) (← links)
• Regularized Aggregation of One-Off Probability Predictions (Q5060523) (← links)
• On the Complexity of Logistic Regression Models (Q5214359) (← links)
• Theoretical investigations of an information geometric approach to complexity (Q5370836) (← links)
• Length of the state trace: a method for partitioning model complexity (Q6160820) (← links)
• A simple probabilistic neural network for machine understanding (Q6625319) (← links)
• Complexity of quantum-mechanical evolutions from probability amplitudes (Q6670830) (← links)