Set of tasks solved in Big Data Algorithms course
-
Updated
Aug 1, 2021 - Scala
Set of tasks solved in Big Data Algorithms course
HyperLogLog en C++ y OpenMP para cálculo de similitud de genomas mediante índice de Jaccard
The goal of this project it to provide a tool to build new ranker easily and to compare them with existing ones in terms of results overlapping.
Fast Jaccard similarity search for abstract sets (documents, products, users, etc.) using MinHashing and Locality Sensitve Hashing
This contains all projects that I have done during my master degree.
Building a Full Stack Social Network Web Application with React JS using Redux, NodeJS, Socket.IO and MongoDB. Utilizing Python's NetworkX library to represent graphs and the FastAPI framework to display follower suggestion results on the frontend. The Link Prediction Model includes algorithms such as CN, Jaccard, AA, and Katz
TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
SetSketch: Filling the Gap between MinHash and HyperLogLog
BagMinHash - Minwise Hashing Algorithm for Weighted Sets
SuperMinHash: A New Minwise Hashing Algorithm for Jaccard Similarity Estimation, Simhash and SimhashIndex
Add a description, image, and links to the jaccard-similarity-estimation topic page so that developers can more easily learn about it.
To associate your repository with the jaccard-similarity-estimation topic, visit your repo's landing page and select "manage topics."