Clustering similar tweets using K-means clustering algorithm and Jaccard distance metric
-
Updated
Dec 13, 2019 - Python
Clustering similar tweets using K-means clustering algorithm and Jaccard distance metric
Tweets clustering K-means
Locality sensitive hashing based plagiarism checker
Fast Jaccard similarity search for abstract sets (documents, products, users, etc.) using MinHashing and Locality Sensitve Hashing
By clustering similar tweets together, we can generate a more concise and organized representation of the raw tweets, which will be very useful for many Twitter-based applications (e.g., truth discovery, trend analysis, search ranking, etc.)
Clustering Amazon review data around 6M users using Kmeans and Dbscan algorithm.
twitter tweets clustered by common ML algorithms
Add a description, image, and links to the jaccard-distance topic page so that developers can more easily learn about it.
To associate your repository with the jaccard-distance topic, visit your repo's landing page and select "manage topics."