Question
(0) To answer the hierarchical linkage questions in this practice problem, what are the 10 Euclidean distance (or dissimilarity) values - i.e., d(i,j), between customers
(0) To answer the hierarchical linkage questions in this practice problem, what are the 10 Euclidean distance (or "dissimilarity") values - i.e., "d(i,j)", between customers i and j (i j) - between respondent pairs, calculated from the data? Provide these distances below, from "least" distance (i.e., nearest pair) to "greatest distance" (farthest pair) between the customers/respondents (to 3 decimal places).
a. _________
b. _________
c. _________
d. _________
e. _________
f. _________
g. _________
h. _________
i. _________
j. _________
Answers:
d(2,3)=0.901
d(1,5)=1.250
d(2,5)=1.521
d(2,4)=1.677
d(3,4)=1.803
d(1,2)=2.121
d(3,5)=2.236
d(1,3)=3.010
d(4,5)=3.041
d(1,4)=3.092
The following questions ask you to perform hierarchical cluster analyses (manually), using the above calculated distances:
(1) At what distance does the 2-cluster solution emerge using complete linkage (show to 3 decimal places, e.g., 0.123), and which respondents are in each cluster?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started