Search Header Logo

Data Analytics Class Test 5

Authored by Mrs.P.Malin 1588

Other

University

Used 2+ times

Data Analytics Class Test 5
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

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)

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?