Locality-Sensitive Hashing Courses and Certifications

James Briggs

How LSH Random Projection Works in Search - Python

Explore efficient similarity search using Locality Sensitive Hashing (LSH) and Random Projection. Learn how to handle large-scale data and implement approximate search techniques in Python.

• YouTube
• 19 minutes
• On-Demand
• Free Video

Simons Institute

A Quasi-Monte Carlo Algorithm for Smooth Kernel Evaluation

Explore a novel data structure for density queries, combining discrepancy theory and LSH to build sparse coresets and enhance smooth kernel evaluation algorithms.

• YouTube
• 42 minutes
• On-Demand
• Free Video

Mining Massive Datasets

24 reviews

The course is based on the text Mining of Massive Datasets by Jure Leskovec, Anand Rajaraman, and Jeff Ullman, who by coincidence are also the instructors for the course.

• edX
• 7 weeks, 5-10 hours a week
• On-Demand
• Free Online Course (Audit)

• Best of All Time

Building Features from Text Data

21 ratings at Pluralsight

This course covers aspects of extracting information from text documents and constructing classification models including feature vectorization, locality-sensitive hashing, stopword removal, lemmatization, and more from natural language processing.

• Pluralsight
• 2-3 hours
• On-Demand
• Free Trial Available

James Briggs

Locality Sensitive Hashing for Search with Shingling + MinHashing - Python

Learn efficient similarity search using Locality Sensitive Hashing (LSH) with shingling and MinHashing techniques in Python. Explore implementation steps, from data preprocessing to LSH tuning, for approximate nearest neighbor search.

• YouTube
• 27 minutes
• On-Demand
• Free Video

IEEE

Kernel Density Estimation through Density Constrained Near Neighbor Search

Explore kernel density estimation through near neighbor search, focusing on importance sampling, locality sensitive hashing, and data-dependent techniques for improved efficiency and accuracy.

• YouTube
• 24 minutes
• On-Demand
• Conference Talk

Stuff Made Here

World's Hardest Jigsaw vs. Puzzle Machine - All White

Watch a puzzle machine tackle the world's hardest jigsaw—an all-white puzzle. Explore image processing, mathematical algorithms, and innovative engineering solutions in this challenging project.

• YouTube
• 22 minutes
• On-Demand
• Free Video

IEEE

Private Nearest Neighbor Search with Sublinear Communication and Malicious Security

Explore secure and efficient private nearest neighbor search techniques, focusing on sublinear communication and protection against malicious adversaries in two-party computation scenarios.

• YouTube
• 19 minutes
• On-Demand
• Free Video

0xdade

Time Signature Based Matching for Data Fusion and Coordination Detection in Cyber Relevant Logs

Methodology for detecting automated behavior in cyber logs using temporal pattern matching, scalable through locality sensitive hashing. Applications include anomaly detection and data fusion.

• YouTube
• 23 minutes
• On-Demand
• Conference Talk

Yannic Kilcher

Reformer - The Efficient Transformer

Discover how Reformer revolutionizes Transformer models, reducing memory usage and enabling processing of longer sequences through innovative techniques like Locality Sensitive Hashing and Reversible Networks.

• YouTube
• 29 minutes
• On-Demand
• Free Video

LASCON

Malware Clustering - Static and Dynamic Behavior Analysis

Explore innovative malware clustering techniques using static and dynamic behavior analysis, machine learning, and similarity search for robust, scalable, and repeatable results.

• YouTube
• 49 minutes
• On-Demand
• Free Video

BasisTech

The Key to Cost-Efficient Quality Text Annotation - Data Pre-Processing

Efficient data pre-processing techniques to reduce redundancy in text annotation, focusing on deduplication and normalization for various languages and character sets.

• YouTube
• 31 minutes
• On-Demand
• Free Video

EuroPython Conference

Speeding Up Search With Locality Sensitive Hashing

Explore locality sensitive hashing for faster search and similarity comparisons, with practical Python implementations and real-world applications in image search and collaborative filtering.

• YouTube
• 24 minutes
• On-Demand
• Conference Talk

Centre de recherches mathématiques - CRM

Generalizations of Matrix Multiplication for Solving the Light Bulb Problem

Explore a novel approach to solving the Light Bulb Problem using tensor-based algorithms, potentially outperforming traditional matrix multiplication methods for faster data analysis and pattern recognition.

• YouTube
• 1 hour 9 minutes
• On-Demand
• Free Video

Simons Institute

Long-context Attention in Near-Linear Time

Explores HyperAttention, an innovative approach to tackle computational challenges in long-context LLMs, offering significant speed improvements while maintaining performance across various datasets.

• YouTube
• 41 minutes
• On-Demand
• Free Video