abhijangda/text-clustering

An implementation of k-means clustering to find related text documents. Written to solve the Newsle clustering problem in CodeSprint 2012.

Solution for Newsle Clustering question from CodeSprint 2012. Implements clustering of text documents using Cosine or Jaccard distance between the feature vectors of the documents together with k means clustering.