distance – Page 2 – Andrew Fairless, Ph.D.

What I Read: Compare Two Ranked Lists

By Andrew Fairless on March 9, 2023January 30, 2023

https://towardsdatascience.com/how-to-objectively-compare-two-ranked-lists-in-python-b3d74e236f6a How to Objectively Compare Two Ranked Lists in PythonKrupesh RaikarJan 5 “Apart from the above movie viewing order disagreement, we are surrounded by examples of comparing lists!…. Ideally, aContinue readingWhat I Read: Compare Two Ranked Lists

What I Read: Dynamic Time Warping

By Andrew Fairless on July 6, 2022June 27, 2022

https://www.kdnuggets.com/2022/05/dynamic-time-warping-algorithm-time-series-explained.html Dynamic Time Warping Algorithm in Time Series, ExplainedBy Nagesh Singh ChauhanKDnuggetsMay 26, 2022 “In time series analysis, Dynamic Time Warping (DTW) is one of the algorithms for measuring theContinue readingWhat I Read: Dynamic Time Warping

What I Read: Understanding Levenshtein Distance

By Andrew Fairless on August 5, 2021July 12, 2021

https://medium.com/@ethannam/understanding-the-levenshtein-distance-equation-for-beginners-c4285a5604f0 Understanding the Levenshtein Distance Equation for BeginnersEthan NamFeb 26, 2019 “The Levenshtein distance is a number that tells you how different two strings are. The higher the number, theContinue readingWhat I Read: Understanding Levenshtein Distance

What I Read: Semantic Search

By Andrew Fairless on July 20, 2021July 2, 2021

https://www.pinecone.io/learn/semantic-search/ Semantic Search: Measuring Meaning From Jaccard to BertJames BriggsData Scientist “Similarity search is a complex topic and there are countless techniques for building effective search engines. In this article,Continue readingWhat I Read: Semantic Search

What I Read: Contrastive Representation Learning

By Andrew Fairless on July 1, 2021June 7, 2021

https://lilianweng.github.io/lil-log/2021/05/31/contrastive-representation-learning.html Contrastive Representation Learningby Lilian WengMay 31, 2021 “The goal of contrastive representation learning is to learn such an embedding space in which similar sample pairs stay close to eachContinue readingWhat I Read: Contrastive Representation Learning

What I Read: What is a Vector Database?

By Andrew Fairless on June 4, 2021May 14, 2021

https://www.pinecone.io/learn/vector-database/ What is a Vector Database?Rajat TripathiML Solutions Engineer “The meteoric rise in Machine Learning in the last few years has led to increasing use of vector embeddings…. The uniqueContinue readingWhat I Read: What is a Vector Database?

What I Read: Approximate Nearest Neighbor Search in Vespa

By Andrew Fairless on February 21, 2021January 26, 2021

https://blog.vespa.ai/approximate-nearest-neighbor-search-in-vespa-part-1/ Approximate Nearest Neighbor Search in Vespa – Part 1Geir StorliPrinciple Vespa Engineer “Searching for the nearest neighbors of a data point in a high dimensional vector space is anContinue readingWhat I Read: Approximate Nearest Neighbor Search in Vespa

What I Read: ScaNN, Efficient Vector Similarity Search

By Andrew Fairless on January 14, 2021December 23, 2020

https://www.googblogs.com/announcing-scann-efficient-vector-similarity-search/ Announcing ScaNN: Efficient Vector Similarity SearchPosted by Philip Sun, Software Engineer, Google Research “Based on this intuition, we more heavily penalize quantization error that is parallel to the originalContinue readingWhat I Read: ScaNN, Efficient Vector Similarity Search

Tag: distance