Statistical treatment of the information content of a database
Information Systems
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
The Normalized String Editing Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Machine Learning
Polynomial-Time Metrics for Attributed Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Normalized Similarity Metric and Its Applications
BIBM '07 Proceedings of the 2007 IEEE International Conference on Bioinformatics and Biomedicine
IEEE Transactions on Information Theory
Information Sciences: an International Journal
A Multi-Criteria Metric Algorithm for Recommender Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Algorithms for local similarity between forests
Journal of Combinatorial Optimization
Lattice Machine Classification based on Contextual Probability
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 5.24 |
Similarity and dissimilarity measures are widely used in many research areas and applications. When a dissimilarity measure is used, it is normally required to be a distance metric. However, when a similarity measure is used, there is no formal requirement. In this article, we have three contributions. First, we give a formal definition of similarity metric. Second, we show the relationship between similarity metric and distance metric. Third, we present general solutions to normalize a given similarity metric or distance metric.