<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (jm)</title>
    <link>https://pinboard.in/u:jm/public/</link>
    <description>recent bookmarks from jm</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://platform.openai.com/docs/guides/embeddings/what-are-embeddings"/>
	<rdf:li rdf:resource="https://aws.amazon.com/about-aws/whats-new/2020/03/build-k-nearest-neighbor-similarity-search-engine-with-amazon-elasticsearch/"/>
	<rdf:li rdf:resource="https://nelsonslog.wordpress.com/2020/01/07/facial-recognition-for-the-public-yandex/"/>
	<rdf:li rdf:resource="https://www.quora.com/On-what-basis-does-FFFFOUND-recommend-related-images"/>
	<rdf:li rdf:resource="http://stackoverflow.com/questions/843972/image-comparison-fast-algorithm/844113#844113"/>
	<rdf:li rdf:resource="https://vividcortex.com/blog/2015/03/05/analyzing-related-metrics-with-vividcortex/"/>
	<rdf:li rdf:resource="http://www.mlsec.org/harry/"/>
	<rdf:li rdf:resource="http://www.fmwconcepts.com/imagemagick/similar/index.php"/>
	<rdf:li rdf:resource="http://petermblair.com/fbl-n-gram-analyzer/"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://platform.openai.com/docs/guides/embeddings/what-are-embeddings">
    <title>Vector Embeddings</title>
    <dc:date>2023-10-03T10:24:40+00:00</dc:date>
    <link>https://platform.openai.com/docs/guides/embeddings/what-are-embeddings</link>
    <dc:creator>jm</dc:creator><description><![CDATA[Interesting technique from the LLM community to search, cluster and classify text strings:

<blockquote>
Text [vector] embeddings measure the relatedness of text strings. Embeddings are commonly used for:

Search (where results are ranked by relevance to a query string);
Clustering (where text strings are grouped by similarity);
Recommendations (where items with related text strings are recommended);
Anomaly detection (where outliers with little relatedness are identified);
Diversity measurement (where similarity distributions are analyzed);
Classification (where text strings are classified by their most similar label);

An embedding is a vector (list) of floating point numbers. The distance between two vectors measures their relatedness. Small distances suggest high relatedness and large distances suggest low relatedness.
</blockquote>

Commonly used as a storage format in vector databases (cf. https://vercel.com/guides/vector-databases).  Search using text embeddings is therefore implemented using cosine similarity or k-nearest neighbour to find vector similarity.

Looks like https://www.trychroma.com/ is the current open source vector DB of choice, at the moment.

(via Simon Willison)]]></description>
<dc:subject>ai openai via:simonw vector-embeddings text-embeddings text storage databases search similarity clustering recommendations anomaly-detection classification vector-databases</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:95c03aa49119/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:ai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:openai"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:via:simonw"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:vector-embeddings"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:text-embeddings"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:text"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:storage"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:databases"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:clustering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:recommendations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:anomaly-detection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:vector-databases"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://aws.amazon.com/about-aws/whats-new/2020/03/build-k-nearest-neighbor-similarity-search-engine-with-amazon-elasticsearch/">
    <title>k-Nearest Neighbor (k-NN) similarity search engine with Amazon Elasticsearch</title>
    <dc:date>2020-03-04T11:48:22+00:00</dc:date>
    <link>https://aws.amazon.com/about-aws/whats-new/2020/03/build-k-nearest-neighbor-similarity-search-engine-with-amazon-elasticsearch/</link>
    <dc:creator>jm</dc:creator><description><![CDATA[Well, that's handy:

<blockquote>Amazon Elasticsearch Service now offers k-Nearest Neighbor (k-NN) search which can enhance search by similarity use cases like product recommendations, fraud detection, and image, video and semantic document retrieval. Built using the lightweight and efficient Non-Metric Space Library (NMSLIB), k-NN enables high scale, low latency nearest neighbor search on billions of documents across thousands of dimensions with the same ease as running any regular Elasticsearch query.  </blockquote>

]]></description>
<dc:subject>elasticsearch aws knn algorithms similarity searching search nmslib</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:1ac9f1d202a0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:elasticsearch"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:aws"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:knn"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:searching"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:nmslib"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://nelsonslog.wordpress.com/2020/01/07/facial-recognition-for-the-public-yandex/">
    <title>Facial recognition for the public: Yandex</title>
    <dc:date>2020-01-08T20:58:09+00:00</dc:date>
    <link>https://nelsonslog.wordpress.com/2020/01/07/facial-recognition-for-the-public-yandex/</link>
    <dc:creator>jm</dc:creator><description><![CDATA[not such much via, as from, Nelson:

<blockquote>You can use Yandex Image Search right now as a pretty good facial recognition system for anyone who has labelled photos on the Web. I believe this is the first generally accessible facial recognition system with a large database. Yandex isn’t designed for this purpose. The trick is to upload photos cropped to a face and it’ll work more or less to find similar faces.</blockquote>

this is really odd. Definitely seems like they designed the image similarity engine to support faces as a special case.]]></description>
<dc:subject>privacy face-recognition yandex search similarity images web</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:3a385d71b7b1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:privacy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:face-recognition"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:yandex"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:images"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:web"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.quora.com/On-what-basis-does-FFFFOUND-recommend-related-images">
    <title>On what basis does FFFFOUND! recommend related images? - Quora</title>
    <dc:date>2017-04-13T20:53:10+00:00</dc:date>
    <link>https://www.quora.com/On-what-basis-does-FFFFOUND-recommend-related-images</link>
    <dc:creator>jm</dc:creator><description><![CDATA[by the URL!  totally not what I expected!]]></description>
<dc:subject>ffffound images similarity algorithms via:pheezy mltshp quora</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:6b6c3508dac8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:ffffound"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:images"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:via:pheezy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:mltshp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:quora"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stackoverflow.com/questions/843972/image-comparison-fast-algorithm/844113#844113">
    <title>Image comparison algorithms</title>
    <dc:date>2017-04-12T21:22:06+00:00</dc:date>
    <link>http://stackoverflow.com/questions/843972/image-comparison-fast-algorithm/844113#844113</link>
    <dc:creator>jm</dc:creator><description><![CDATA[Awesome StackOverflow answer for detecting "similar" images -- promising approach to reimplement ffffound's similarity feature in mltshp, maybe]]></description>
<dc:subject>algorithms hashing comparison diff images similarity search ffffound mltshp</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:7cb94c5de107/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:hashing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:comparison"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:diff"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:images"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:search"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:ffffound"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:mltshp"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://vividcortex.com/blog/2015/03/05/analyzing-related-metrics-with-vividcortex/">
    <title>VividCortex uses K-Means Clustering to discover related metrics</title>
    <dc:date>2015-03-05T21:50:41+00:00</dc:date>
    <link>https://vividcortex.com/blog/2015/03/05/analyzing-related-metrics-with-vividcortex/</link>
    <dc:creator>jm</dc:creator><description><![CDATA[After selecting an interesting spike in a metric, the algorithm can automate picking out a selection of other metrics which spiked at the same time.  I can see that being pretty damn useful]]></description>
<dc:subject>metrics k-means-clustering clustering algorithms discovery similarity vividcortex analysis data</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:71d69a91d3df/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:metrics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:k-means-clustering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:clustering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:discovery"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:vividcortex"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:data"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.mlsec.org/harry/">
    <title>Harry - A Tool for Measuring String Similarity</title>
    <dc:date>2014-01-20T15:43:05+00:00</dc:date>
    <link>http://www.mlsec.org/harry/</link>
    <dc:creator>jm</dc:creator><description><![CDATA[<blockquote>a small tool for comparing strings and measuring their similarity. The tool supports several common distance and kernel functions for strings as well as some exotic similarity measures. The focus of Harry lies on implicit similarity measures, that is, comparison functions that do not give rise to an explicit vector space. Examples of such similarity measures are the Levenshtein distance and the Jaro-Winkler distance.
For comparison Harry loads a set of strings from input, computes the specified similarity measure and writes a matrix of similarity values to output. The similarity measure can be computed based on the granularity of characters as well as words contained in the strings. The configuration of this process, such as the input format, the similarity measure and the output format, are specified in a configuration file and can be additionally refined using command-line options.
Harry is implemented using OpenMP, such that the computation time for a set of strings scales linear with the number of available CPU cores. Moreover, efficient implementations of several similarity measures, effective caching of similarity values and low-overhead locking further speedup the computation.</blockquote>

via kragen.]]></description>
<dc:subject>via:kragen strings similarity levenshtein-distance algorithms openmp jaro-winkler edit-distance cli commandline hamming-distance compression</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:7f75587e4bd7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:via:kragen"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:strings"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:levenshtein-distance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:openmp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:jaro-winkler"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:edit-distance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:cli"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:commandline"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:hamming-distance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:compression"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.fmwconcepts.com/imagemagick/similar/index.php">
    <title>Fred's ImageMagick Scripts: SIMILAR</title>
    <dc:date>2013-04-19T12:23:54+00:00</dc:date>
    <link>http://www.fmwconcepts.com/imagemagick/similar/index.php</link>
    <dc:creator>jm</dc:creator><description><![CDATA[compute an image-similarity metric, to discover mostly-identical-but-slightly-tweaked images:

<blockquote>SIMILAR computes the normalized cross correlation similarity metric between two equal dimensioned images. The normalized cross correlation metric measures how similar two images are, not how different they are. The range of ncc metric values is between 0 (dissimilar) and 1 (similar). If mode=g, then the two images will be converted to grayscale. If mode=rgb, then the two images first will be converted to colorspace=rgb. Next, the ncc similarity metric will be computed for each channel. Finally, they will be combined into an rms value.</blockquote>

(via Dan O'Neill)]]></description>
<dc:subject>image photos pictures similar imagemagick via:dano metrics similarity</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:b8099e62ccd6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:image"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:photos"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:pictures"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similar"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:imagemagick"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:via:dano"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:metrics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://petermblair.com/fbl-n-gram-analyzer/">
    <title>feedback loop n-gram analyzer</title>
    <dc:date>2011-09-29T21:10:15+00:00</dc:date>
    <link>http://petermblair.com/fbl-n-gram-analyzer/</link>
    <dc:creator>jm</dc:creator><description><![CDATA['a simple parser of ARF compliant FBL complaints, which normalizes the email complaints and generates a 6-tuple n-gram version of the message. These n-grams are stored in a Redis database, keyed by the file in which they can be found. An inverse index also exists that allow you to find all messages containing a particular n-gram word.'
]]></description>
<dc:subject>anti-spam spam fbl feedback filtering n-grams similarity hashing redis searching</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:jm/b:00bea3b79665/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:anti-spam"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:spam"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:fbl"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:feedback"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:filtering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:n-grams"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:similarity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:hashing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:redis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:jm/t:searching"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>