Efficient Similar-Object Search Algorithms for Terabytes of Data
summary
Segmento DMP stores hundreds of millions of anonymous internet user profiles and needs to cluster them and find fuzzy duplicates. The talk covers computing similarity metrics between profiles at terabyte scale and explains alternatives to brute-force comparisons, focusing on scalable approximate search algorithms and practical engineering choices used to make similarity search feasible on that data volume.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 3:38Look-alike audience problem
- 6:25MinHash for compact representation
- 9:38Locality-Sensitive Hashing
- 13:53Parameter tuning and accuracy trade-off
- 14:13SimHash algorithm and use
- 17:48Tech stack and implementation
- 18:37Q&A
related talks
37mSimilarity Search for Product Matching @ Semantics3
38mA Bi-metric Framework for Fast Similarity Search
49mFrom research to production at ebay
43mSegmenting 600 Million Users
26mUnleash Big Data Clustering
11mFinding Friends in High Dimensions...
47mWhy, What, When and How of Running Diff Types of Sear...
44mAdvertising at the Speed of Light (DMP Platform)
