Computer Science, asked by rafik7491, 1 month ago

Find Closed Frequent and Maximal Frequent itemsets for these trnsaction in I where Minimum Support threshold is 2.     Consider itemset I = { Butter, Bread, Jam, Pickle, Ketchup } and the transaction set 1.{Butter, Bread, Pickle} 2.{Bread, Ketchup} 3.{ Bread, Jam } 4.{ Butter, Bread, Ketchup } 5.{ Butter, Jam } 6.{ Bread, Jam } 7.{ Butter, Jam } 8.{ Butter, Bread, Jam, Pickle } 9.{ Butter, Bread, Jam }​

Answers

Answered by mayuripatil3096
1

Explanation:

no...I don't know this answer

Similar questions