solution2

solution2 - SEG4630Assignment#2BriefAnswer Q1.(4points) (1)...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
SEG4630 Assignment #2 Brief Answer Q1. (4 points) (1)(2 points) k = 3 and the frequent 3-itemset is {Bread, Milk, Cheese}. The rules are   Milk,       [75%, 100%]  Bread,       [75%, 100%] Cheese  (2)(2 points) k = 3 and the frequent 3-itemset is {(Wonder-Bread, Dairy-Milk, Tasty-Pie),  (Wonder-Bread, Sunset-Milk, Dairy-Cheese)}. Q2. (2 points)      Let DB be the original database, and ∆DB be the set of new transactions. Mining  local frequent itemsets in ∆DB with the same relative support threshold (local frequent  itemsets in DB are already mined and saved).   • For itemsets that are frequent in DB, scan ∆DB once and add their counts to see if  they are still frequent in the updated database.   • For itemsets that are frequent in ∆DB but not in DB, scan DB once to add their counts 
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

solution2 - SEG4630Assignment#2BriefAnswer Q1.(4points) (1)...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online