1. MODERN COLLEGE OF ARTS,SCIENCE &
COMMERCE COLLEGE,GANESHKHIND
DATA MINING & DATA WAREHOUSING
ASSIGNMENT
GUIDED BY
DR.DIPALI MEHER .
2. APRIORI ALGORITHM EXAMPLE
PREPARED BY
MSC (COMPUTERAPPLICATION-I) STUDENTS
ANUJA ZOPE.
POOJA GITE.
PRACHI DESHMUKH.
NIDHI BHOSAOLE.
anujazope00@gmail.com
gitepuja1999@gmail.com
deshmukhprachi869@gmail.com
nidhibhosale2112@gmail.com
3. Q1. Solve the Apriori example using the above data ?
Given sup count=2.
TID ITEMS BOUGHT
1 Potato, burger, milk
2 Milk , beer
3 Onion , potato , milk
4 Onion , potato , burger , beer
5 Onion , potato ,burger , milk
6 Onion , potato , milk
4. STEP 1: get given data as it is.
TID ITEMS BOUGHT
1 Potato , burger ,milk
2 Milk , beer
3 Onion ,potato , milk
4 Onion, potato , burger , beer
5 Onion , potato , burger , milk
6 Onion , potato , milk
5. Step 2: take the support count of each item
ITEMS BOUGHT SUPPORT
Potato 5
Burger 3
Milk 5
Beer 2
Onion 4
6. Step 3: find and remove below value of sup count
Item bought support
potato 5
burger 3
milk 5
beer 2
onion 4
Item bought support
potato 5
burger 3
milk 5
beer 2
onion 4
Here not
remove any item
because of not
any item is less
than sup count
7. Step 4 : combine items & remove the less sup count from support.
Items Bought support
Potato, burger 4
Potato, milk 4
Potato , beer 1
Potato , onion 4
Burger , milk 2
Burger , beer 1
Burger , onion 2
Milk , beer 1
Milk , onion 3
Beer , onion 1
Items support
Bought
Potato ,burger 4
Potato,milk 4
Potato , onion 4
Burger , milk 2
Burger ,onion 2
Milk , onion 3
Remove the
less than 2
because sup
count=2