Jorma Rissanen

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Optimal Estimation.

Jorma Rissanen

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

2010

Minimum Description Length Principle.

Jorma Rissanen

Proceedings of the Encyclopedia of Machine Learning, 2010

Model selection by sequentially normalized least squares.

Jorma Rissanen, Teemu Roos, Petri Myllymäki

J. Multivar. Anal., 2010

2009

MDL denoising revisited.

Teemu Roos, Petri Myllymäki, Jorma Rissanen

IEEE Trans. Signal Process., 2009

2008

Minimum description length.

Jorma Rissanen

Scholarpedia, 2008

Optimal estimation of families of models.

Jorma Rissanen

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

2007

DNA sequence compression - Based on the normalized maximum likelihood model.

Gergely Korodi, Ioan Tabus, Jorma Rissanen, Jaakko Astola

IEEE Signal Process. Mag., 2007

Information Theoretic Methods for Bioinformatics.

Jorma Rissanen, Peter D. Grünwald, Jukka Heikkonen, Petri Myllymäki, Teemu Roos, Juho Rousu

EURASIP J. Bioinform. Syst. Biol., 2007

Normalized maximum likelihood models for genomics.

Ioan Tabus, Jorma Rissanen, Jaakko Astola

Proceedings of the 9th International Symposium on Signal Processing and Its Applications, 2007

2006

Nonlinear modeling of protein expressions in protein arrays.

Ioan Tabus, Andrea Hategan, Cristian Mircean, Jorma Rissanen, Ilya Shmulevich, Wei Zhang, Jaakko Astola

IEEE Trans. Signal Process., 2006

Minimum Description Length Denoising With Histogram Models.

Vibhor Kumar, Jukka Heikkonen, Jorma Rissanen, Kimmo Kaski

IEEE Trans. Signal Process., 2006

The Structure Function and Distinguishable Models of Data.

Jorma Rissanen

Comput. J., 2006

Information and Complexity in Statistical Modeling.

Jorma Rissanen

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2005

Lossless Data Compression Using Optimal Tree Machines.

Gergely Korodi, Jorma Rissanen, Ioan Tabus

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004

Algorithms for Constructing Min-Max Partitions of the Parameter Space for MDL Inference.

Adriana Vasilache, Ioan Tabus, Jorma Rissanen

Proceedings of the Structural, 2004

2003

Complexity of simple nonlogarithmic loss functions.

Jorma Rissanen

IEEE Trans. Inf. Theory, 2003

Classification and feature gene selection using the normalized maximum likelihood model for discrete regression.

Ioan Tabus, Jorma Rissanen, Jaakko Astola

Signal Process., 2003

Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions.

Boris Ryabko, Jorma Rissanen

IEEE Commun. Lett., 2003

DNA sequence compression using the normalized maximum likelihood model for discrete regression .

Ioan Tabus, Gergely Korodi, Jorma Rissanen

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

Efficient Computing of Stochastic Complexity.

Petri Kontkanen, Wray L. Buntine, Petri Myllymäki, Jorma Rissanen, Henry Tirri

Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, 2003

2002

Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources.

Ioan Tabus, Jorma Rissanen

IEEE Trans. Inf. Theory, 2002

Kolmogorov's structure function for probability models.

Jorma Rissanen

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

A classifier based on normalized maximum likelihood model for classes of Boolean regression models.

Ioan Tabus, Jorma Rissanen, Jaakko Astola

Proceedings of the 11th European Signal Processing Conference, 2002

2001

Strong optimality of the normalized ML models as universal codes and information in data.

Jorma Rissanen

IEEE Trans. Inf. Theory, 2001

2000

MDL Denoising.

Jorma Rissanen

IEEE Trans. Inf. Theory, 2000

MDL based digital signal segmentation.

Ciprian Doru Giurcaneanu, Ioan Tabus, Jorma Rissanen

Proceedings of the 10th European Signal Processing Conference, 2000

Text Compression Based on Variable-to-Fixed Codes for Markov Sources.

Ioan Tabus, Gergely Korodi, Jorma Rissanen

Proceedings of the Data Compression Conference, 2000

1999

Fast Universal Coding With Context Models.

Jorma Rissanen

IEEE Trans. Inf. Theory, 1999

Rejoinder.

Jorma Rissanen

Comput. J., 1999

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

Jorma Rissanen

Comput. J., 1999

Hypothesis Selection and Testing by the MDL Principle.

Jorma Rissanen

Comput. J., 1999

1998

Stochastic Complexity in Statistical Inquiry

Jorma Rissanen

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.

Andrew R. Barron, Jorma Rissanen, Bin Yu

IEEE Trans. Inf. Theory, 1998

1997

Stochastic Complexity in Learning.

Jorma Rissanen

J. Comput. Syst. Sci., 1997

Adaptive L-Predictors Based on Finite State Machine Context Selection.

