Comparator selection for RPC with many labels

The Ranking by Pairwise Comparison algorithm (RPC) is a well established label ranking method. However, its complexity is of O(N2) in the number N of labels. We present algorithms for selecting, before model construction, a subset of comparators of size O(N), to reduce computational complexity without loss in accuracy.