Data Analytics Class Test 5

Data Analytics Class Test 5

University

10 Qs

quiz-placeholder

Similar activities

Algorithm Quizz 1

Algorithm Quizz 1

University

7 Qs

WLUG-CS (Data Science)

WLUG-CS (Data Science)

University - Professional Development

12 Qs

Ai Chapter 4 (2122-1) Quiz 3

Ai Chapter 4 (2122-1) Quiz 3

University

10 Qs

Clustering

Clustering

University

10 Qs

#Sg_Spaic Last season Quiz (ML and Python)

#Sg_Spaic Last season Quiz (ML and Python)

KG - Professional Development

10 Qs

Cluster Analysis Quiz

Cluster Analysis Quiz

University

10 Qs

Data Structure & Algorithm

Data Structure & Algorithm

University

15 Qs

Data Analytics | Module 9

Data Analytics | Module 9

University - Professional Development

10 Qs

Data Analytics Class Test 5

Data Analytics Class Test 5

Assessment

Quiz

Other

University

Medium

Created by

Mrs.P.Malin 1588

Used 2+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Identify an unsupervised machine learning algorithm

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

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?