MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW

Case Recommender: A Flexible and Extensible Python Framework for Recommender Systems

A way to use cuda to accelerate top k algorithm

Dynamic Score-Decomposed Tries which more efficiently solve the prefix autocomplete problem

🎛️ Use RedisBloom in PHP!

PHP client for RedisBloom module

A fast and highly accurate differentiable Top-k operator from the "Successive Halving Top-k Operator" AAAI'21 paper.

Mallows Kendall. A python package to for Mallows Model with top-k and complete rankings using Kendall's-tau distance. By Ahmed Boujaada, Fabien Collas and Ekhine Irurozki. We present methods for inference in the Mallows Model (MM), the best-known distribution for permutations. This is short tutorial for top-k rankings and complete rankings under…

Tools for maximum inner product retrieval in recommender systems.

Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K

A C++ and MFC based data query system. Support underlying DBMS algorithm as Top-K query, B+ tree index and External Sorting.

Sliding-window and regular top-K sketches, based on HeavyKeeper

Analysis of 'Attention is not Explanation' performed for the University of Amsterdam's Fairness, Accountability, Confidentiality and Transparency in AI Course Assignment, January 2020

Dive into the world of text embeddings. This course will guide you through leveraging text embeddings to enhance various natural language processing (NLP) tasks.

The repository contains code to reproduce the experiments from our paper Error Feedback Can Accurately Compress Preconditioners available below:

Get the indices of the top K values in an array

Package topk finds the top k elements in the collection.

Instagram Bot with multiple features for educational purposes on Selenium.

Laboratory on Algorithms for Big Data a.a. 2016/17 - University of Pisa

A method to enumerate top-k cliques.