Similarity measure

<h2 id="use-of-different-similarity-measure-formulas">Use of different similarity measure formulas</h2>
Different types of similarity measures exist for various types of objects, depending on the objects being compared. For each type of object there are various similarity measurement formulas.<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a>
Similarity between two data points

There are many various options available when it comes to finding similarity between two data points, some of which are a combination of other similarity methods. Some of the methods for similarity measures between two data points include Euclidean distance, Manhattan distance, Minkowski distance, and Chebyshev distance. The Euclidean distance formula is used to find the distance between two points on a plane, which is visualized in the image below. Manhattan distance is commonly used in <a href="/facts/GPS/DKVLnzF3">GPS</a> applications, as it can be used to find the shortest route between two addresses.
When you generalize the Euclidean distance formula and Manhattan distance formula you are left with the <a href="/facts/Minkowski_distance/4KXAMfE2">Minkowski distance</a> formulas, which can be used in a wide variety of applications.

<ul><li><a href="/facts/Euclidean_distance/9qDoQKQe">Euclidean distance</a></li>
<li><a href="/facts/Manhattan_distance/zU7gGUPv">Manhattan distance</a></li>
<li><a href="/facts/Minkowski_distance/4KXAMfE2">Minkowski distance</a></li>
<li><a href="/facts/Chebyshev_distance/uEJTuAQ5">Chebyshev distance</a></li></ul>
Similarity between strings
For comparing strings, there are various measures of <a href="/facts/String_metric/hAteGu4J">string similarity</a> that can be used. Some of these methods include edit distance, Levenshtein distance, Hamming distance, and Jaro distance. The best-fit formula is dependent on the requirements of the application. For example, edit distance is frequently used for <a href="/facts/Natural_language_processing/1hjMKsSN">natural language processing</a> applications and features, such as spell-checking. Jaro distance is commonly used in record linkage to compare first and last names to other sources.

<ul><li><a href="/facts/Edit_distance/P8qVBmAD">Edit distance</a></li>
<li><a href="/facts/Levenshtein_distance/F0otyNSl">Levenshtein distance</a></li>
<li><a href="/facts/Lee_distance/IsL0SPpS">Lee distance</a></li>
<li><a href="/facts/Hamming_distance/MgdtbYPo">Hamming distance</a></li>
<li><a href="/facts/Jaro_distance/IpG3X2FW">Jaro distance</a></li></ul>
Similarity between two probability distributions
Typical measures of similarity for <a href="/facts/Probability_distributions/EpsKKVRu">probability distributions</a> are the <a href="/facts/Bhattacharyya_distance/3kw3a7SF">Bhattacharyya distance</a> and the <a href="/facts/Hellinger_distance/nmIlcIGn">Hellinger distance</a>. Both provide a quantification of similarity for two probability distributions on the same domain, and they are mathematically closely linked. The Bhattacharyya distance does not fulfill the <a href="/facts/Triangle_inequality/KubLjkwr">triangle inequality</a>, meaning it does not form a <a href="/facts/Metric_space/gnBBRXtc">metric</a>. The Hellinger distance does form a metric on the space of probability distributions.

<ul><li><a href="/facts/Bhattacharyya_distance/3kw3a7SF">Bhattacharyya distance</a></li>
<li><a href="/facts/Hellinger_distance/nmIlcIGn">Hellinger distance</a></li></ul>
Similarity between two sets
The <a href="/facts/Jaccard_index/dUurmTet">Jaccard index</a> formula measures the similarity between two <a href="/facts/Set_(mathematics)/BfucfHMq">sets</a> based on the number of items that are present in both sets relative to the total number of items. It is commonly used in <a href="/facts/Recommendation_systems/HjodW6nS">recommendation systems</a> and <a href="/facts/Social_media_analysis/dQbKDaBh">social media analysis</a>. The <a href="/facts/S%C3%B8rensen%E2%80%93Dice_coefficient/rwLufgya">Sørensen–Dice coefficient</a> also compares the number of items in both sets to the total number of items present but the weight for the number of shared items is larger. The Sørensen–Dice coefficient is commonly used in <a href="/facts/Biology/1M1ee3pB">biology</a> applications, measuring the similarity between two sets of genes or species.

