A Gras Variant Solving For Minimum Information Loss
The fundamental idea in Junius and Oosterhaven (2003) is to break down the information contained in the a priori data into two parts: algebraic signs, and absolute values. This approach is well grounded in information theory, and provides a basis on which to solve the problem of adjusting matrices with negative entries. However, Junius and Oosterhaven (2003) have formulated a target function that is not equivalent to the Kullback and Leibler (1951) cross-entropy measure, and so is not a representation of the minimum information loss principle. Neither is the alternative target function proposed by Lenzen et al. (2007). This paper develops the exact Kullback and Leibler cross-entropy measure. In addition, following the constrained optimization approach, this paper applies the same principle to solve adjustment problems where row-sums, column-sums or both are constrained to zero.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 21 (2009)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/CESR20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/CESR20|
When requesting a correction, please mention this item's handle: RePEc:taf:ecsysr:v:21:y:2009:i:4:p:399-408. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If references are entirely missing, you can add them using this form.