Accession Number:

ADP007103

Title:

Exploratory Graphical Techniques for Ranked Data,

Descriptive Note:

Corporate Author:

SOUTHERN METHODIST UNIV DALLAS TX

Personal Author(s):

• Thompson, Georgia L.

Report Date:

1992-01-01

Pagination or Media Count:

4.0

Abstract:

Graphical methods are critically needed to display frequency distributions for fully ranked data. Fully ranked data occur, for example, when judges are asked to rank n items, possibly with pseudoranks, in order of preference. Each observation is a permutation of the n distinct pseudoranks, and the resulting set of frequencies is a function on Sn, the symmetric group of n elements. Because Sn does not have a natural linear ordering, graphical methods such as histograms and bar graphs cannot be used to display frequency distributions for ranked data. Other existing graphical methods for rankings include multidimensional scaling, minimal spanning trees, and nearest neighbor graphs as discussed by Diaconis 1988. Cohen and Mallows 1980 propose graphical methods based on multi-dimensional scaling and biplots. Cohen 1990 presents alternate exploratory data techniques for ranked data.

Descriptors:

• *RANKING
• *GRAPHICS
• *DATA PROCESSING
• FREQUENCY
• FUNCTIONS
• GRAPHS
• HISTOGRAMS
• OBSERVATION
• PERMUTATIONS
• RANKING
• TREES

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE