Therefore, it is necessary to deduce the tree structure from the features of the items. One approach to this is to create a distance measure between the items. Normally, the distances do not represent a tree, so it is necessary to find a tree that accurately estimates the true distances. These partitions are chosen because items within a partition are closer to each other than to those in the other side of the partition. A clique in this graph represents a set of partitions that can be formed into a tree.
Maximum cliques attempt to encapsulate as much of the partition data as possible.