Ioan Tabus, Jorma Rissanen, Jaakko Astola

Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

1996

Fisher information and stochastic complexity.

Jorma Rissanen

IEEE Trans. Inf. Theory, 1996

Partially hidden Markov models.

Søren Forchhammer, Jorma Rissanen

IEEE Trans. Inf. Theory, 1996

Applications of universal context modeling to lossless compression of gray-scale images.

Marcelo J. Weinberger, Jorma Rissanen, Ronald Arps

IEEE Trans. Image Process., 1996

SLIQ: A Fast Scalable Classifier for Data Mining.

Manish Mehta, Rakesh Agrawal, Jorma Rissanen

Proceedings of the Advances in Database Technology, 1996

1995

A universal finite memory source.

Marcelo J. Weinberger, Jorma Rissanen, Meir Feder

IEEE Trans. Inf. Theory, 1995

MDL-Based Decision Tree Pruning.

Manish Mehta, Jorma Rissanen, Rakesh Agrawal

Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD-95), 1995

Coding with Partially Hidden Markov Models.

Søren Forchhammer, Jorma Rissanen

Proceedings of the IEEE Data Compression Conference, 1995

1992

Density estimation by stochastic complexity.

Jorma Rissanen, Terry P. Speed, Bin Yu

IEEE Trans. Inf. Theory, 1992

Language acquisition in the MDL framework.

Jorma Rissanen, Eric Sven Ristad

Proceedings of the Language Computations, 1992

1989

A multiplication-free multialphabet arithmetic code.

Jorma Rissanen, Kottappuram Mohammed Mohiuddin

IEEE Trans. Commun., 1989

1987

Measures of mutual and causal dependence between two time series.

Jorma Rissanen, Mati Wax

IEEE Trans. Inf. Theory, 1987

1986

Complexity of strings in the class of Markov sources.

Jorma Rissanen

IEEE Trans. Inf. Theory, 1986

1985

Parameter Reduction and Context Selection for Compression of Gray-Scale Images.

Stephen Todd, Glen G. Langdon Jr., Jorma Rissanen

IBM J. Res. Dev., 1985

1984

Universal coding, information, prediction, and estimation.

Jorma Rissanen

IEEE Trans. Inf. Theory, 1984

1983

A universal data compression system.

Jorma Rissanen

IEEE Trans. Inf. Theory, 1983

Correction to 'A simple general binary source code' (Sep 82 800-803).

Glen G. Langdon Jr., Jorma Rissanen

IEEE Trans. Inf. Theory, 1983

A Double-Adaptive File Compression Algorithm.

Glen G. Langdon Jr., Jorma Rissanen

IEEE Trans. Commun., 1983

1982

Tight lower bounds for optimum code length.

Jorma Rissanen

IEEE Trans. Inf. Theory, 1982

A simple general binary source code.

Glen G. Langdon Jr., Jorma Rissanen

IEEE Trans. Inf. Theory, 1982

On Equivalences of Database Schemes.

Jorma Rissanen

Proceedings of the ACM Symposium on Principles of Database Systems, 1982

1981

Universal modeling and coding.

Jorma Rissanen, Glen G. Langdon Jr.

IEEE Trans. Inf. Theory, 1981

Compression of Black-White Images with Arithmetic Coding.

Glen G. Langdon Jr., Jorma Rissanen

IEEE Trans. Commun., 1981

1979

Arithmetic Coding.

Jorma Rissanen, Glen G. Langdon Jr.

IBM J. Res. Dev., 1979

1978

Minimax codes for finite alphabets (Corresp.).

Jorma Rissanen

IEEE Trans. Inf. Theory, 1978

Modeling by shortest data description.

Jorma Rissanen

Autom., 1978

Theory of Relations for Databases - A Tutorial Survey.

Jorma Rissanen

Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977

Independent Components of Relations.

Jorma Rissanen

ACM Trans. Database Syst., 1977

1976

Generalized Kraft Inequality and Arithmetic Coding.

Jorma Rissanen

IBM J. Res. Dev., 1976

1974

Maximum likelihood estimation of parameters in multivariate Gaussian stochastic processes (Corresp.).

Peter E. Caines, Jorma Rissanen

IEEE Trans. Inf. Theory, 1974

Basis of invariants and canonical forms for linear dynamic systems.

Jorma Rissanen

Autom., 1974

Duals of input/output maps.

Jorma Rissanen, Bostwick F. Wyman

Proceedings of the Category Theory Applied to Computation and Control, 1974

1973

Bounds for Weight Balanced Trees.

Jorma Rissanen

IBM J. Res. Dev., 1973

1969

Properties of infinite covariance matrices and stability of optimum predictors.

Jorma Rissanen, L. Barbosa

Inf. Sci., 1969

1963

On the theory of self-adjusting models.

Jorma Rissanen

Autom., 1963