Jorma Rissanen

  • IBM
  • Tampere University of Technology, Finland

According to our database1, Jorma Rissanen authored at least 69 papers between 1963 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.


IEEE Fellow

IEEE Fellow 1997, "".



In proceedings 
PhD thesis 


Online presence:



Optimal Estimation.
Proceedings of the Discovery Science - 14th International Conference, 2011

Minimum Description Length Principle.
Proceedings of the Encyclopedia of Machine Learning, 2010

Model selection by sequentially normalized least squares.
J. Multivar. Anal., 2010

MDL denoising revisited.
IEEE Trans. Signal Process., 2009

Minimum description length.
Scholarpedia, 2008

Optimal estimation of families of models.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

DNA sequence compression - Based on the normalized maximum likelihood model.
IEEE Signal Process. Mag., 2007

Information Theoretic Methods for Bioinformatics.
EURASIP J. Bioinform. Syst. Biol., 2007

Normalized maximum likelihood models for genomics.
Proceedings of the 9th International Symposium on Signal Processing and Its Applications, 2007

Nonlinear modeling of protein expressions in protein arrays.
IEEE Trans. Signal Process., 2006

Minimum Description Length Denoising With Histogram Models.
IEEE Trans. Signal Process., 2006

The Structure Function and Distinguishable Models of Data.
Comput. J., 2006

Information and Complexity in Statistical Modeling.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Lossless Data Compression Using Optimal Tree Machines.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Algorithms for Constructing Min-Max Partitions of the Parameter Space for MDL Inference.
Proceedings of the Structural, 2004

Complexity of simple nonlogarithmic loss functions.
IEEE Trans. Inf. Theory, 2003

Classification and feature gene selection using the normalized maximum likelihood model for discrete regression.
Signal Process., 2003

Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions.
IEEE Commun. Lett., 2003

DNA sequence compression using the normalized maximum likelihood model for discrete regression .
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Efficient Computing of Stochastic Complexity.
Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, 2003

Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources.
IEEE Trans. Inf. Theory, 2002

Kolmogorov's structure function for probability models.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

A classifier based on normalized maximum likelihood model for classes of Boolean regression models.
Proceedings of the 11th European Signal Processing Conference, 2002

Strong optimality of the normalized ML models as universal codes and information in data.
IEEE Trans. Inf. Theory, 2001

MDL Denoising.
IEEE Trans. Inf. Theory, 2000

MDL based digital signal segmentation.
Proceedings of the 10th European Signal Processing Conference, 2000

Text Compression Based on Variable-to-Fixed Codes for Markov Sources.
Proceedings of the Data Compression Conference, 2000

Fast Universal Coding With Context Models.
IEEE Trans. Inf. Theory, 1999

Comput. J., 1999

Discussion of Paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe.
Comput. J., 1999

Hypothesis Selection and Testing by the MDL Principle.
Comput. J., 1999

Stochastic Complexity in Statistical Inquiry
World Scientific Series in Computer Science 15, World Scientific, ISBN: 978-981-4507-40-0, 1998

The Minimum Description Length Principle in Coding and Modeling.
IEEE Trans. Inf. Theory, 1998

Stochastic Complexity in Learning.
J. Comput. Syst. Sci., 1997

Adaptive L-Predictors Based on Finite State Machine Context Selection.
Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

Fisher information and stochastic complexity.
IEEE Trans. Inf. Theory, 1996

Partially hidden Markov models.
IEEE Trans. Inf. Theory, 1996

Applications of universal context modeling to lossless compression of gray-scale images.
IEEE Trans. Image Process., 1996

SLIQ: A Fast Scalable Classifier for Data Mining.
Proceedings of the Advances in Database Technology, 1996

A universal finite memory source.
IEEE Trans. Inf. Theory, 1995

MDL-Based Decision Tree Pruning.
Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD-95), 1995

Coding with Partially Hidden Markov Models.
Proceedings of the IEEE Data Compression Conference, 1995

Density estimation by stochastic complexity.
IEEE Trans. Inf. Theory, 1992

Language acquisition in the MDL framework.
Proceedings of the Language Computations, 1992

A multiplication-free multialphabet arithmetic code.
IEEE Trans. Commun., 1989

Measures of mutual and causal dependence between two time series.
IEEE Trans. Inf. Theory, 1987

Complexity of strings in the class of Markov sources.
IEEE Trans. Inf. Theory, 1986

Parameter Reduction and Context Selection for Compression of Gray-Scale Images.
IBM J. Res. Dev., 1985

Universal coding, information, prediction, and estimation.
IEEE Trans. Inf. Theory, 1984

A universal data compression system.
IEEE Trans. Inf. Theory, 1983

Correction to 'A simple general binary source code' (Sep 82 800-803).
IEEE Trans. Inf. Theory, 1983

A Double-Adaptive File Compression Algorithm.
IEEE Trans. Commun., 1983

Tight lower bounds for optimum code length.
IEEE Trans. Inf. Theory, 1982

A simple general binary source code.
IEEE Trans. Inf. Theory, 1982

On Equivalences of Database Schemes.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

Universal modeling and coding.
IEEE Trans. Inf. Theory, 1981

Compression of Black-White Images with Arithmetic Coding.
IEEE Trans. Commun., 1981

Arithmetic Coding.
IBM J. Res. Dev., 1979

Minimax codes for finite alphabets (Corresp.).
IEEE Trans. Inf. Theory, 1978

Modeling by shortest data description.
Autom., 1978

Theory of Relations for Databases - A Tutorial Survey.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

Independent Components of Relations.
ACM Trans. Database Syst., 1977

Generalized Kraft Inequality and Arithmetic Coding.
IBM J. Res. Dev., 1976

Maximum likelihood estimation of parameters in multivariate Gaussian stochastic processes (Corresp.).
IEEE Trans. Inf. Theory, 1974

Basis of invariants and canonical forms for linear dynamic systems.
Autom., 1974

Duals of input/output maps.
Proceedings of the Category Theory Applied to Computation and Control, 1974

Bounds for Weight Balanced Trees.
IBM J. Res. Dev., 1973

Properties of infinite covariance matrices and stability of optimum predictors.
Inf. Sci., 1969

On the theory of self-adjusting models.
Autom., 1963