Identify an unsupervised machine learning algorithm

Data Analytics Class Test 5

Quiz
•
Other
•
University
•
Medium
Mrs.P.Malin 1588
Used 2+ times
FREE Resource
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Logistic Regression
K Means Clustering
Linear Regression
Support Vector Machine
2.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
K means algorithm is based on ________selection.
hyperplane
seed point
centroid
support vector
3.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Say True or False: The objective of k-means algorithm is to maximize the sum of distances between the data point and their corresponding clusters.
True
False
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The K in the K-Means algorithm specifies which of the following:
The number of data-points that we want to cluster out of a larger set of data-points.
The average distance between cluster centroids over all algorithm iterations
The number of partitions(clusters) that we want to get out of a given data-set
This is the number of data-points that the similarity metric considers at each iteration.
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Every iteration of the K-Means algorithm contains which of the following steps:
Randomly assigning all data-points to one of K clusters
Assigning data-points to the closest centroid using a given similarity (distance) measure.
Randomly assigning the positions of K centroids in the data-point space.
Calculate the average Euclidean distance between all cluster centroids.
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The distance (similarity) function used by K-Means does which of the following:
Computes the average distance between all of n real-valued data-points in a given data-set
Converts a given a set of n real-valued data-points into a vector: x1,. . ., xn, of integer values
Implements a distance calculation, dist(xi,mj), between each data-point xi and each cluster centroid (mj)
Calculates the average Euclidean distance between K cluster centroids in the n dimensional space of all data
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The convergence criterion of the K-Means algorithm is usually (in the simplest implementation of K-Means), which of the following:
When the Sum of Squared Errors(SSE) stops decreasing
When the algorithm outputs K clusters at any given iteration
After n (user specified) iterations
When the cluster centroids are no longer changing position and all data-points have been assigned to one of the K clusters (i.e. no more data-point re-assignments)
Create a free account and access millions of resources
Similar Resources on Quizizz
10 questions
Information systems analysis and design

Quiz
•
University
9 questions
Topic 2

Quiz
•
University
15 questions
Quiz on Problem-Solving and Computational Thinking

Quiz
•
12th Grade - University
10 questions
Stack Data Structure

Quiz
•
University
15 questions
Business Analytics - Quiz 3

Quiz
•
University
15 questions
MACHINE LEARNING-PEDAGOGY METHOD

Quiz
•
University
10 questions
Clustering

Quiz
•
University
10 questions
Cluster Analysis Quiz

Quiz
•
University
Popular Resources on Quizizz
15 questions
Character Analysis

Quiz
•
4th Grade
17 questions
Chapter 12 - Doing the Right Thing

Quiz
•
9th - 12th Grade
10 questions
American Flag

Quiz
•
1st - 2nd Grade
20 questions
Reading Comprehension

Quiz
•
5th Grade
30 questions
Linear Inequalities

Quiz
•
9th - 12th Grade
20 questions
Types of Credit

Quiz
•
9th - 12th Grade
18 questions
Full S.T.E.A.M. Ahead Summer Academy Pre-Test 24-25

Quiz
•
5th Grade
14 questions
Misplaced and Dangling Modifiers

Quiz
•
6th - 8th Grade