Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,973,664 papers from all fields of science
Search
Sign In
Create Free Account
Similarity measure
Known as:
Similarity
, Similarity function
, Similarity matrix
In statistics and related fields, a similarity measure or similarity function is a real-valued function that quantifies the similarity between two…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Affinity propagation
BLOSUM
Cluster analysis
Cosine similarity
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
A similarity measure for indefinite rankings
William Webber
,
Alistair Moffat
,
J. Zobel
TOIS
2010
Corpus ID: 16050561
Ranked lists are encountered in research and daily life and it is often of interest to compare these lists even when they are…
Expand
Highly Cited
2007
Highly Cited
2007
Measuring semantic similarity between words using web search engines
Danushka Bollegala
,
Y. Matsuo
,
M. Ishizuka
The Web Conference
2007
Corpus ID: 13481083
Semantic similarity measures play important roles in information retrieval and Natural Language Processing. Previous work in…
Expand
Review
2003
Review
2003
Requirements for a cocitation similarity measure, with special reference to Pearson's correlation coefficient
P. Ahlgren
,
Bo Jarneving
,
R. Rousseau
J. Assoc. Inf. Sci. Technol.
2003
Corpus ID: 582140
Author cocitation analysis (ACA), a special type of cocitation analysis, was introduced by White and Griffith in 1981. This…
Expand
Highly Cited
2002
Highly Cited
2002
SimRank: a measure of structural-context similarity
Glen Jeh
,
J. Widom
Knowledge Discovery and Data Mining
2002
Corpus ID: 5704492
The problem of measuring "similarity" of objects arises in many applications, and many domain-specific measures have been…
Expand
Highly Cited
2002
Highly Cited
2002
Unsupervised Feature Selection Using Feature Similarity
Pabitra Mitra
,
C. A. Murthy
,
S. Pal
IEEE Transactions on Pattern Analysis and Machine…
2002
Corpus ID: 536023
In this article, we describe an unsupervised feature selection algorithm suitable for data sets, large in both dimension and size…
Expand
Highly Cited
2000
Highly Cited
2000
Shape Similarity Measure Based on Correspondence of Visual Parts
Longin Jan Latecki
,
Rolf Lakämper
IEEE Transactions on Pattern Analysis and Machine…
2000
Corpus ID: 1625245
A cognitively motivated similarity measure is presented and its properties are analyzed with respect to retrieval of similar…
Expand
Highly Cited
1999
Highly Cited
1999
Similarity Measures
S. Santini
,
R. Jain
IEEE Transactions on Pattern Analysis and Machine…
1999
Corpus ID: 11196857
With complex multimedia data, we see the emergence of database systems in which the fundamental operation is similarity…
Expand
Highly Cited
1998
Highly Cited
1998
The Correlation Ratio as a New Similarity Measure for Multimodal Image Registration
A. Roche
,
G. Malandain
,
X. Pennec
,
N. Ayache
International Conference on Medical Image…
1998
Corpus ID: 12545893
Over the last five years, new “voxel-based” approaches have allowed important progress in multimodal image registration, notably…
Expand
Review
1998
Review
1998
Chemical Similarity Searching
P. Willett
,
J. Barnard
,
G. Downs
Journal of chemical information and computer…
1998
Corpus ID: 49710
This paper reviews the use of similarity searching in chemical databases. It begins by introducing the concept of similarity…
Expand
Highly Cited
1973
Highly Cited
1973
Clustering Using a Similarity Measure Based on Shared Near Neighbors
R. Jarvis
,
E. Patrick
IEEE transactions on computers
1973
Corpus ID: 9540064
A nonparametric clustering technique incorporating the concept of similarity based on the sharing of near neighbors is presented…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE