We may probably not need exact counts of cooccurrences for representing pattern vectors because a small amount of elements in a pattern vector greatly influence the similarity computation.
it may be enough to find top-k entity pairs with larger counts of co-occurrences for each pattern, and to ignore other entity pairs with smaller counts.