Graphical Representation of Partially Ranked Data

Partially ranked data refers to the situation in which there are p distinct objects; however each judge specifies only first s (s < p) choices. The group theoretic formulation for partially ranked data analysis was set up by Critchlow (1985). We propose a graphical method for partially ranked data by quantifying objects and judges. In a plot for judges, the interpoint distances can be interpreted as Spearman or Kendall distances between two rankings given by respective judges. Similarly, we also construct a plot for objects with a sensible relationship to the previous plot for judges. This study extends the Han and Huh (1995) quantification method of fully ranked data using Gabriel's (1971) biplot technique for multivariate data matrix.