CSE575_WEEK5_GRADED QUIZ

pdf

School

Arizona State University *

*We aren’t endorsed by this school

Course

575

Subject

Computer Science

Date

Feb 20, 2024

Type

pdf

Pages

6

Uploaded by MagistrateElectronJellyfish43

Report
Graded Quiz: Module 5 Started: Feb 3 at 9:24pm Quiz Instructions D Question 1 1.25 pts Which of the following defines soft clustering? (O The entire dataset is clustered in one cluster only. (O The cluster’s centers never change. @ Every data point falls into every cluster with certain probability. (O Every data point falls into one cluster and one only. Question 2 1.25 pts Which of the following can NOT be used as a stopping criteria for K-means algorithm? (Select all that apply.) The sum of squared error reaches a local maximum. There are points that belong to more than one cluster. (J The centroids have stopped changing. Question 3 1.25 pts For which of the following reasons may the K-means algorithm end up with sub-optimal clustering? (O Very fast convergence of the K-means algorithm. (O Alarge number of data points in the dataset. O Existence of closely-located data samples in the dataset. @ Selection of bad choices for the initial cluster centers.
Question 4 1.25 pts Which of the following is not a step in K-means algorithm implementation? (O Set initial cluster centers. @ Use the same cluster center for each iteration until a stopping criterion is met. (O Compute the distance between each cluster center and every data point in the training data. (O Assign each data point to its nearest cluster center. Question 5 1.25 pts Which of the following is correct for the K-means algorithm? (Select all that apply.) (J K-means will always give the same results regardless of the initialization. On every iteration of K-means, the cost function should either stay the same or decrease (in particular, it should not increase). (J Once a data point has been assigned to a particular center, it will never be assigned to another different center in future iterations. The value of K is selected manually.
Question 6 1.25 pts You are given 5 data points in a 1-D space: Ty = —5,29 = —4,23 =0,24 =2 and 5 = 3. Suppose =2 and the initial cluster centers are and . When running K-means, what are the final cluster centers after convergence? O M1 = —4.5,/J,2 =25 O =3, p2 =2.5 O pr=0,p =1 ® w1 = —4.5,1u =5/3
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Question 7 1.25 pts Which of the following is one of the properties of the K-means algorithm? (Select all that apply.) The initial choice of cluster centers may have a large effect on the result. It finds a local optimum. (J It converges for most cases but not always. (J No matter which initial cluster centers are selected, it always ends up with same clusters. Question 8 1.25 pts Suppose we run K-Means on the following dataset with six data points to find two clusters. (000 (20 (40 (There are a set of points in a 2 dimensional space with the following coordinates: point P1 has coordinates (0,0), point P2 has coordinates (0,2), point P3 has coordinates (2,0), point P4 has coordinates (2,2), point P5 has coordinates (4,0), and point P6 has coordinates (4,2).) Suppose the initial cluster centers are (0,0) and (5,0). What is the cluster assignment for each data point after Step1? @ Left four belong to the first cluster, and the right two belong to the second cluster. O Left two belong to the first cluster, and the right four belong to the second cluster. O bottom three belong to the first cluster, and the upper three belong to the second cluster.
Question 9 1.25 pts If the initial cluster centers are (2,0) and (2,2), how many iterations does the algorithm take until convergence? (000 (20 (40 (There are a set of points in a 2 dimensional space with the following coordinates: point P1 has coordinates (0,0), point P2 has coordinates (0,2), point P3 has coordinates (2,0), point P4 has coordinates (2,2), point P5 has coordinates (4,0), and point P6 has coordinates (4,2).) 02 03 @1 04 Question 10 1.25 pts K-Means algorithm can be used to solve problems. Clustering (J Logistic Regression (J Linear Regression () Classification
Graded Quiz: Module 5 Due Feb 11 at 11:59pm Points 12.5 Questions 10 Time Limit 45 Minutes Attempt History Attempt Time Score LATEST Attempt 1 14 minutes 12.5 out of 12.5 Quiz results are protected for this quiz and are not visible to students. (@ Correct answers are hidden. Score for this quiz: 12.5 out of 12.5 < Previous Next »
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help

Related Documents

Cockpit Design.docx
Cisc100NetworkingAss2.docx
CISC180 - Project 3.docx
CSE575_KnowledgeCheck_Basicso fSpectralClustering.pdf
Assignment_4_Cleaning_Data_Set_Instructions.docx
CSE575_GradedQuiz_week6.pdf
CSE575_KnowledgeCheck_DeepLearningForVideo-BasedRecognition.pdf
CSE575_KnowledgeCheck_GenerativeAdversarialNetworksandtheir Applications.pdf
CSE575_KnowledgeCheck_GraphCutFormulation.pdf
1.1.4.6 Lab - Configuring Basic Router Settings with IOS CLI(1).docx
RBrown_Module 02 Assignment - File Management_021324.pdf
5BE2597F-F3D1-4E90-ADF3-FECE9F1A4E53.pdf
Recommended textbooks for you
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781285196145
Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Oracle 12c: SQL
Computer Science
ISBN:9781305251038
Author:Joan Casteel
Publisher:Cengage Learning
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
Fundamentals of Information Systems
Computer Science
ISBN:9781337097536
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781305971776
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
SEE MORE TEXTBOOKS
Recommended textbooks for you
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781285196145
Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Oracle 12c: SQL
Computer Science
ISBN:9781305251038
Author:Joan Casteel
Publisher:Cengage Learning
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
Fundamentals of Information Systems
Computer Science
ISBN:9781337097536
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Text book image
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781305971776
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
SEE MORE TEXTBOOKS