<ul><li><a href="/facts/Jaccard_index/dUurmTet">Jaccard index</a></li>
<li><a href="/facts/S%C3%B8rensen%E2%80%93Dice_coefficient/rwLufgya">Sørensen–Dice coefficient</a></li></ul>
Similarity between two sequences
When comparing temporal sequences (time series), some similarity measures must additionally account for similarity of two sequences that are not fully aligned.

<ul><li><a href="/facts/Dynamic_time_warping/guEHSMw4">Dynamic time warping</a></li></ul>
<h2 id="use-in-clustering">Use in clustering</h2>
See also: <a href="/facts/Hierarchical_clustering/KxXs6GPK">Hierarchical clustering § Similarity metric</a>
Clustering or <a href="/facts/Cluster_analysis/HUeDnWPt">Cluster analysis</a> is a data mining technique that is used to discover patterns in data by grouping similar objects together. It involves partitioning a set of data points into groups or clusters based on their similarities. One of the fundamental aspects of clustering is how to measure similarity between data points.
Similarity measures play a crucial role in many clustering techniques, as they are used to determine how closely related two data points are and whether they should be grouped together in the same cluster. A similarity measure can take many different forms depending on the type of data being clustered and the specific problem being solved.
One of the most commonly used similarity measures is the <a href="/facts/Euclidean_distance/9qDoQKQe">Euclidean distance</a>, which is used in many clustering techniques including <a href="/facts/K-means_clustering/vxIcqHwN">K-means clustering</a> and <a href="/facts/Hierarchical_clustering/KxXs6GPK">Hierarchical clustering</a>. The Euclidean distance is a measure of the straight-line distance between two points in a high-dimensional space. It is calculated as the square root of the sum of the squared differences between the corresponding coordinates of the two points. For example, if we have two data points 
 
 
 
 (
 
 x
 
 1
 
 
 ,
 
 y
 
 1
 
 
 )
 
 
 {\displaystyle (x_{1},y_{1})}
 
 and 
 
 
 
 (
 
 x
 
 2
 
 
 ,
 
 y
 
 2
 
 
 )
 
 
 {\displaystyle (x_{2},y_{2})}
 
, the Euclidean distance between them is 
 
 
 
 d
 =
 √
 [
 (
 
 x
 
 2
 
 
 −
 
 x
 
 1
 
 
 
 )
 
 2
 
 
 +
 (
 
 y
 
 2
 
 
 −
 
 y
 
 1
 
 
 
 )
 
 2
 
 
 ]
 
 
 {\displaystyle d=\surd [(x_{2}-x_{1})^{2}+(y_{2}-y_{1})^{2}]}
 
.

Another commonly used similarity measure is the <a href="/facts/Jaccard_index/dUurmTet">Jaccard index</a> or Jaccard similarity, which is used in clustering techniques that work with binary data such as presence/absence data <a class="footnote-ref" id="fnref:3" href="#fn:3">3</a> or Boolean data; The Jaccard similarity is particularly useful for clustering techniques that work with text data, where it can be used to identify clusters of similar documents based on their shared features or keywords.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a> It is calculated as the size of the intersection of two sets divided by the size of the union of the two sets: 
 
 
 
 J
 (
 A
 ,
 B
 )
 =
 
 
 
 A
 ⋂
 B
 
 
 A
 ⋃
 B
 
 
 
 
 
 {\displaystyle J(A,B)={A\bigcap B \over A\bigcup B}}
 
