An algorithm to calculate NFT rarity(how unique it is), based on Jaccard Distance.

A lightweight product recommendation system (Item Based Collaborative Filtering) developed in Haskell.

String Comparision in C#.NET

TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation

Massive Sparse Data Clustering Based on Frequent Items (SIGMOD 2023)

A graph mining problem where the task was to predict a link between the given nodes. Engineered different features like Jaccard Distance, Cosine-Similarity, Shortest Path, Page Rank, Adar Index, HITS score and Kartz Centrality. Finally built non-linear models to get the final F1 score as 0.92.

Clustering similar tweets using K-means clustering algorithm and Jaccard distance metric

Tweets clustering K-means

Big Data Platform Final Project

Locality sensitive hashing based plagiarism checker

Fast Jaccard similarity search for abstract sets (documents, products, users, etc.) using MinHashing and Locality Sensitve Hashing

Given a directed social graph, have to predict missing links to recommend users.

Sentence Similarity Approaches

String distances in rust

HyperLogLog en C++ y OpenMP para cálculo de similitud de genomas mediante índice de Jaccard

Document Comparison web application based on Jaccard Similarity Index. The uploaded file is compared to all previously uploaded ones. Built with Java/JSP

How Far Would You Go for Italian Mozzarella? Exploring the impact of product cost and purchase frequency on distance traveled by Italian consumers

A string metric that measures proximity between 2 words. The metric calculation is a formula that utilizes 3 existing String metric algorithms: Jaccard Distance, Edit Distance and Longest Common Substring Distance.

Classifying images into discrete categories based on keywords generated from the Google Cloud Vision API