hpclab / fast-approximate-filtering
Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardini, Roberto Trani, and Rossano Venturini.
☆14Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for fast-approximate-filtering
- ☆11Updated 6 years ago
- Official repository of RankEval: An Evaluation and Analysis Framework for Learning-to-Rank Solutions.☆88Updated 4 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 8 years ago
- Code repo for the SIGIR '17 paper "Efficient Cost-Aware Cascade Ranking for Multi-Stage Retrieval"☆10Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Official repository of QuickRank: A C++ suite of Learning to Rank algorithms.☆131Updated 5 years ago
- A large scale feature extraction tool for text-based machine learning☆31Updated 2 years ago
- Library for Distributed Retrieval☆15Updated 10 years ago
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016☆24Updated 6 years ago
- Open-Source Information Retrieval Reproducibility Challenge☆50Updated 8 years ago
- A toolkit for simulating interactive information retrieval☆20Updated 6 years ago
- Efficient and effective query auto-completion in C++.☆51Updated last year
- My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".☆48Updated last year
- Implementation of QuadSketch algorithm☆11Updated last year
- Improving the effectiveness Lucene's BM25 (and testing it using Yahoo! Answers and Stack Overflow collections)☆16Updated 2 years ago
- A clone of indri-5.12 with minor customizations.☆25Updated last month
- Standalone Neural Ranking Model (SNRM)☆74Updated 5 years ago
- SUccinct Retrieval Framework☆19Updated 8 years ago
- Code and data for "Universal Approximation Functions for Fast Learning to Rank: Replacing Expensive Regression Forests with Simple Feed-F…☆9Updated 6 years ago
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Updated 4 years ago
- Experimental search engine in C/C++17 - still in early development.☆26Updated last month
- Parameterless and Universal FInding of Nearest Neighbors☆56Updated 6 months ago
- A RankLib based Solr Learning to Rank Plugin☆29Updated 2 years ago
- C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…☆16Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- FTRL proximal algorithm according to McMahan et al. 2013☆24Updated 5 years ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini, "Efficient Inverted Indexes for Approximate Retrieva…☆42Updated 3 weeks ago
- TREC Core track☆11Updated 7 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- Automatically exported from code.google.com/p/jforests☆67Updated 4 years ago