.
Similarities among 162 Relevant Nuclear Profile are tested using the Jaccard Similarity measure (see figure with heatmap). The Jaccard similarity of the nuclear profile ranges from 0 to 1, with 0 indicating no similarity between the two sets and 1 indicating perfect similarity with the aim of clustering the most similar nuclear profile.
Manhattan distance, also known as <a href="/facts/Taxicab_geometry/zU7gGUPv">Taxicab geometry</a>, is a commonly used similarity measure in clustering techniques that work with continuous data. It is a measure of the distance between two data points in a high-dimensional space, calculated as the sum of the absolute differences between the corresponding coordinates of the two points 
 
 
 
 
 |
 
 
 x
 
 1
 
 
 −
 
 x
 
 2
 
 
 
 |
 
 +
 
 |
 
 
 y
 
 1
 
 
 −
 
 y
 
 2
 
 
 
 |
 
 
 
 {\displaystyle \left\vert x_{1}-x_{2}\right\vert +\left\vert y_{1}-y_{2}\right\vert }
 
.
When dealing with mixed-type data, including nominal, ordinal, and numerical attributes per object, <a href="/facts/Gower%27s_distance/HpnqMCNE">Gower's distance</a> (or similarity) is a common choice as it can handle different types of variables implicitly. It first computes similarities between the pair of variables in each object, and then combines those similarities to a single weighted average per object-pair. As such, for two objects 
 
 
 
 i
 
 
 {\displaystyle i}
 
 and 
 
 
 
 j
 
 
 {\displaystyle j}
 
 having 
 
 
 
 p
 
 
 {\displaystyle p}
 
 descriptors, the similarity 
 
 
 
 S
 
 
 {\displaystyle S}
 
 is defined as: 
 
 
 
 
 S
 
 i
 j
 
 
 =
 
 
 
 
 ∑
 
 k
 =
 1
 
 
 p
 
 
 
 w
 
 i
 j
 k
 
 
 
 s
 
 i
 j
 k
 
 
 
 
 
 ∑
 
 k
 =
 1
 
 
 p
 
 
 
 w
 
 i
 j
 k
 
 
 
 
 
 ,
 
 
 {\displaystyle S_{ij}={\frac {\sum _{k=1}^{p}w_{ijk}s_{ijk}}{\sum _{k=1}^{p}w_{ijk}}},}
 
 where the 
 
 
 
 
 w
 
 i
 j
 k
 
 
 
 
 {\displaystyle w_{ijk}}
 
 are non-negative weights and 
 
 
 
 
 s
 
 i
 j
 k
 
 
 
 
 {\displaystyle s_{ijk}}
 
 is the similarity between the two objects regarding their 
 
 
 
 k
 
 
 {\displaystyle k}
 
-th variable.
In <a href="/facts/Spectral_clustering/GorfFMRT">spectral clustering</a>, a similarity, or affinity, measure is used to transform data to overcome difficulties related to lack of convexity in the shape of the data distribution.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> The measure gives rise to an 
 
 
 
 (
 n
 ,
 n
 )
 
 
 {\displaystyle (n,n)}
 
-sized similarity matrix for a set of n points, where the entry 
 
 
 
 (
 i
 ,
 j
 )
 
 
 {\displaystyle (i,j)}
 
 in the matrix can be simply the (reciprocal of the) <a href="/facts/Euclidean_distance/9qDoQKQe">Euclidean distance</a> between 
 
 
 
 i
 
 
 {\displaystyle i}
 
 and 
 
 
 
 j
 
 
 {\displaystyle j}
 
, or it can be a more complex measure of distance such as the Gaussian 
 
 
 
 
 e
 
 −
 ‖
 
 s
 
 1
 
 
 −
 
 s
 
 2
 
 
 
 ‖
 
 2
 
 
 
 /
 
 2
 
 σ
 
 2
 
 
 
 
 
 
 {\displaystyle e^{-\|s_{1}-s_{2}\|^{2}/2\sigma ^{2}}}
 
