This class is used to classify data using KNN, however the nearest neighbors are based
on an aggregate ranking for the distance between each element of a data point. Each element
of the input data is ranked according to how close it is to any incoming data that needs
to be classified. This ranking is then aggregated and the highest ranking data points are
used to classify the incoming sample.

In this manner a distance function is not required, a prerequisite for normal KNN