J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On Universal Simulation of Information Sources Using Training .. - Merhav, Weinberger (2002) (1 citation) (Correct)
.... in Appendix A that for any P 2 P, nH E flog jT X n jg = H(TX n ) log(2 n) log e 1 2 log[det M( o(1) 14) Thus, the price of universality is dominated by the term log n, which for the case d = d parallels the universal lossless source coding problem (see, e.g. [13]) In particular, for the entire class of DMSs with positive probabilities, the asymptotic expansion (14) can alternatively be obtained from Stirling s formula. To evaluate the lower bound of Theorem 1 for a nite value of R, we need to evaluate the expression n j (15) 14 where ....
J. Rissanen, \Universal coding, information, prediction, and estimation," IEEE Transactions on Information Theory , vol. IT{30, no. 4, pp. 629-636, July 1984.
Markovian Architectural Bias of Recurrent Neural Networks - Tino, Cernansky, Benuskova (2002) (6 citations) (Correct)
.... context w with a 2 A, if the KullbackLeibler divergence between the next symbol distributions for the candidate prediction contexts w and aw, weighted by the prior distribution of the extended context aw, exceeds a given threshold [19] 21] For other variants of decision criteria see [20] [22] [23] A natural representation of the set of prediction contexts, together with the associated next symbol probabilities, has the form of a prediction sux tree (PST) 20] 24] The edges of PST are labeled by symbols from A. From every internal node there is at most one outgoing edge labeled by ....
M.J. Weinberger, J.J. Rissanen, and M. Feder, \A universal nite memory source," IEEE Transactions on Information Theory, vol. 41, no. 3, pp. 643-652, 1995.
Compressing Integers for Fast File Access - Williams, Zobel (1999) (5 citations) (Correct)
....representations improve data throughput compared to storing data using standard four byte integers. Our conclusion is that, for fast access to files containing integers, they should be stored in a compressed format. 2. BACKGROUND Compression consists of two activities, modelling and coding [4]. A model for data to be compressed is a representation of the distinct symbols in the data and includes information such as frequency about each symbol. Coding is the process of producing a compressed representation of data, using the model to determine a code for each symbol. An e#cient coding ....
J. Rissanen and G.G. Langdon. Universal modeling and coding. IEEE Transactions on Information Theory, IT-27(1):12--23, January 1981.
Analyzing the Stochastic Complexity via Tree Polynomials - Kontkanen, Myllymäki (2005) Self-citation (Stochastic) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
On the Accuracy of Stochastic Complexity Approximations - Kontkanen, Myllymäki.. (1999) Self-citation (Stochastic) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
fMRI data analysis: statistics, information and dynamics - Thirion (2003) Self-citation (Information) (Correct)
No context found.
Jorma Rissanen. Universal coding, information, prediction, and estimation. IEEE Transactions on Information Theory, 30(4):629-636, July 1984.
Optimal Alphabet Partitioning for Semi-Adaptive Coding of .. - Chen, Chiang, Memon, Wu (2003) (1 citation) Self-citation (Information) (Correct)
No context found.
J. J. Rissanen. Universal coding, information, prediction and estimation. IEEE Transactions on Information Theory, 30:629-636, 1984.
Text Classification Using ESC-based Stochastic Decision Lists - Li, Yamanishi (2002) (3 citations) Self-citation (Stochastic) (Correct)
....of the Minimum ESC principle. In this paper, we describe our method only for the case in which there are two categories: positive and negative. It is a relatively straightforward process, however, to extend the method to the case for which there are more than two categories. 3. 2 SC and ESC SC [19] is a measure of the amount of information included in a given data sequence x m relative to a fixed probability model The MDL (Minimum Description Length) principle is a model selection criterion which asserts that, for a given data sequence x m, the lower a model s SC(x ) value is , the greater ....
....that, for a given data sequence x m, the lower a model s SC(x ) value is , the greater its likelihood of being a model which would actually generate x . SC(x ) can be interpreted as the least code length (also referred to as description length) required to encode x with the help of the model (cf. [19]) In terms of statistical decision theory, SC is defined under the assumption that the model takes the form of a probability distribution and the logarithmic loss function is used as a loss function to measure the distortion that resulted from predicting the data using the model. Yamanishi has ....
[Article contains additional citation context not shown here]
Jorma Rissanen. Fisher information and stochastic complexity. IEEE Transaction on Information Theory, 42(1):40-47, 1996.
Information-Theoretically Optimal Histogram Density Estimation - Kontkanen, Myllymäki (2006) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
Topics in Probabilistic Location Estimation in.. - Kontkanen.. (2004) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
Computing the Regret Table for Multinomial Data - Kontkanen, Myllymäki (2005) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
A Fast Normalized Maximum Likelihood Algorithm for.. - Kontkanen, Myllymäki (2005) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
Topics In Probabilistic Location Estimation In.. - Kontkanen.. (2004) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
Learning Markov chains with variable memory length from noisy.. - Angluin, Csürös (1997) (Correct)
No context found.
M. J. Weinberger, J. J. Rissanen, M. Feder. A universal finite memory source. IEEE Transactions on Information Theory, IT-41:643--652, 1995.
The Subspace Information Criterion for Infinite Dimensional.. - Sugiyama, al. (2002) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, IT-42(1):40--47, 1996.
Statistical Models for Term Compression - James Cheney Cornell (2000) (4 citations) (Correct)
No context found.
J. Rissanen and G. G. Langdon, Jr. Universal modeling and coding. IEEE Transactions on Information Theory, IT-27(1):12--23, January 1981.
Bioinformatics - Vol No Pages (2005) (Correct)
No context found.
Rissanen,J. MDL denoising. IEEE Transactions on Information Theory, 46(7):2537--2543, November 2000.
An Invariant Bayesian Model Selection Principle for Gaussian.. - Fossgaard (2004) (Correct)
No context found.
J. Rissanen, Fisher information and stochastic complexity, IEEE Transactions on Information Theory 42 (1996), no. 1, 40--47.
Automatic Reassembly of Document Fragments via Context.. - Shanmugasundaram, Memon (2003) (Correct)
No context found.
J. J. Rissanen and G. G. Langdon. Universal modelling and coding. IEEE Transactions on Information Theory, 1981.
Automatic Reassembly of Document Fragments via Context.. - Shanmugasundaram, Memon (2003) (Correct)
No context found.
J. J. Rissanen. A universal data compression system. IEEE Transactions on Information Theory, 29(5):656--664, 1983.
Statistical Models for Term Compression - Cheney (2000) (4 citations) (Correct)
No context found.
J. Rissanen and G. G. Langdon, Jr. Universal modeling and coding. IEEE Transactions on Information Theory, IT-27(1):12--23, January 1981.
A Comparison of Non-Informative Priors for Bayesian.. - Kontkanen, Myllymäki.. (1998) (1 citation) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
Fast Prefix Code Processing - Pajarola (2003) (Correct)
No context found.
Jorma Rissanen. A universal data compression system. IEEE Transactions on Information Theory, 29(5):656--664, September 1983.
Can We Learn to Beat the Best Stock - Borodin, El-Yaniv, Gogan (2003) (Correct)
No context found.
J. Rissanen. A universal data compression system. IEEE Transactions on Information Theory, 29:656--664, 1983.
B-Course: A Web-Based Tool For Bayesian And Causal.. - Myllymäki, Silander.. (2002) (Correct)
No context found.
J. Rissanen. Fisher information and stochastic complexity. IEEE Transactions on Information Theory, 42(1):40--47, January 1996.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC