Assume that two occurrences of entity pairs with similar contexts, are tend to hold the same relation type.
unsupervised relation extraction problem can be formulated as partitioning collections of entity pairs into clusters according to the similarity of contexts, with each cluster containing only entity pairs labeled by the same relation type.