BM25 (Okapi BM25)
BM25, also called Okapi BM25 or Best Match 25, is a probabilistic ranking function used by search engines and information retrieval systems to estimate how relevant a document is to a given query.
Algorithms
Explore Algorithms through related topics and the articles other pages reference most.
Explore articles
Browse subtopics: Information Retrieval
Articles that also belong to these categories. Counts cover all of Algorithms.
All articles (37)Machine Learning (18)Reinforcement Learning (8)Statistics (7)Deep Learning (4)Robotics (4)AI Hardware (3)AI Inference (3)Computer Science (3)Information Retrieval (3)Mathematics (3)Natural Language Processing (3)Open Source AI (3)Artificial Intelligence (2)Large Language Models (2)Training & Optimization (2)AI for Science (1)AI in Gaming (1)Computer Vision (1)Data & Datasets (1)Google (1)Google DeepMind (1)Interpretability (1)Transformer Models (1)
Showing 1-3 of 3 articles
HNSW
Hierarchical Navigable Small World (HNSW) is an approximate nearest-neighbor search algorithm that indexes high-dimensional vectors in a multi-layer proximity graph and answers similarity queries in expected…
TF-IDF (Term Frequency-Inverse Document Frequency)
TF-IDF (term frequency-inverse document frequency) is a numerical statistic that measures how important a word is to a single document within a larger collection or corpus, computed as the product of two…