The following pages link to Jorma Rissanen (Q947398):
Displaying 50 items.
- Classification and feature gene selection using the normalized maximum likelihood model for discrete regression (Q947399) (← links)
- A universal prior for integers and estimation by minimum description length (Q1050717) (← links)
- Stochastic complexity and modeling (Q1081991) (← links)
- Solution of linear equations with Hankel and Toeplitz matrices (Q2264401) (← links)
- Model selection by sequentially normalized least squares (Q2267585) (← links)
- Optimal estimation of parameters (Q2902189) (← links)
- Measures of mutual and causal dependence between two time series (Corresp.) (Q3030071) (← links)
- A Predictive Least-Squares Principle (Q3030695) (← links)
- Optimal Estimation (Q3093937) (← links)
- (Q3126568) (← links)
- (Q3425126) (← links)
- Model Selection and Testing by the MDL Principle (Q3613555) (← links)
- (Q3657269) (← links)
- Correction to 'A simple general binary source code' (Sep 82 800-803) (Q3659677) (← links)
- A Double-Adaptive File Compression Algorithm (Q3666749) (← links)
- A universal data compression system (Q3671882) (← links)
- Universal coding, information, prediction, and estimation (Q3692595) (← links)
- (Q3702336) (← links)
- (Q3738382) (← links)
- Complexity of strings in the class of Markov sources (Q3758710) (← links)
- (Q3800883) (← links)
- (Q3855094) (← links)
- Universal modeling and coding (Q3905196) (← links)
- Tight lower bounds for optimum code length (Corresp.) (Q3934287) (← links)
- A simple general binary source code (Corresp.) (Q3950453) (← links)
- Density estimation by stochastic complexity (Q3990767) (← links)
- (Q3995624) (← links)
- (Q4103416) (← links)
- Generalized Kraft Inequality and Arithmetic Coding (Q4108230) (← links)
- Minimax codes for finite alphabets (Corresp.) (Q4156299) (← links)
- (Q4168452) (← links)
- Arithmetic Coding (Q4190552) (← links)
- (Q4327319) (← links)
- Strong optimality of the normalized ML models as universal codes and information in data (Q4544616) (← links)
- MDL denoising (Q4545809) (← links)
- MDL Denoising Revisited (Q4569841) (← links)
- Nonlinear modeling of protein expressions in protein arrays (Q4588140) (← links)
- Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources (Q4674559) (← links)
- Complexity of simple nonlogarithmic loss functions (Q4679923) (← links)
- (Q4694334) (← links)
- The minimum description length principle in coding and modeling (Q4701208) (← links)
- Fast universal coding with context models (Q4701359) (← links)
- A universal finite memory source (Q4836891) (← links)
- Fisher information and stochastic complexity (Q4879988) (← links)
- Partially hidden Markov models (Q4885729) (← links)
- Discussion of paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe (Q4933952) (← links)
- Rejoinder (Q4933955) (← links)
- (Q5326958) (← links)
- (Q5455549) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466252) (← links)
