Weekly Quiz 1 Machine Learning Great Learning PDF
Weekly Quiz 1 Machine Learning Great Learning PDF
Course Content
Weekly Quiz 1
Time : 20m
Due Date : Mar 27, 11:30 PM
Instructions
Attempt History
Marks: 1/1
The Rating Data for 4 colleges is given below. Calculate Euclidean Distance between College A and B.
F
SR
Engg_C Teac e Place Inter Infrastr
_N
ollege hing e ments nship ucture
O
s
1 A 5 2 5 5 3
2 B 4 5 5 4 5
4 D 1 3 1 1 2 /
https://www.coursehero.com/file/61976599/Weekly-Quiz-1-Machine-Learning-Great-Learningpdf/
3.87 You Selected
3.17
2,76
4,74
Marks: 1/1
The Rating Data for 4 colleges is given below. If we consider Manhattan Distance then which two college
will be merged first assuming we are doing Hierarchical Agglomerative Clustering:
2 B 4 5 5 4 5
3 C 3 4 4 3 4
4 D 1 3 1 1 2
BC You Selected
AB
AC
CD
AB: 1+3+0+1+2=7 AC: 2+2+1+2+1=8 AD: 4+1+4+4+1=14 BC: 1+1+1+1+1=5 BD: 3+2+4+3+3=15
CD: 2+1+3+2+2=10
This study source was downloaded by 100000775636365 from CourseHero.com on 07-09-2023 02:54:57 GMT -05:00
tree showing how close things are to each other You Selected
Hierarchical clustering output is the tree showing how close things are to each other
Marks: 1/1
Which of the following is an Unsupervised Learning technique?
Logistic Regression
Marks: 1/1
Which of the following is required by K-means clustering?
This study source was downloaded by 100000775636365 from CourseHero.com on 07-09-2023 02:54:57 GMT -05:00
/
https://www.coursehero.com/file/61976599/Weekly-Quiz-1-Machine-Learning-Great-Learningpdf/
defined distance metric
number of clusters
Marks: 1/1
Which of the following type of linkage denotes to the Average Linking method?
You Selected
Marks: 1/1
What is the most appropriate no. of clusters for the data points represented by the following
dendrogram:
This study source was downloaded by 100000775636365 from CourseHero.com on 07-09-2023 02:54:57 GMT -05:00
/
https://www.coursehero.com/file/61976599/Weekly-Quiz-1-Machine-Learning-Great-Learningpdf/
2
4 You Selected
The decision of the no. of clusters that can best depict different groups can be chosen by observing
the dendrogram. The best choice of the no. of clusters is the no. of vertical lines in the dendrogram
cut by a horizontal line that can transverse the maximum distance vertically without intersecting a
cluster. In the above example, the best choice of no. of clusters will be 4 as the red horizontal line in
the dendrogram below covers maximum vertical distance AB.
Marks: 1/1
Assume there are 100 customers, 10 of them bought milk, 8 bought butter and 6 bought both of them.
What is the value of lift in this case?
This study source was downloaded by 100000775636365 from CourseHero.com on 07-09-2023 02:54:57 GMT -05:00
/
https://www.coursehero.com/file/61976599/Weekly-Quiz-1-Machine-Learning-Great-Learningpdf/
7.5 You Selected
8.5
6.5
Marks: 0/1
Which of the following association rule can be defined using the above table?
Orange juice and soda are more likely to be purchased together than any other two
You Selected
items.
Use the below count table to come up with the rules, all the rules can be validated using this table.
Question No:was
This study source 10downloaded by 100000775636365 from CourseHero.com
CorrectonAnswer
07-09-2023 02:54:57 GMT -05:00
Marks: 1/1
/
https://www.coursehero.com/file/61976599/Weekly-Quiz-1-Machine-Learning-Great-Learningpdf/
_____ is frequently referred to as k-means clustering.
Divisive clustering
Previous Next
Proprietary content. ©Great Learning. All Rights Reserved. Unauthorized use or distribution prohibited.
This study source was downloaded by 100000775636365 from CourseHero.com on 07-09-2023 02:54:57 GMT -05:00
/
https://www.coursehero.com/file/61976599/Weekly-Quiz-1-Machine-Learning-Great-Learningpdf/
Powered by TCPDF (www.tcpdf.org)