1.Exercise 1Frequent Itemsets
6.46.4.3.1
6.4.12
6.4.33SavasereOmiecinskiNavatheSON al-gorithm
T10I4D100KT40I10D100Kchess, connect, mushroom, pumsb, pumsb starhttp://fimi.ua.ac.be/data/
1,2,5,10SON
2. Exercise 2Clustering
1.1,4,4,16,25,36,49,64,81
Exercise7.2.1
2.K-meansIris
a2K
bK-meansKIris4
Exercise 3Advertising
8.7 ABC. xyz 2
Advertiser A only bids on x, B bids on x and y, and C bids on x, y, andz.Note that on the query sequence xxyyzz, the optimal offine algorithm would yield are venue of 6, since all queries can be assigned.
1.greedyalgorithm6xxyyzz4
2.greedy algorithm
Reviews
There are no reviews yet.