Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Distance matrix
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Evaluation of the similarity or dissimilarity of Cosine similarity and Distance matrices === [[File:SimilarityTOidistance.png|none|thumb|Conversion formula between cosine similarity and Euclidean distance]] *[https://www.sciencedirect.com/science/article/pii/S0020025507002630]* While the [[Cosine similarity]] measure is perhaps the most frequently applied proximity measure in information retrieval by measuring the angles between documents in the search space on the base of the cosine. Euclidean distance is invariant to mean-correction. The sampling distribution of a mean is generated by repeated sampling from the same population and recording of the sample means obtained. This forms a distribution of different means, and this distribution has its own mean and variance. For the data which can be negative as well as positive, the [[null distribution]] for cosine similarity is the distribution of the [[dot product]] of two independent random unit vectors. This distribution has a mean of zero and a variance of 1/n. While [[Euclidean distance]] will be invariant to this correction.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)