.<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a> Further modifying this result with network analysis techniques is also common.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a>
The choice of similarity measure depends on the type of data being clustered and the specific problem being solved. For example, working with continuous data such as gene expression data, the Euclidean distance or cosine similarity may be appropriate. If working with binary data such as the presence of a genomic loci in a nuclear profile, the Jaccard index may be more appropriate. Lastly, working with data that is arranged in a grid or lattice structure, such as image or signal processing data, the Manhattan distance is particularly useful for the clustering.

<h2 id="use-in-recommender-systems">Use in recommender systems</h2>
Similarity measures are used to develop <a href="/facts/Recommender_systems/HjodW6nS">recommender systems</a>. It observes a user's perception and liking of multiple items. On recommender systems, the method is using a distance calculation such as Euclidean Distance or Cosine Similarity to generate a similarity matrix with values representing the similarity of any pair of targets. Then, by analyzing and comparing the values in the matrix, it is possible to match two targets to a user's preference or link users based on their marks. In this system, it is relevant to observe the value itself and the absolute distance between two values.<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a> Gathering this data can indicate a mark's likeliness to a user as well as how mutually closely two marks are either rejected or accepted. It is possible then to recommend to a user targets with high similarity to the user's likes.
Recommender systems are observed in multiple online entertainment platforms, in social media and streaming websites. The logic for the construction of this systems is based on similarity measures.

<h2 id="use-in-sequence-alignment">Use in sequence alignment</h2>
Similarity matrices are used in <a href="/facts/Sequence_alignment/p8GQfF7b">sequence alignment</a>. Higher scores are given to more-similar characters, and lower or negative scores for dissimilar characters.
<a href="/facts/Nucleotide/pQKEwlJI">Nucleotide</a> similarity matrices are used to align <a href="/facts/Nucleic_acid/2tTgcI0v">nucleic acid</a> sequences. Because there are only four nucleotides commonly found in <a href="/facts/DNA/nB89Iauz">DNA</a> (<a href="/facts/Adenine/PSeDFBnl">Adenine</a> (A), <a href="/facts/Cytosine/JW20j33u">Cytosine</a> (C), <a href="/facts/Guanine/hoTSpz0x">Guanine</a> (G) and <a href="/facts/Thymine/A5C8MnLN">Thymine</a> (T)), nucleotide similarity matrices are much simpler than <a href="/facts/Protein/Jxmagu3E">protein</a> similarity matrices. For example, a simple matrix will assign identical bases a score of +1 and non-identical bases a score of −1. A more complicated matrix would give a higher score to transitions (changes from a <a href="/facts/Pyrimidine/uFRSB8Cq">pyrimidine</a> such as C or T to another pyrimidine, or from a <a href="/facts/Purine/9ogLp0Wc">purine</a> such as A or G to another purine) than to transversions (from a pyrimidine to a purine or vice versa).
The match/mismatch ratio of the matrix sets the target evolutionary distance.<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a><a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> The +1/−3 DNA matrix used by BLASTN is best suited for finding matches between sequences that are 99% identical; a +1/−1 (or +4/−4) matrix is much more suited to sequences with about 70% similarity. Matrices for lower similarity sequences require longer sequence alignments.
<a href="/facts/Amino_acid/WDxYwBny">Amino acid</a> similarity matrices are more complicated, because there are 20 amino acids coded for by the <a href="/facts/Genetic_code/zUK0bY1B">genetic code</a>, and so a larger number of possible substitutions. Therefore, the similarity matrix for amino acids contains 400 entries (although it is usually <a href="/facts/Symmetric_matrix/08CGwjNl">symmetric</a>). The first approach scored all amino acid changes equally. A later refinement was to determine amino acid similarities based on how many base changes were required to change a codon to code for that amino acid. This model is better, but it doesn't take into account the selective pressure of amino acid changes. Better models took into account the chemical properties of amino acids.
One approach has been to empirically generate the similarity matrices. The <a href="/facts/Margaret_Oakley_Dayhoff/9sdw0XJx">Dayhoff</a> method used phylogenetic trees and sequences taken from species on the tree. This approach has given rise to the <a href="/facts/Point_accepted_mutation/WAauk886">PAM</a> series of matrices. PAM matrices are labelled based on how many nucleotide changes have occurred, per 100 amino acids. 
While the PAM matrices benefit from having a well understood evolutionary model, they are most useful at short evolutionary distances (PAM10–PAM120). At long evolutionary distances, for example PAM250 or 20% identity, it has been shown that the <a href="/facts/BLOSUM/a6VvFJHL">BLOSUM</a> matrices are much more effective.
The BLOSUM series were generated by comparing a number of divergent sequences. The BLOSUM series are labeled based on how much entropy remains unmutated between all sequences, so a lower BLOSUM number corresponds to a higher PAM number.

