 From Marginals to Array Structure with the Shuttle AlgorithmLucia Buzzigoli and Antonio Giusti MPRA Paper from University Library of Munich, Germany Abstract: In many statistical problems there is the need to analyze the structure of an unknown n-dimensional array given its marginal distributions. The usual method utilized to solve the problem is linear programming, which involves a large amount of computational time when the original array is large. Alternative solutions have been proposed in the literature, especially to find less time consuming algorithms. One of these is the shuttle algorithm introduced by Buzzigoli and Giusti [1] to calculate lower and upper bounds of the elements of an n-way array, starting from the complete set of its (n-1)-way marginals. The proposed algorithm, very easy to implement with a matrix language, shows interesting properties and possibilities of application. The paper presents the algorithm, analyses its properties and describes its disadvantages. It also suggests possible applications in some statistical fields and, in particular, in Symbolic Data Analysis and, finally, shows the results of some simulations on randomly generated arrays. Keywords: Shuttle algorithm; Linear programming; Statistical disclosure control; Linked tables; Zero restrictions (search for similar items in EconPapers) Published in Journal of Symbolic Data Analysis number 1.4(2006): pp. 1-14 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:49245 Access Statistics for this paper More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.