This will be my 5th PASS Summit. I have experimented with different approaches to picking sessions, and come up with a guide. Time is valuable.
The week of PASS is grueling: 18-hour days of mental and social stimulation are common.
The week of PASS Summit is too much for anyone to absorb fully. So, don't expect to. A lot can be done in the following weeks.
I hope to see you at PASS.Permalink
We learn from other people. We often learn from others with similar interests. Who are they? How do we find them?
I am studying at the University of Washington to become a data scientist. My first course, Introduction to Data Science, started a few weeks ago. All of the students completed a survey. Our professor, Dr. Bill Howe, made the anonymized results public. I put the data and my analysis on GitHub for anyone to see.
I am interested in three questions:
Which data science topics are the most popular? Let's use boxplots to find out; they are an effective way to summarize this data.
This can be done in 7 lines of code in R:
p <- ggplot(data=survey, aes(x=Response, y=orderedSurvey))+ geom_boxplot(notch=TRUE)+ labs(x="Importance", y="Question") plot(p)
The results are clear. My fellow students want to learn about techniques to work with "big data" or "fairly big data" in both practical and abstract ways. There is also a desire to understand machine learning.
My fellow students are a diverse group. How similar are our learning preferences?
If we pick a random student, S1, how similar are their preferences to another student's, S2? If we can calculate a single metric to measure similarity for one pair of students, we could calculate that metric for all pairs of students. This is a Euclidean distance problem, and it comes from problems solved using clustering algorithms.
We'll be using R again, again writing 7 lines of code:
The result shows each student's learning preference compared to their classmates'.
Which groups of students in that chart have similar learning preferences? How do we find those groups? How big should they be?
Time for another algorithm: k-means clustering. This algorithm is used to find the k best clusters for a set of points. For example, if k=3, it would group all the data into 3 clusters.
Since k is not chosen automatically, we need to find a good value for it. There are a few different approaches to consider. We'll use the elbow method: look at a graph of k vs efficiency, and identify where the line bends (like an elbow). It's at k=5.
Great! Let's see the clusters. We can do that with 2 lines of R code:
We can see there are 5 groups. They are 3, 6, 8, 8, and 12 people in size, and cover ~80% of the variation in learning preferences between students. That's pretty good. If this data wasn't anonymous, a teacher could use it to group students together with similar interests. Success!
This may seem intimidating for IT professionals or developers. It isn't. There are fantastic resources available. You just need data, a computer, time, and curiosity.
I have progressed this far using only:
What's next? More data. More algorithms. More questions. And above all, more insight.Permalink