Given an integer k and a set of m permutations on the numbers 1 through n, our goal is to find the "best" partitioning of these permutations into k clusters, each of which represents some set of "similar" permutations. In other words, each of the m input permutations could represent, for example, a preference list. How do we determine which sets of preference lists are most similar? This project will address this question from a theoretical and experimental perspective. |