Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,531,639 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.
2018
2018
Krishna Sudarsana: A Z-Space Similarity Measure
V. Radhakrishna
,
P. Kumar
,
V. Janaki
2018
Corpus ID: 51930952
Similarity profiled association mining from time stamped transaction databases is an important topic of research relatively less…
Expand
Highly Cited
2016
Highly Cited
2016
A similarity measure for outlier detection in timestamped temporal databases
V. Radhakrishna
,
Puligadda Veereswara Kumar
,
V. Janaki
,
Shadi A. Aljawarneh
International Conference on Engineering & MIS…
2016
Corpus ID: 20100664
Outlier Detection is one of the important research problems in temporal data mining. A pattern in time stamped temporal database…
Expand
2016
2016
Looking into the possibility of novel dissimilarity measure to discover similarity profiled temporal association patterns in IoT
V. Radhakrishna
,
Puligadda Veereswara Kumar
,
V. Janaki
International Conference on Engineering & MIS…
2016
Corpus ID: 10269695
The main objective is to address the possibility of designing a similarity measure and using the same to find temporal similarity…
Expand
Highly Cited
2015
Highly Cited
2015
SAR Images Retrieval Based on Semantic Classification and Region-Based Similarity Measure for Earth Observation
L. Jiao
,
Xu Tang
,
B. Hou
,
Shuang Wang
IEEE Journal of Selected Topics in Applied Earth…
2015
Corpus ID: 24941926
Based on the semantic categorization and region-based similarity measure, a novel synthetic aperture radar (SAR) image retrieval…
Expand
Highly Cited
2012
Highly Cited
2012
Fuzzy Risks Analysis Based on Similarity Measures of Generalized Fuzzy Numbers
Liansen Zhu
,
Ruo-ning Xu
2012
Corpus ID: 118010918
In this paper, we present a novel method for fuzzy risk analysis based on a new similarity measure of generalized fuzzy numbers…
Expand
Highly Cited
2011
Highly Cited
2011
Applying RBR and CBR to develop a VR based integrated system for machining fixture design
Gaoliang Peng
,
G. Chen
,
Chong Wu
,
Hou Xin
,
Yang Jiang
Expert systems with applications
2011
Corpus ID: 37585713
Highly Cited
2008
Highly Cited
2008
Ontology Matching with CIDER: Evaluation Report for the OAEI 2008
J. Gracia
,
E. Mena
Organizational Memories
2008
Corpus ID: 1618499
Ontology matching, the task of determining relations that hold among terms of two different ontologies, is a key issue in the…
Expand
Highly Cited
2005
Highly Cited
2005
The threshold join algorithm for top-k queries in distributed sensor networks
D. Zeinalipour-Yazti
,
Zografoula Vagena
,
+5 authors
D. Srivastava
Data Management for Sensor Networks
2005
Corpus ID: 7937788
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for…
Expand
Highly Cited
2001
Highly Cited
2001
An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
Hsuan-Shih Lee
Fuzzy Sets Syst.
2001
Corpus ID: 7478911
Highly Cited
1989
Highly Cited
1989
Patterns of genetic variation of the genusCapsicum (Solanaceae) in Mexico
F. Loaiza-Figueroa
,
K. Ritland
,
J. Cancino
,
S. Tanksley
Plant Systematics and Evolution
1989
Corpus ID: 36711666
The evolutionary relationships of 186 accessions ofCapsicum from Mexico were studied through enzyme electrophoresis. A total of…
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