Scribd
Upload
7 views2 pages

DWM - Assignment 2 - July2024

The document outlines an assignment for the Data Warehousing and Mining course, detailing various questions related to clustering algorithms, market basket analysis, and web mining techniques. It includes specific tasks such as explaining the K-medoids and K-means algorithms, demonstrating clustering with given datasets, and exploring concepts like Market Basket Analysis and Association Rules. Additionally, it covers advanced topics like Web Structure Mining and Web Usage Mining, along with practical applications of algorithms like FP-growth and Apriori.

Uploaded by

Mayur Shelke
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views2 pages

DWM - Assignment 2 - July2024

The document outlines an assignment for the Data Warehousing and Mining course, detailing various questions related to clustering algorithms, market basket analysis, and web mining techniques. It includes specific tasks such as explaining the K-medoids and K-means algorithms, demonstrating clustering with given datasets, and exploring concepts like Market Basket Analysis and Association Rules. Additionally, it covers advanced topics like Web Structure Mining and Web Usage Mining, along with practical applications of algorithms like FP-growth and Apriori.

Uploaded by

Mayur Shelke
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Shivajirao S.

Jondhale College of Engineering


Department of Computer Engineering
July 2024- Oct 2024
ASSIGNMENT 2
Class: TE (Div A &B) Date: 1/10/2024
Sem: V
SUB: Data Warehousing and Mining

Q.1 Explain K-medoids algorithm? Apply K-means clustering algorithm for the following data set with two clusters.

Point Coordinates
A1 (2, 6)
A2 (3, 8)
A3 (4, 7)
A4 (6, 2)
A5 (6, 4)
A6 (7, 3)
A7 (7,4)
A8 (8, 5)
A9 (7, 6)
A10 (3, 4)
Q.2 Suppose that the data mining task is to cluster the following points into 3 clusters. A1(2,10),A2(2,5),
A3(8,4),A4(5,8),A5(7,5),A6(6,4), A7(1,2), A8(4,9). The distance function is Euclidean distance. Suppose initially
we assign A1,A4 and A7 as the center of each cluster respectively. Use the K-means algorithm to show only

a. The three cluster centers after the first round of execution and

b. The final three clusters.

Q.3 Show the dendrogram created by the Single link,complete link and average link clustering algorithm for the
given distance matrix

1 2 3 4 5
1 0
2 2 0
3 6 3 0
4 10 9 7 0
5 9 8 5 4 0
.

Q.4 Explain Market Basket Analysis with example.


Q.5 A database has 5 transactions. Let min_sup= 60%. Find all the frequent item sets using FP-growth.

TID Items_bought

T100 { M,O,N,K,E,Y}
T200 { D,O,N,K,E,Y}
T300 { M,A,K,E}
T400 { M,U,C,K,Y}
T500 { C,O,O,K,I,E}

Q.6 What is Association? Apply apriori algorithm on the following dataset to find strong association rules.
Minimum support threshold (s=33.33%) and minimum confident threshold (c=60%)

TID Items

T1 Hot dogs, Buns, Ketchup


T2 Hot dogs, Buns
T3 Hot dogs, Coke, Chips
T4 Coke, Chips
T5 Chips, Ketchup
T6 Hot dogs, Coke, Chips

Q.7 What is Web Structure Mining? Explain Page Rank Technique in detail with example.
Q.8 Write short note on: a. Multilevel Association Rule Mining b. Crawlers c. FP-Tree

Q.9 Explain K-means clustering algorithm? Apply K-means clustering algorithm for the following data set with
two clusters.

Data set= {2,4,10,12,3,20,30,11,25,6,8,30,40}

Q.10 Explain Web usage mining in detail.

You might also like