Determined the best recognition rate with k = 6, which yields 36% recognition rate. Currently investigating methods for expanding the method from 1 to 1 relations to many to many relations between segment sets. Using the graph structure to restrict the number of subsets to simple paths in the adjacency graph, using associativity of barycenter and some dynamic programming for implementation, I should be able to implement it very efficiently.