0
1.5kviews
Explain SON algorithm to find all or most frequent itemsets using at most two passes.

Explain SON algorithm to find all or most frequent itemsets using at most two passes.

1 Answer
0
115views


SON Algorithm :-

  1. The idea is to divide the input file into chunks.

  2. Treat each chunk as a sample, and run the simple and randomized algorithm on that chunk.

  3. We use ps as the threshold, if each chunk is fraction p of the whole file, and s is the support …

Create a free account to keep reading this post.

and 4 others joined a min ago.

Please log in to add an answer.