CLUSTERING OF NEIGHBORHOOD STRUCTURE

Cover Page

Cite item

Full Text

Abstract

We define a metric on the set of nodes of neighborhood structure and consider the clustering problem for the structure with respect to the metric, or, what is the same, the problem of constructing the factor-structure. Determined metric takes into account both the connections between the nodes of the structure and the experimental data at the nodes.

About the authors

Anatoliy Mikhailovich Shmyrin

Lipetsk State Technical University

Email: amsh@lipetsk.ru
Doctor of Techniques, Professor, the Head of the Higher Mathematics Department Lipetsk, the Russian Federation

Nikolay Mikhailovich Mishachev

Lipetsk State Technical University

Email: nmish@lipetsk.ru
Candidate of Physics and Mathematics, Associate Professor of the Higher Mathematics Department Lipetsk, the Russian Federation

Anastasia Sergeevna Kosareva

Lipetsk State Technical University

Email: kosarewanastya@yandex.ru
Graduate student of the Higher Mathematics Department Lipetsk, the Russian Federation

References

  1. Блюмин С.Л., Шмырин A.M. Окрестностные системы. Липецк: ЛЭГИ, 2005.
  2. Shmyrin, A.M., Kosareva, A.S. The measure of similarity in solving the problem of clustering neighborhood structures // Modern informatization problems in the technological and telecommunication systems analysis and synthesis: Proceedings of the XXI-th International Open Science Conference (Yelm, WA, USA, Januar 2016), 2016. P. 341-346.

Supplementary files

Supplementary Files
Action
1. JATS XML
Download


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Согласие на обработку персональных данных

 

Используя сайт https://journals.rcsi.science, я (далее – «Пользователь» или «Субъект персональных данных») даю согласие на обработку персональных данных на этом сайте (текст Согласия) и на обработку персональных данных с помощью сервиса «Яндекс.Метрика» (текст Согласия).