Portfolio Assignment 4

Prove Your Knowledge:

Mining for Groups Using Clustering Algorithms

In CI chapter 3, the author provided three examples of mining data, specifically, finding groups through agglomerative and divisive clustering algorithms. We thought about what it means to represent similar groups to a machine -- what is a cluster?

Specific Tasks

1. In your portfolio, create a new link and page for clustering.
2. Explain how groups of similar data objects can be represented to a machine.
3. In plain English, explain what hierarchical and K-Means clustering are and how the algorithms work. Be sure to compare and contrast them as appropriate.
4. Include your implementation of meaningful code from Project 3. Be sure to cite the CI text appropriately.

Grading Criteria (300 points)

I must be able to pull your repository by 5PM Monday, Nov. 22 and see that you've updated your portfolio. We will be briefly sharing these in class.