Assignment 3

Artificial Intelligence: Search and Mining — Assignment 3
Due: 5pm, Friday, June 10, 2016
Must be submitted to the assignment drop box in front of the Information Science Administration
Office. 情報事務室前のレポート箱に投函すること
ID 学籍番号
Name 氏名
Looking at the table below, list all frequent itemsets for the case of the minimum support of s = 2.
Please show your work. 下のを見て, 最低サポート s = 2 としたときの頻出アイテム集合を全て求めよ. 導出
過程を示すこと.
Basket
1
2
3
4
5
6
7
8
Itemset
A, D, E
B, D, F
B, E, F
C, E, F
B, F
A, F
E, F
A, B, E, F