<h2 id="use-in-computer-vision">Use in computer vision</h2>
This section is an excerpt from <a href="/facts/Content-based_image_retrieval/AQpmsoGE">Content-based image retrieval § Content comparison using image distance measures</a>.[<a href="https://en.wikipedia.org/w/index.php?title=Content-based_image_retrieval&action=edit">edit</a>]
The most common method for comparing two images in content-based image retrieval (typically an example image and an image from the database) is using an image distance measure. An image distance measure compares the similarity of two images in various dimensions such as color, texture, shape, and others. For example, a distance of 0 signifies an exact match with the query, with respect to the dimensions that were considered. As one may intuitively gather, a value greater than 0 indicates various degrees of similarities between the images. Search results then can be sorted based on their distance to the queried image.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a> Many measures of image distance (Similarity Models) have been developed.<a class="footnote-ref" id="fnref:12" href="#fn:12">12</a>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Affinity_propagation/9DuNcP6K">Affinity propagation</a> – Algorithm in data mining</li>
<li><a href="/facts/Latent_space/IDYfRCU7">Latent space</a> – Embedding of data within a manifold based on a similarity function</li>
<li><a href="/facts/Similarity_learning/peRWFSl4">Similarity learning</a> – Supervised learning of a similarity function</li>
<li><a href="/facts/Self-similarity_matrix/jlqLJ1fJ">Self-similarity matrix</a></li>
<li><a href="/facts/Semantic_similarity/wuInaoaB">Semantic similarity</a> – Natural language processing</li>
<li><a href="/facts/Similarity_(network_science)/TdCJbRfX">Similarity (network science)</a> – in network analysis, when two nodes (or other more elaborate structures) fall in the same equivalence classPages displaying wikidata descriptions as a fallback</li>
<li><a href="/facts/Similarity_(philosophy)/stgfoWBh">Similarity (philosophy)</a> – Relation of resemblance between objects</li>
<li><a href="/facts/Statistical_distance/u6kgN8Dc">Statistical distance</a> – Distance between two statistical objects</li>
<li><a href="/facts/String_metric/hAteGu4J">String metric</a> – Metric that measures the distance between two strings of text</li>
<li><a href="/facts/Similarity_search/L55wjqpJ">Similarity search</a> – Searching for similar items in a data set</li>
<li><a href="/facts/Tf%E2%80%93idf/JDzc5Jnr">tf–idf</a> – Estimate of the importance of a word in a document</li>
<li><a href="/facts/Recurrence_plot/AxSDcekL">Recurrence plot</a>, a visualization tool of recurrences in dynamical (and other) systems</li></ul>

