Which of the following algorithms would be the most appropriate to use for determining how many topics exist in a large collection of papers written about different topics?

A-Priori

Locality-sensitive hashing

PCY

Hierarchical agglomerative clustering

In the PCY algorithm, if 3 pairs map to the same bucket and the minimum support is 2, which of the following statements is true?

		Any pair that maps to this bucket may be frequent.
		None of the items in the pair that maps to each bucket is frequent
		Each of the items in the pair that maps to each bucket is frequent
		All pairs that map to this bucket are frequent.