$24
Homework 5 Solution
Instructions for submission: In this programming assignment you will implement the k-means clustering algorithm. Instructions below detail how to turn in your code and assignment on data.cs.purdue.edu
You are given a skeleton code with an existing folder structure. Do not modify the folder structure. You may add any extra les you want to add in the cs373-hw5/src/ folder. For all other parts write your answers in a single PDF. Name this report.pdf. Place your report in the cs373-hw5/report/ folder. Label all the plots with the question number. Your homework must contain your name and Purdue ID at the start of the le. If you omit your name or the question numbers for the plots, you will be penalized.
To submit your assignment, log into data.cs.purdue.edu (physically go to the lab or use ssh remotely) and follow these steps:
Place all of your code in the cs373-hw5/src/ folder and your report in cs373-hw5/report/ folder.
Change directory to outside of cs373-hw5/ folder (run cd .. from inside cs373-hw5/ folder)
Execute the following command to turnin your code: turnin -c cs373 -p hw5 cs373-hw5
To overwrite an old submission, simply execute this command again.
To verify the contents of your submission, execute this command: turnin -v -c cs373 -p hw5. Do not forget the -v option, else your submission will be overwritten with an empty submission.
Speci cation
1.1 Points Instructions
This homework is entirely optional. It is worth 100 points, all of which are extra credit. The homework category for this class (which is worth 45% of the total grade) is out of 400 points (100 for each of the previous homeworks). It is not possible to achieve more than 100% on the homework category. Even if you choose not to turn in this homework (or don’t need the points), it will still be bene cial for you to do this homework for preparation for the nal exam (and general learning).
Note: If you submit only the report and no working code for the k-means algorithm, you will receive a 0. Thus, if you only answer the theory question, you will get a 0.
Note: You cannot turn in this homework late, even if you have late days.
1.2 Dataset
In this homework, you will be working with the ‘Yelp’ dataset. It contains 19 attributes: 15 diescrete and 4 continuous (flatitude, longitude, reviewCount, checkinsg). We already did some exploring with this dataset in homework 1. Your task for this homework is to implement the k-means algorithm and apply it to the continuous attributes in the data.
Your submission will be run on a hidden dataset which is di erent from given dataset. The hidden dataset will have the same column names for the continuous attributes as the given dataset.
The features you will use are the 4 continuous attributes in yelp.csv.
1
CS373 Homework 3
1.3 Skeleton Code
You are provided a skeleton structure with this homework:
cs373-hw5/
handout.pdf
data/
given/
yelp.csv
src/
init .py
kmeans.py
report/
report.pdf
Do not modify the given folder structure. You should not need to, but you may, add any extra les of code in cs373-hw5/src/ folder. You should place your report (report.pdf) in the cs373-hw5/report/ folder. You must not modify init .py. All your coding work for this homework must be done inside cs373-hw5/src/ folder. You are not allowed to use any external libraries for classi er implementations such as scikit-learn etc. Make sure that you understand the given code fully, before you start coding.
Your code will be tested using python2.7 from inside the cs373-hw5/src/ folder. If you wish to use python3.6, you need to place an empty le named ‘python3’ in your src/ folder. Make sure that you test your code on data.cs.purdue.edu before submitting.
1.4 Expected Output
Your python script should take three arguments as input:
trainingDataFileName: corresponds to a subset of the data that should be used as the training set for your algorithm.
K: the value of k to use when clustering.
clustering option: takes one of the following ve values, 1 (use the four original attributs for clustering, which corresponds to Q3.1), 2 (apply a log transform to reviewCount and checkins, which corresponds to Q3.2), 3 (use the standardized four attributes for clustering, which corresponds to Q3.3, 4 (use the four original attributes and Manhattan distance for clustering, which corresponds to Q3.4), and 5 (use 3% random sample of data for clustering, which corresponds to Q3.5).
Your code should read in the training sets from the csv le, cluster the training set using the speci ed value of k, and output the within-cluster sum of squared error and cluster centroids. For the centroid of each cluster report the values for each of the four attributes in the following order.
flatitude, longitude, reviewCount, checkinsg
The expected output is given below. Note that this will run your algorithm with the yelp.csv le, a K value of 4, and clustering option 1. Please make sure you follow this output else you WILL loose points. Note that this is only a sample output and the numbers are not representative of the actual results.
python kmeans.py yelp.csv 4 1 WC-SSE=15.2179 Centroid1=[49.00895,8.39655,12,3]
...
CentroidK=[33.33548605,-111.7714182,9,97]
2 P.T.O
CS373 Homework 3
Kmeans (100 points)
2.1 Theory (10 points)
(10 points) What are the bene ts of the k-means clustering algorithm? What are the issues? In which situations should we use k-means? Your answer should compare to other algorithms learned in class (both unsupervised and supervised) in less than 4 sentences.
2.2 Implementation (30 points)
You need to implement the k-means clustering algorithm for this part. This part could be completed by editing only kmeans.py. You need to follow the description of the models discussed in the lecture slides (link) with the following speci cations.
Features: Consider the 4 continuous attributes in yelp.csv for X.
Distance: Use Euclidean distance unless otherwise speci ed.
Score function: Use within-cluster sum of squared error (where rk is the centroid of cluster Ck, d is the distance function.).
K
x(Xi)2Ck
kX
wc(C) =
d(x(i); rk)2
(1)
=1
Make sure to also implement the following cluster options as described in Section 1.4.
The four original attributes for clustering (corresponding to 3.1).
A log transform to reviewCount and checkins (corresponding to 3.2).
Standardize the 4 attributes for clustering (corresponding to 3.3).
Four original attributes and Manhattan distance for clustering (corresponding to 3.4).
A random sample of the data for clustering (corresponding to 3.5).
Report the results obtained on the given train set in your report.
Analysis (60 points)
You only need to include your plots and discussions in your report. Make sure that the code you submit doesn’t include any changes you don’t want to be included.
(10 points) Cluster the Yelp data using k-means.
Use a random set of examples as the initial centroids.
Use values of K = [3,6,9,12,24].
Plot the within-cluster sum of squares (wc) as a function of K.
Choose an appropriate K from the plot and argue why you choose this particular K.
For the chosen value of K, plot the clusters with their centroids in two ways: rst using latitude vs. longitude and second using reviewCount, checkins. Discuss whether any patterns are visible.
(10 points) Do a log transform of reviewCount, checkins. Describe how you expect the transformation to change the clustering results. Then repeat the analysis (1). Discuss any di erences in the results.
3 P.T.O
CS373 Homework 3
(10 points) Transform the four original attributes so that each attribute has mean = 0 and stdev = 1. You can do this with the numpy functions, numpy.mean() and numpy.std() (i.e., subtract mean, divide by stdev). Describe how you expect the transformation to change the clustering results. Then repeat the analysis (1). Discuss any di erences in the results.
(10 points) Use Manhattan distance instead of Euclidean distance in the algorithm. Describe how you expect the change in the clustering results. Then repeat the analysis (1). Discuss any di erences in the results.
(10 points) Take a 6% random sample of the data. Describe how you expect the downsampling to change the clustering results. Then run the analysis (i) ve times and report the average performance. Specially, you should use a single random 6% sample of the data. Then run 5 trials where you start k-means from di erent random choices of the initial centroids. Report the average wc when you plot wc vs. K. For your chosen K, determine which trial had performance closest to the reported average. Plot the centroids from that trial. Discuss any di erences in the results and comment on the variability you observe.
(10 points) Improve the score function. To evaluate the clustering, it is not su cient to measure only the within-cluster sum of squares (wc) that you used above. It is also desired to have each cluster separate from others as much as possible. To improve the resulting clustering, de ne your own score function that takes into account not only the compactness of the clusters but also the separation of the clusters. Write a formal mathematical expression of your score function and explain why you think your score function is better than the within-cluster sum of squares. Also, using the best con guration from Questions 1-5, plot the results of your score function for K = [3, 6, 9, 12, 24], and compare the results to the appropriate algorithm from Question 1-5.
Time Limit
Your code must terminate with in 8 minutes for each clustering model with 4 or less clusters. If it doesn’t terminate with in 8 minutes, you will be graded for the output your code generates at the end of the 8 minute time limit. If your code doesn’t converge by then, it would be a good idea to print the results you have at that point or use a di erent convergence criteria.
4
