RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Program Systems: Theory and Applications:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Program Systems: Theory and Applications, 2017, Volume 8, Issue 4, Pages 347–357 (Mi ps286)  

This article is cited in 2 scientific papers (total in 2 papers)

Mathematical Foundations of Programming

Model and axioms for similarity metrics

S. V. Znamenskij

Ailamazyan Program Systems Institute of Russian Academy of Sciences

Abstract: Modern applications usually combine different similarity metrics taking into account the algorithms complexity, the peculiarities of human perception, data resources and samples. The optimization requires a unified formal description of the basic similarity metrics.
The system of the similarity metric axioms is enchanced and its universal model is constructed which generalizes known models of similarity that do not reduce to the Euclidean metric.    The model is based on a weighted partially ordered set. (In Russian).

Key words and phrases: similarity of strings, sequence alignment, edit distance, LCS, Levenshtein metric.

DOI: https://doi.org/10.25209/2079-3316-2017-8-4-347-357

Full text: PDF file (1250 kB)
References: PDF file   HTML file

UDC: 004.416
MSC: 97P20; 91C05, 91C20
Received: 14.12.2017
Accepted: 29.12.2017

Citation: S. V. Znamenskij, “Model and axioms for similarity metrics”, Program Systems: Theory and Applications, 8:4 (2017), 347–357

Citation in format AMSBIB
\Bibitem{Zna17}
\by S.~V.~Znamenskij
\paper Model and axioms for similarity metrics
\jour Program Systems: Theory and Applications
\yr 2017
\vol 8
\issue 4
\pages 347--357
\mathnet{http://mi.mathnet.ru/ps286}
\crossref{https://doi.org/10.25209/2079-3316-2017-8-4-347-357}


Linking options:
  • http://mi.mathnet.ru/eng/ps286
  • http://mi.mathnet.ru/eng/ps/v8/i4/p347

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. S. V. Znamenskij, “Stable assessment of the quality of similarity algorithms of character strings and their normalizations”, Programmnye sistemy: teoriya i prilozheniya, 9:4 (2018), 561–578  mathnet  crossref
    2. S. V. Znamenskii, “Ustoichivaya otsenka kachestva algoritmov skhodstva simvolnykh strok i ikh normalizatsii”, Programmnye sistemy: teoriya i prilozheniya, 9:4 (2018), 579–596  mathnet  crossref
  • Program Systems: Theory and Applications
    Number of views:
    This page:61
    Full text:12
    References:6

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019