Skip to main content
Log in

A scheme for constructing algorithms for correcting a local perturbation in a finite semimetric

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

A three-step scheme for constructing algorithms for transforming metric information in data mining is proposed and investigated. The correction problem of a local perturbation of a semimetric on a finite set of objects is considered. In the framework of the proposed scheme, algorithms correcting the changes of the distance between a pair of objects by a given quantity that preserve the metric properties are examined. Sufficient conditions under which the correction of semimetrics using the proposed three-step scheme actually completes in two steps and in some special cases even after the first step are obtained. Semimetric similarity functionals are considered, and the correction algorithms are matched to those functionals.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. S. A. Aivazyan, V. M. Bukhshtaber, I. S. Enyukov, and L. D. Meshalkin, Applied Statistics: Classification and Dimension Reduction (Finansy i Statistika, Moscow, 1989) [in Russian].

    Google Scholar 

  2. S. N. Chernikov, Linear Inequalities (Nauka, Moscow, 1968) [in Russian].

    Google Scholar 

  3. F. P. Vasil’ev, Numerical Methods for Solving Extremum Value Problems (Nauka, Moscow, 1988) [in Russian].

    Google Scholar 

  4. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polytopes, Graphs, and Optimization (Combinatorial Optimization Theory) (Nauka, Moscow, 1981) [in Russian].

    Google Scholar 

  5. B. G. Mirkin and S. N. Rodin, Graphs and Genes (Nauka, Moscow, 1977) [in Russian].

    Google Scholar 

  6. V. K. Leont’ev, “Stability in Discrete Linear Problems” (Nauka, Moscow, 1979), No. 35, pp. 169–184 [in Russian].

    Google Scholar 

  7. S. V. Yushmanov, “Reconstructing of a Phylogenetic Tree from Subtrees Generated by Quadruples of Its Dangling Vertices,” in Mathematical Cybernetics and Its Applications in Biology (Mosk. Gos. Univ., Moscow, 1987) [in Russian].

    Google Scholar 

  8. A. I. Maisuradze, “Optimal Decompositions of Finite Metric Configurations in Pattern Recognition,” Zh. Vychisl. Mat. Mat. Fiz. 44, 1697–1707 (2004) [Comput. Math. Math. Phys. 44, 1615–1624 (2004)].

    MathSciNet  Google Scholar 

  9. A. I. Maisuradze, “Homogeneous and Rank Bases in Spaces of Metric Configurations,” Zh. Vychisl. Mat. Mat. Fiz. 46, 344–360 (2006) [Comput. Math. Math. Phys. 46, 330–347 (2006)].

    MathSciNet  Google Scholar 

  10. I. A. Gromov, “Interactive Methods for Semimetric Correction,” in Sb. Statei Molodykh Uchenykh Fakul’teta VMiK MGU, No. 4, 27–40 (2007).

  11. M. Deza and M. Laurent, Geometry of Cuts and Metrics (Springer, Berlin, 1997; MTsNMO, Moscow, 2001).

    MATH  Google Scholar 

  12. Yu. I. Zhuravlev, “Correct Algebras over Sets of Incorrect (Heuristic) Algorithms,” Part I, Kibernetika, No. 4, 5–17 (1977); Part II, Kibernetika, No. 6, 21–27 (1977); Part III, Kibernetika, No. 2, 35–43 (1978).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. A. Gromov.

Additional information

Original Russian Text © I.A. Gromov, 2010, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2010, Vol. 50, No. 7, pp. 1315–1326.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gromov, I.A. A scheme for constructing algorithms for correcting a local perturbation in a finite semimetric. Comput. Math. and Math. Phys. 50, 1249–1259 (2010). https://doi.org/10.1134/S0965542510070134

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542510070134

Key words

Navigation