Question: Given a set of points in Euclidean space, which are being clustered using the K-means algorithm with Euclidean distance, the triangle inequality can be used
Given a set of points in Euclidean space, which are being clustered using the K-means algorithm with Euclidean distance, the triangle inequality can be used in the assignment step to avoid calculating all the distances of each point to each cluster centroid. Provide a general discussion of how this might work.
Step by Step Solution
3.33 Rating (168 Votes )
There are 3 Steps involved in it
Charles Elkan presented the following theorem in his keynote speech at the Worksh... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
908-M-S-D-A (8713).docx
120 KBs Word File