<ul><li>F. Gregory Ashby; Daniel M. Ennis (2007). <a href="https://doi.org/10.4249%2Fscholarpedia.4116">"Similarity measures"</a>. Scholarpedia. 2 (12): 4116. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2007SchpJ...2.4116A">2007SchpJ...2.4116A</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.4249%2Fscholarpedia.4116">10.4249/scholarpedia.4116</a>.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Vert, Jean-Philippe; Tsuda, Koji; Schölkopf, Bernhard (2004). "A primer on kernel methods" (PDF). Kernel Methods in Computational Biology. <a href="/wiki/Bernhard_Sch%C3%B6lkopf" target="_blank">/wiki/Bernhard_Sch%C3%B6lkopf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">https://iq.opengenus.org/similarity-measurements/ "Different Types of Similarity measurements" <a href="https://iq.opengenus.org/similarity-measurements/" target="_blank">https://iq.opengenus.org/similarity-measurements/</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Chung, Neo Christopher; Miasojedow, BłaŻej; Startek, Michał; Gambin, Anna (2019). "Jaccard/Tanimoto similarity test and estimation methods for biological presence-absence data". BMC Bioinformatics. 20 (S15): 644. doi:10.1186/s12859-019-3118-5. ISSN 1471-2105. PMC 6929325. PMID 31874610. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6929325" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6929325</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">International MultiConference of Engineers and Computer Scientists : IMECS 2013 : 13-15 March, 2013, the Royal Garden Hotel, Kowloon, Hong Kong. S. I. Ao, International Association of Engineers. Hong Kong: Newswood Ltd. 2013. ISBN 978-988-19251-8-3. OCLC 842831996.{{cite book}}: CS1 maint: others (link) <a href="978-988-19251-8-3" target="_blank">978-988-19251-8-3</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Ng, A.Y.; Jordan, M.I.; Weiss, Y. (2001), "On Spectral Clustering: Analysis and an Algorithm", Advances in Neural Information Processing Systems, 14, MIT Press: 849–856 <a href="https://www.researchgate.net/publication/320413363" target="_blank">https://www.researchgate.net/publication/320413363</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Ng, A.Y.; Jordan, M.I.; Weiss, Y. (2001), "On Spectral Clustering: Analysis and an Algorithm", Advances in Neural Information Processing Systems, 14, MIT Press: 849–856 <a href="https://www.researchgate.net/publication/320413363" target="_blank">https://www.researchgate.net/publication/320413363</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Li, Xin-Ye; Guo, Li-Jie (2012), "Constructing affinity matrix in spectral clustering based on neighbor propagation", Neurocomputing, 97: 125–130, doi:10.1016/j.neucom.2012.06.023 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Bondarenko, Kirill (2019), Similarity metrics in recommender systems, retrieved 25 April 2023 <a href="https://bond-kirill-alexandrovich.medium.com/similarity-metrics-in-recommender-systems-aed9d3b2315f" target="_blank">https://bond-kirill-alexandrovich.medium.com/similarity-metrics-in-recommender-systems-aed9d3b2315f</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">States, D; Gish, W; Altschul, S (1991). "Improved sensitivity of nucleic acid database searches using application-specific scoring matrices". Methods: A Companion to Methods in Enzymology. 3 (1): 66. CiteSeerX 10.1.1.114.8183. doi:10.1016/S1046-2023(05)80165-3. <a href="/wiki/CiteSeerX_(identifier)" target="_blank">/wiki/CiteSeerX_(identifier)</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Sean R. Eddy (2004). "Where did the BLOSUM62 alignment score matrix come from?" (PDF). Nature Biotechnology. 22 (8): 1035–6. doi:10.1038/nbt0804-1035. PMID 15286655. S2CID 205269887. Archived from the original (PDF) on 2006-09-03. <a href="https://web.archive.org/web/20060903191751/http://informatics.umdnj.edu/bioinformatics/courses/5020/notes/BLOSUM62%20primer.pdf" target="_blank">https://web.archive.org/web/20060903191751/http://informatics.umdnj.edu/bioinformatics/courses/5020/notes/BLOSUM62%20primer.pdf</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Shapiro, Linda; George Stockman (2001). Computer Vision. Upper Saddle River, NJ: Prentice Hall. ISBN 978-0-13-030796-5. <a href="978-0-13-030796-5" target="_blank">978-0-13-030796-5</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Eidenberger, Horst (2011). "Fundamental Media Understanding", atpress. ISBN 978-3-8423-7917-6. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
</ol>

Similarity measure open-in-new

Similarity measure