About one approach to calculating the rank correlation. Part I

Boris Melnikov

Abstract


When calculating the rank correlation, the same situation arises as in some other subject areas: researchers have the opinion that new possible constructions in this subject area are either impossible (everything has already been done), or are not needed. In the article, we try to show that further theoretical developments are possible, which can lead to quite interesting practical results. We propose our own version of calculating the rank correlation coefficient, which (in its simplest form) can be considered “located between” the Kendall and Spearman coefficients. More specifically, we use not only the conditions for the coincidence of the results of predicates that determine the order of the elements of the corresponding pairs (as in calculating the Kendall coefficient), and not only a generalization of the general version of calculating the pair correlation in the case of rank (as in calculating the Spearman coefficient), but both of these techniques together. We use the obtained formulas to calculate different variants of rank correlation coefficients in several different subject areas, and try to justify by reasoning that the criterion we propose is quite successful. We also propose options for generalizing our criterion, and we believe that these possible generalizations do not coincide with the generalizations given in classical monographs (but they do not contradict them, but complement them).


Full Text:

PDF (Russian)

References


Lagutin M. Visual mathematical statistics. – Moscow: BINOM. Laboratoriya znaniy. 2012. 472 p. (In Russian.)

Wasserman L. All of statistics: a concise course in statistical inference. – Springer Science & Business Media. 2013. 442 p.

Melnikov B.: Heuristics in programming of nondeterministic games. Programming and Computer Software, 2001, vol. 27, no. 5, pp. 277–288, DOI: 10.1023/ A:1012345111076.

Melnikov B., Radionov A., Gumayunov V.: Some special heuristics for discrete optimization problems. ICEIS 2006 – 8th International Conference on Enterprise Information Systems, Proceedings, 2006, AIDSS, pp. 360–364, ISBN: 9728865422, 978-972886542-9.

Melnikov B., Radionov A., Moseev A., Melnikova E.: Some specific heuristics for situation clustering problems. ICSOFT 2006 – 1st International Conference on Software and Data Technologies, Proceedings, 2006, no. 2, pp. 272–279, ISBN: 9728865694, 978-972886569-6.

Melnikov B., Trenina M., Kochergin A.: On one problem of reconstructing matrix distances between chains of DNA. IFAC-Papers,

, vol. 51 (32), pp. 378–383, DOI: 10.1016/j.ifacol.2018.11.413.

Melnikov B., Trenina M., Melnikova E.: Different approaches to solving the problem of reconstructing the distance matrix between DNA chains. Communications in Computer and Information Science (CCIS), 2020, vol. 1201, pp. 211–223, DOI: 10.1007/978-3-030-46895-8_17.

Melnikov B., Pivneva S., Trifonov M.: Various algorithms, calculating distances of DNA sequences, and some computational recommendations for use such algorithms, 2017, Information Technology and Nanotechnology, Proceedings, DOI:10.18287/1613-0073-2017-1902-

-50.

Li Jiamian, Mu Jingyuan, Melnikov B.: On an approach to the implementation of the Needleman – Wunsch and Jaro – Winkler algorithms and their application in the correlation analysis of the similarity of mitochondrial DNA of monkeys. Part I, 2024, International Journal of Open Information Technologies, vol. 12, no. 9, pp. 1–10. ISSN: 2307-8162. (In Russian.)


Refbacks

  • There are currently no refbacks.


Abava  Кибербезопасность IT Congress 2024

ISSN: 2307-8162