# NPTEL Data Mining Assignment 7 Answers 2023

Hello NPTEL Learners, In this article, you will find NPTEL Data Mining Assignment 7 Week 7 Answers 2023. All the Answers are provided below to help the students as a reference donâ€™t straight away look for the solutions, first try to solve the questions by yourself. If you find any difficulty, then look for the solutions.

###### NPTEL Data Mining Assignment 8 Answers 2023 Join Groupđź‘‡

Note: We are trying to give our best so please share with your friends also.

## NPTEL Data Mining Assignment 7 Answers 2023:

#### Q.1. Which of the following statement is NOT true about clustering?

• a. It is a supervised learning technique
• b. It is an unsupervised learning technique
• c. It is also known as exploratory data analysis
• d. It groups data into homogeneous groups

#### Q.2. Which of the following clustering technique start with the points as individual clusters and, at each step, merge the closest pair of clusters

• a. K-Means clustering
• b. DBSCAN
• c. Divisive clustering
• d. Agglomerative clustering

#### Q.3. DBSCAN is a___________ algorithm

• a. Partitional clustering
• b. Hierarchical clustering
• c. Fuzzy clustering
• d. Complete clustering

#### Q.4. The Euclidean distance matrix between four 2-dimensional points, p1, p2, p3, and p4, is shown below. A possible set of co-ordinate values of these points are:

• a. p1=(0, 0), p2=(0, 1), p3=(1, 0), p4=(1, 1)
• b. p1=(0, 0), p2=(1, 0), p3=(1, 1), p4=(0, 1)
• c. p1=(1, 0), p2=(0, 0), p3=(1, 1), p4=(0, 1)
• d. p1=(0, 0), p2=(1, 1), p3=(1, 0), p4=(0, 1)

#### Q.5.The leaves of a dendogram in hierarchical clustering represent?

• a. Individual data points
• b. Clusters of multiple data points
• c. Distances between data points
• d. Cluster membership of the data points

#### Q.6. Distance between two clusters in complete linkage clustering is defined as:

• a. Distance between the closest pair of points between the clusters
• b. Distance between the furthest pair of points between the clusters
• c. Distance between the most centrally located pair of points in the clusters
• d. None of the above

#### Q.7. Consider a set of five 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), and p5=(0, 0.5). Euclide-an distance is the distance function. Single linkage clustering is used to cluster the points into two clusters. The clusters are:

• a. {p1, p2, p3} {p4, p5}
• b. {p1, p4, p5} {p2, p3}
• c. {p1, p2, p5} {p3, p4}
• d. {p1, p2, p4} {p3, p5}

#### Q.8. Consider a set of five 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), and p5=(0, 0.5). Euclide-an distance is the distance function. Complete linkage clustering is used to cluster the points into two clus-ters. The clusters are:

• a. {p1, p4, p5} {p2, p3}
• b. {p1, p2, p3} {p4, p5}
• c. {p1, p2, p5} {p3, p4}
• d. {p1, p2, p4} {p3, p5}

#### Q.9. Consider a set of five 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), and p5=(0, 0.5). Euclidean distance is the distance function. The k-means algorithm is used to cluster the points into two clusters. The initial cluster centers are p1 and p5. The clusters after two iterations of k-means are:

• a. {p1, p4, p5} {p2, p3}
• b. {p1, p2, p3} {p4, p5}
• c. {p3, p4, p5} {p1, p2}
• d. {p1, p2, p4} {p3, p5}

#### Q.10. Given a set of seven 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), p5=(0, 0.5), p6=(0, 9), and p7=(5.5, 1). Euclidean distance is the distance function. The DBSCAN algorithm is used to cluster the points. Epsilon = 1, and MinPts = 2 is used for DBSCAN. The clusters and outliers obtained are:

• a. Clusters: {p1, p3, p4, p5} {p2, p7}; Outlier: p6
• b. Clusters: {p1, p2, p3} {p4, p5, p6}; Outlier: p7
• c. Clusters: {p1, p4, p5} {p2, p3, p7}; Outlier: p6
• d. Clusters: {p1, p4, p5} {p2, p3, p6}; Outlier: p7
##### NPTEL Data Mining Assignment 7 Answers Join Groupđź‘‡

Disclaimer: This answer is provided by us only for discussion purpose if any answer will be getting wrong donâ€™t blame us. If any doubt or suggestions regarding any question kindly comment. The solution is provided byÂ Chase2learn. This tutorial is only for Discussion andÂ LearningÂ purpose.

#### About NPTEL Data Mining Course:

Data mining is study of algorithms for finding patterns in large data sets. It is an integral part of modern industry, where data from its operations and customers are mined for gaining business insight. It is also important in modern scientific endeavors. Data mining is an interdisciplinary topic involving, databases, machine learning and algorithms. The course will cover the fundamentals of data mining. It will explain the basic algorithms like data preprocessing, association rules, classification, clustering, sequence mining and visualization. It will also explain implementations in open source software. Finally, case studies on industrial problems will be demonstrated.

#### Course Layout:

• Week 1:Â Introduction, Data PreprocessingÂ
• Week 2:Â Association Rule Mining, Classification Basics
• Week 3:Â Decision Tree, Bayes Classifier, K nearest neighborÂ
• Week 4:Support Vector Machine, Kernel MachineÂ
• Week 5:Â Clustering, Outlier detectionÂ
• Week 6:Â Sequence miningÂ
• Week 7:Â Evaluation, Visualization.Â
• Week 8:Â Case studiesÂ
###### CRITERIA TO GET A CERTIFICATE:

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

If you have not registered for exam kindly register Through https://examform.nptel.ac.in/