Question
Which algorithm is usually more suitable than Apriori for dense data with many long frequent patterns?
Select an option. Your answer will be checked instantly.
Correct Answer: D. FP-growth
Explanation:
FP-growth avoids generating all candidate combinations explicitly.
Its compressed tree is often more efficient for dense transactional data.
Leave a Reply