*Dataset of frequent 3-itemsets before running the algorithm:*

`{1, 2, 3}, {1, 2, 4}, {1, 2, 5}, {1, 2, 6}, {1, 3, 4}, {1, 3, 5}, {1, 3, 6}, {2, 3, 4}, {2, 3, 6}, {2, 3, 5}, {3, 4, 5}, {3, 4,6}, {4, 5, 6}. `

Assuming there are only six items in the data set.

**What is the list of all candidate 4-itemsets obtained by the candidate generation procedure in Apriori algorithm?**

What are all candidate 4-itemsets that survive the candidate pruning step of the Apriori Algorithm?

After using Apriori I get:

$${{1,2}}, {{1,3}}, {{1,2,5}}, {{2,3,6}}$$

**Contents**hide

#### Best Answer

I actually learned a lot about Apriori from steffen when he answered on my post. The answer is this:

$${{1236}};{{1235}};{{1234}};{{1245}}$$

### Similar Posts:

- Solved – Apriori versus Jaccard Coeff for recommender-system
- Solved – Bayesian network vs. association rules
- Solved – How to do a ‘beer and diapers’ correlation analysis
- Solved – Identifying important interactions between features using machine learning
- Solved – What are the benefits and limitations of Apriori algorithm?