default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJorma Rissanen
Person information
- affiliation: IBM
- affiliation: Tampere University of Technology, Finland
- award (1993): IEEE Richard W. Hamming Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c22]Jorma Rissanen:
Optimal Estimation. ALT 2011: 37- [c21]Jorma Rissanen:
Optimal Estimation. Discovery Science 2011: 30 - 2010
- [j47]Jorma Rissanen, Teemu Roos
, Petri Myllymäki:
Model selection by sequentially normalized least squares. J. Multivar. Anal. 101(4): 839-849 (2010) - [r1]Jorma Rissanen:
Minimum Description Length Principle. Encyclopedia of Machine Learning 2010: 666-668
2000 – 2009
- 2009
- [j46]Teemu Roos, Petri Myllymäki, Jorma Rissanen:
MDL denoising revisited. IEEE Trans. Signal Process. 57(9): 3347-3360 (2009) - 2008
- [j45]Jorma Rissanen:
Minimum description length. Scholarpedia 3(8): 6727 (2008) - [c20]Jorma Rissanen:
Optimal estimation of families of models. ITW 2008: 258 - 2007
- [j44]Jorma Rissanen, Peter D. Grünwald, Jukka Heikkonen, Petri Myllymäki, Teemu Roos, Juho Rousu:
Information Theoretic Methods for Bioinformatics. EURASIP J. Bioinform. Syst. Biol. 2007 (2007) - [j43]Gergely Korodi, Ioan Tabus, Jorma Rissanen, Jaakko Astola:
DNA sequence compression - Based on the normalized maximum likelihood model. IEEE Signal Process. Mag. 24(1): 47-53 (2007) - [c19]Ioan Tabus, Jorma Rissanen, Jaakko Astola:
Normalized maximum likelihood models for genomics. ISSPA 2007: 1-6 - 2006
- [j42]Jorma Rissanen:
The Structure Function and Distinguishable Models of Data. Comput. J. 49(6): 657-664 (2006) - [j41]Ioan Tabus, Andrea Hategan, Cristian Mircean, Jorma Rissanen, Ilya Shmulevich, Wei Zhang, Jaakko Astola:
Nonlinear modeling of protein expressions in protein arrays. IEEE Trans. Signal Process. 54(6-2): 2394-2407 (2006) - [j40]Vibhor Kumar, Jukka Heikkonen, Jorma Rissanen, Kimmo Kaski:
Minimum Description Length Denoising With Histogram Models. IEEE Trans. Signal Process. 54(8): 2922-2928 (2006) - [c18]Jorma Rissanen:
Information and Complexity in Statistical Modeling. ITW 2006: 351 - [i1]Teemu Roos, Petri Myllymäki, Jorma Rissanen:
MDL Denoising Revisited. CoRR abs/cs/0609138 (2006) - 2005
- [c17]Gergely Korodi, Jorma Rissanen, Ioan Tabus:
Lossless Data Compression Using Optimal Tree Machines. DCC 2005: 348-357 - 2004
- [c16]Adriana Vasilache, Ioan Tabus, Jorma Rissanen:
Algorithms for Constructing Min-Max Partitions of the Parameter Space for MDL Inference. SSPR/SPR 2004: 930-938 - 2003
- [j39]Boris Ryabko, Jorma Rissanen:
Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions. IEEE Commun. Lett. 7(1): 33-35 (2003) - [j38]Ioan Tabus, Jorma Rissanen, Jaakko Astola:
Classification and feature gene selection using the normalized maximum likelihood model for discrete regression. Signal Process. 83(4): 713-727 (2003) - [j37]Jorma Rissanen:
Complexity of simple nonlogarithmic loss functions. IEEE Trans. Inf. Theory 49(2): 476-484 (2003) - [c15]Petri Kontkanen, Wray L. Buntine, Petri Myllymäki, Jorma Rissanen, Henry Tirri:
Efficient Computing of Stochastic Complexity. AISTATS 2003: 171-178 - [c14]Ioan Tabus, Gergely Korodi, Jorma Rissanen:
DNA sequence compression using the normalized maximum likelihood model for discrete regression . DCC 2003: 253-262 - 2002
- [j36]Ioan Tabus, Jorma Rissanen:
Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources. IEEE Trans. Inf. Theory 48(7): 2022-2035 (2002) - [c13]Ioan Tabus, Jorma Rissanen, Jaakko Astola:
A classifier based on normalized maximum likelihood model for classes of Boolean regression models. EUSIPCO 2002: 1-4 - [c12]Jorma Rissanen:
Kolmogorov's structure function for probability models. ITW 2002: 98-99 - 2001
- [j35]Jorma Rissanen:
Strong optimality of the normalized ML models as universal codes and information in data. IEEE Trans. Inf. Theory 47(5): 1712-1717 (2001) - 2000
- [j34]Jorma Rissanen:
MDL Denoising. IEEE Trans. Inf. Theory 46(7): 2537-2543 (2000) - [c11]Ioan Tabus, Gergely Korodi, Jorma Rissanen:
Text Compression Based on Variable-to-Fixed Codes for Markov Sources. Data Compression Conference 2000: 133-142 - [c10]Ciprian Doru Giurcaneanu, Ioan Tabus, Jorma Rissanen:
MDL based digital signal segmentation. EUSIPCO 2000: 1-4
1990 – 1999
- 1999
- [j33]Jorma Rissanen:
Hypothesis Selection and Testing by the MDL Principle. Comput. J. 42(4): 260-269 (1999) - [j32]Jorma Rissanen:
Discussion of Paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe. Comput. J. 42(4): 327-329 (1999) - [j31]Jorma Rissanen:
Rejoinder. Comput. J. 42(4): 343-344 (1999) - [j30]Jorma Rissanen:
Fast Universal Coding With Context Models. IEEE Trans. Inf. Theory 45(4): 1065-1071 (1999) - 1998
- [b1]Jorma Rissanen:
Stochastic Complexity in Statistical Inquiry. World Scientific Series in Computer Science 15, World Scientific 1998, ISBN 978-981-4507-40-0, pp. 1-188 - [j29]Andrew R. Barron, Jorma Rissanen, Bin Yu:
The Minimum Description Length Principle in Coding and Modeling. IEEE Trans. Inf. Theory 44(6): 2743-2760 (1998) - 1997
- [j28]Jorma Rissanen:
Stochastic Complexity in Learning. J. Comput. Syst. Sci. 55(1): 89-95 (1997) - [c9]Ioan Tabus, Jorma Rissanen, Jaakko Astola:
Adaptive L-Predictors Based on Finite State Machine Context Selection. ICIP (1) 1997: 401-404 - 1996
- [j27]Marcelo J. Weinberger, Jorma Rissanen, Ronald Arps:
Applications of universal context modeling to lossless compression of gray-scale images. IEEE Trans. Image Process. 5(4): 575-586 (1996) - [j26]Jorma Rissanen:
Fisher information and stochastic complexity. IEEE Trans. Inf. Theory 42(1): 40-47 (1996) - [j25]Søren Forchhammer, Jorma Rissanen:
Partially hidden Markov models. IEEE Trans. Inf. Theory 42(4): 1253-1256 (1996) - [c8]Manish Mehta, Rakesh Agrawal, Jorma Rissanen:
SLIQ: A Fast Scalable Classifier for Data Mining. EDBT 1996: 18-32 - 1995
- [j24]Marcelo J. Weinberger, Jorma Rissanen, Meir Feder:
A universal finite memory source. IEEE Trans. Inf. Theory 41(3): 643-652 (1995) - [c7]Søren Forchhammer, Jorma Rissanen:
Coding with Partially Hidden Markov Models. Data Compression Conference 1995: 92-101 - [c6]Jorma Rissanen:
Stochastic complexity in learning. EuroCOLT 1995: 196-210 - [c5]Manish Mehta, Jorma Rissanen, Rakesh Agrawal:
MDL-Based Decision Tree Pruning. KDD 1995: 216-221 - 1992
- [j23]Jorma Rissanen, Terry P. Speed, Bin Yu:
Density estimation by stochastic complexity. IEEE Trans. Inf. Theory 38(2): 315-323 (1992) - [c4]Jorma Rissanen, Eric Sven Ristad:
Language acquisition in the MDL framework. Language Computations 1992: 149-166
1980 – 1989
- 1989
- [j22]Jorma Rissanen, Kottappuram Mohammed Mohiuddin:
A multiplication-free multialphabet arithmetic code. IEEE Trans. Commun. 37(2): 93-98 (1989) - 1987
- [j21]Jorma Rissanen, Mati Wax:
Measures of mutual and causal dependence between two time series. IEEE Trans. Inf. Theory 33(4): 598-601 (1987) - 1986
- [j20]Jorma Rissanen:
Complexity of strings in the class of Markov sources. IEEE Trans. Inf. Theory 32(4): 526-532 (1986) - 1985
- [j19]Stephen Todd, Glen G. Langdon Jr., Jorma Rissanen:
Parameter Reduction and Context Selection for Compression of Gray-Scale Images. IBM J. Res. Dev. 29(2): 188-193 (1985) - 1984
- [j18]Jorma Rissanen:
Universal coding, information, prediction, and estimation. IEEE Trans. Inf. Theory 30(4): 629-636 (1984) - 1983
- [j17]Glen G. Langdon Jr., Jorma Rissanen:
A Double-Adaptive File Compression Algorithm. IEEE Trans. Commun. 31(11): 1253-1255 (1983) - [j16]Jorma Rissanen:
A universal data compression system. IEEE Trans. Inf. Theory 29(5): 656-663 (1983) - [j15]Glen G. Langdon Jr., Jorma Rissanen:
Correction to 'A simple general binary source code' (Sep 82 800-803). IEEE Trans. Inf. Theory 29(5): 778-779 (1983) - 1982
- [j14]Jorma Rissanen:
Tight lower bounds for optimum code length. IEEE Trans. Inf. Theory 28(2): 348-349 (1982) - [j13]Glen G. Langdon Jr., Jorma Rissanen:
A simple general binary source code. IEEE Trans. Inf. Theory 28(5): 800-803 (1982) - [c3]Jorma Rissanen:
On Equivalences of Database Schemes. PODS 1982: 23-26 - 1981
- [j12]Glen G. Langdon Jr., Jorma Rissanen:
Compression of Black-White Images with Arithmetic Coding. IEEE Trans. Commun. 29(6): 858-867 (1981) - [j11]Jorma Rissanen, Glen G. Langdon Jr.:
Universal modeling and coding. IEEE Trans. Inf. Theory 27(1): 12-22 (1981)
1970 – 1979
- 1979
- [j10]Jorma Rissanen, Glen G. Langdon Jr.:
Arithmetic Coding. IBM J. Res. Dev. 23(2): 149-162 (1979) - 1978
- [j9]Jorma Rissanen:
Modeling by shortest data description. Autom. 14(5): 465-471 (1978) - [j8]Jorma Rissanen:
Minimax codes for finite alphabets (Corresp.). IEEE Trans. Inf. Theory 24(3): 389-392 (1978) - [c2]Jorma Rissanen:
Theory of Relations for Databases - A Tutorial Survey. MFCS 1978: 536-551 - 1977
- [j7]Jorma Rissanen:
Independent Components of Relations. ACM Trans. Database Syst. 2(4): 317-325 (1977) - 1976
- [j6]Jorma Rissanen:
Generalized Kraft Inequality and Arithmetic Coding. IBM J. Res. Dev. 20(3): 198-203 (1976) - 1974
- [j5]Jorma Rissanen:
Basis of invariants and canonical forms for linear dynamic systems. Autom. 10(2): 175-182 (1974) - [j4]Peter E. Caines, Jorma Rissanen:
Maximum likelihood estimation of parameters in multivariate Gaussian stochastic processes (Corresp.). IEEE Trans. Inf. Theory 20(1): 102-104 (1974) - [c1]Jorma Rissanen, Bostwick F. Wyman:
Duals of input/output maps. Category Theory Applied to Computation and Control 1974: 204-208 - 1973
- [j3]Jorma Rissanen:
Bounds for Weight Balanced Trees. IBM J. Res. Dev. 17(2): 101-105 (1973)
1960 – 1969
- 1969
- [j2]Jorma Rissanen, L. Barbosa:
Properties of infinite covariance matrices and stability of optimum predictors. Inf. Sci. 1(3): 221-236 (1969) - 1963
- [j1]Jorma Rissanen:
On the theory of self-adjusting models. Autom. 1(4): 297-309 (1963)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
