An Ordering Algorithm for Analysis of Data Arrays

Stephen B. Deutsch and John J. Martin
Additional contact information
Stephen B. Deutsch: Institute for Defense Analyses, Arlington, Virginia
John J. Martin: Office of Science and Technology, Executive Office of the President, Washington, D. C.

Operations Research, 1971, vol. 19, issue 6, 1350-1362

Abstract: This paper presents an algorithm for reordering data arrays. The object is to find a one-dimensional ordering of the rows and columns of an array, given no prior information other than the array itself. The algorithm is an iterative one, and, in finding what it considers to be the most satisfactory ordering of an array, it also enables one to determine immediately the most significant underlying variable. The algorithm has been applied to arrays representing data from a variety of fields; examples are presented of political and archaeological data that have been analyzed, and it is shown that meaningful relations can be found directly through use of the algorithm.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.6.1350 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:6:p:1350-1362

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().