CSE575_GradedQuiz_week6
.pdf
keyboard_arrow_up
School
Arizona State University *
*We aren’t endorsed by this school
Course
575
Subject
Computer Science
Date
Feb 20, 2024
Type
Pages
11
Uploaded by MagistrateElectronJellyfish43
Graded Quiz: Module 6 Started: Feb 17 at 2:09pm Quiz Instructions D Question 1 1.25pts Which of the following data sets have a natural graph structure? (Select all that apply) Social network Web pages and the hyperlink [0 Aset of dog images Question 2 1.25pts Which of the following statement is true about the L matrix? (Select all that apply) Lis a symmetric matrix Lis a Semi-positive definitive matrix [0 The smallest eigenvalue of L is greater than 0. Question 3 1.25pts Which algorithm would we use to get the partion shown by the curve in the following figure? (There are a set of 6 red colored points and 5 blue colored points on one side of the plane. There s one blue colored point on the other plane.) O RatioCut O MinMaxCut O Neut @ MinCut
Question 4 1.25 pts Which of the following approach considers both inter-cluster and intra-cluster similarity? (select all that apply) MinMaxCut Ncut (J MinCut RatioCut Question 5 1.25 pts Using 2-way partitioning recursively to get k-way partition is inefficient and may cause stability issues. @® True O False Question 6 1.25 pts What is the spectral gap? (O The second largest eigenvalue of L. O The largest eigenvalue of L. (O The third largest eigenvalue of L. @ The smallest non-zero eigenvalue of L. Question 7 1.25 pts Compared to K-means, which of the following is an advantage of spectral clustering? (O The number of clusters does not need to be pre-defined. (O Computational inexpensive for large dataset. @ Does not make strong assumptions on the forms of the clusters.
{21000 e 0 L2000 000121 000117l O 101000 ot 0 L0000 0000 000'L'L0) 200000 070 0 002000 000200 000020 00000 O 12 Qg 000112 O xu1ew Aouaoelpe Uy s1 BUIMOI0} JO UOIUM (-9 9PON puE 17 9pON BUII0aULO 3B UE 1 2194} '9 9PON PUE § 3PON Bunoauuoo abpa Ue s1 218y} ‘G 3PON PUE f 9pON BUI0ULOD 96Pa UE S| 313y} 'E IPON PuE | 9poN Buioauuoo abpa e S| a1ay) ' APON PUE Z 3PON BUIOBULOD 3BPa UE S| 21041 ‘Z JPON. Ppue | apoN buloauuood abpa ue st 813y} :uoleinbiyuod buimoyjos ays yum ydeib e si aiay ) “S191SNJO OM] PUI} 0} INQUI 10 BulsBIsNIo [endads 341 Un1 0} UM B ‘BINB1 BUIMOI|0} B} Ui (S1ulod B1ep “3°1) S3pOU 9 YuM ydelb e UaNY sidgz'L g uonsanp
Question 9 1.25pts Given a graph with 6 nodes (i.e, data points) in the following figure, we want o run the spectral clustering for MinCut to find two clusters. (There is a graph with the following configuration: there is an edge connecting Node 1 and Node 2, there is an edge connecting Node 2 and Node 3, there is an edge connecting Node 1 and Node 3, there s an edge connecting Node 4 and Node 5, there is an edge connecting Node 5 and Node 6, there is an edge connecting Node 4 and Node 6.) Which of following is the degree matrix? 0 [211,000; 1210, 112000; 00021,1; 000121; 0001,1.2; [2.0,0,000; 0200, 0,02000; 000200; 000020; 00,0002]; 0 01.1,000; 1010, 11,0000; 00001.1; 0001,01; 000,1,1.0]; 0 [2:1:1.000; 112000; 000211 000/12:1; 0001-1,2];
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 Questions
Comment on the contrast of the image on histogram information of the image.
arrow_forward
Please explain
Some engineers at Google want you to implement a graph structure of the subway system in Boston showing the connections between each station.They are wondering what data structure to use to represent the graph and use the least amount of memory, given that most stations do not connect to many other stations. Which graph data structure representation should you use and why?
Group of answer choices
a. Adjacency List -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections.
b. Adjacency Matrix -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections.
arrow_forward
Algorithm
arrow_forward
Need help to answer plsss
arrow_forward
attached question
arrow_forward
5
2
|Create the matrix of the graph above and answer the following questions (If there is
no arrow at the end of both sides of line, it is bidirectional).
Answer the following questions by examining the matrix and its powers, show your
results step by step clearly:
|(a) How many walks of length 2 are there from 2 to 4?
(b) How many walks of length 2 are there from 3 to 5?
(c) How many walks of length 3 are there from 0 to 5?
(d) How many walks of length 3 are there from 2 to 4?
arrow_forward
The following image shows a graph with 7 vertices (nodes) labelled from 1 to 7 and edges connecting some of the vertices.
3
6
1
7
The adjacency matrix of a graph is the matrix A = (Aij) with Aij = 1 if there is an edge connecting the vertices i and j and Aij = 0 otherwise.
Set up the adjacency matrix of the above graph and assign it to the variable adjacency_matrix. Represent the matrix as a list of lists such that
adjacency_matrix[i-1][j-1] corresponds to Aij.
Thereafter, define a function vdeg that takes an adjacency matrix (in the same format) and returns a list of the degrees of the vertices. The degree of a vertex is the
number of other vertices that it is connected to. Use the function vdeg to determine the degrees of all vertices of the above graph and store the result in the variable
example_degrees.
arrow_forward
55
arrow_forward
Which of the following is true regarding a heatmap?
It is a graphical representation of data where information is displayed as a scatterplot.
It is a numerical summary of data.
It is a visual summary of information expressed as colors.
It should not be combined with clustering methods.
arrow_forward
COURSE: ARTIFICIAL INTELLIGENCE
QUESTION:
Coloring Map Using Constraint Satisfaction Problem(CSP): Your Project must Contain GUI and Constraint Satisfaction Algorithm. Write code in python language.
Note: Please Use the Maps Given below.
arrow_forward
Please respond..
arrow_forward
Business analytics programming. R programming
1. Import HouseData.csv with stringsAsFactors = FALSE to a data frame named house. Then,
factor() Parking and City_Category vectors.
arrow_forward
Alert dont submit AI generated answer.
arrow_forward
Data Structure
arrow_forward
Can you please explain what each code does in the picture, by that I mean elaborate on every code, function of it and importance. If you can explain the graph too would be awesome.
arrow_forward
DO NOT COPY FROM OTHER WEBSITES
Write your own answer. Thank you!
arrow_forward
Select the best answer for the question.
11. Which graph represents the solution set for -4(1 - x) s-12 + 2x?
十
to
A.
-34
-32
-30
-28
-26
B.
十
-42
-40
-38
-36
-34
С.
-34
-32
-30
-28
-26
十+
D.
-8
-6
-4
-2
O Mark for review (Will be highlighted on the review page)
>
esc
个
->
%
& 4
2 Y
3
5 0
CO
arrow_forward
QUESTION 22
Select the responses below that are true in relation to the graphic linked below.
y
50
25
0
-50-
5-107
B. The period (T) is 0.000571 seconds
0.001
Time Domain Graph (in seconds)
A. The frequency (f) is 3.5 cycles per 2000 micro seconds.
OC. The amplitude is 60.
0.0015
0.002
arrow_forward
what choices should I pick
arrow_forward
By using Cosine Similarity Formula, find the similarity between documents: Document 1 (A) and Document 2 (B), with given value of A and B is as follows:
Document 1: [1, 1, 1, 1, 1, 0] let’s refer to this as A
Document 2: [1, 1, 1, 1, 0, 1] let’s refer to this as B
Above we have two vectors (A and B) that are in a 6-dimension vector space
[Given formula Cosine similarity (CS) = (A . B) / (||A|| ||B||)].
arrow_forward
COMPUTER SCIENCE NEED A EDUCATED PERSON TO HELP WITH GENDERMAG
arrow_forward
Question: Describe the automated scaling listener mechanism and explain the two common responses this mechanism can have to load conditions.
Please be as descriptive as possible and include drawing(s) to illustrate points.
arrow_forward
SEE MORE QUESTIONS
Recommended textbooks for you
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:9781305082168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Related Questions
- Comment on the contrast of the image on histogram information of the image.arrow_forwardPlease explain Some engineers at Google want you to implement a graph structure of the subway system in Boston showing the connections between each station.They are wondering what data structure to use to represent the graph and use the least amount of memory, given that most stations do not connect to many other stations. Which graph data structure representation should you use and why? Group of answer choices a. Adjacency List -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections. b. Adjacency Matrix -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections.arrow_forwardAlgorithmarrow_forward
- Need help to answer plsssarrow_forwardattached questionarrow_forward5 2 |Create the matrix of the graph above and answer the following questions (If there is no arrow at the end of both sides of line, it is bidirectional). Answer the following questions by examining the matrix and its powers, show your results step by step clearly: |(a) How many walks of length 2 are there from 2 to 4? (b) How many walks of length 2 are there from 3 to 5? (c) How many walks of length 3 are there from 0 to 5? (d) How many walks of length 3 are there from 2 to 4?arrow_forward
- The following image shows a graph with 7 vertices (nodes) labelled from 1 to 7 and edges connecting some of the vertices. 3 6 1 7 The adjacency matrix of a graph is the matrix A = (Aij) with Aij = 1 if there is an edge connecting the vertices i and j and Aij = 0 otherwise. Set up the adjacency matrix of the above graph and assign it to the variable adjacency_matrix. Represent the matrix as a list of lists such that adjacency_matrix[i-1][j-1] corresponds to Aij. Thereafter, define a function vdeg that takes an adjacency matrix (in the same format) and returns a list of the degrees of the vertices. The degree of a vertex is the number of other vertices that it is connected to. Use the function vdeg to determine the degrees of all vertices of the above graph and store the result in the variable example_degrees.arrow_forward55arrow_forwardWhich of the following is true regarding a heatmap? It is a graphical representation of data where information is displayed as a scatterplot. It is a numerical summary of data. It is a visual summary of information expressed as colors. It should not be combined with clustering methods.arrow_forward
- COURSE: ARTIFICIAL INTELLIGENCE QUESTION: Coloring Map Using Constraint Satisfaction Problem(CSP): Your Project must Contain GUI and Constraint Satisfaction Algorithm. Write code in python language. Note: Please Use the Maps Given below.arrow_forwardPlease respond..arrow_forwardBusiness analytics programming. R programming 1. Import HouseData.csv with stringsAsFactors = FALSE to a data frame named house. Then, factor() Parking and City_Category vectors.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Principles of Information Systems (MindTap Course...Computer ScienceISBN:9781285867168Author:Ralph Stair, George ReynoldsPublisher:Cengage LearningFundamentals of Information SystemsComputer ScienceISBN:9781305082168Author:Ralph Stair, George ReynoldsPublisher:Cengage Learning
Principles of Information Systems (MindTap Course...
Computer Science
ISBN:9781285867168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:9781305082168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning