Тип публикации: статья из журнала

Год издания: 2017

Идентификатор DOI: 10.17516/1997-1397-2017-10-4-443-449

Ключевые слова: Clusterization, Complexity, Component, Connectivity, Order

Аннотация: New method is proposed to identify clusters in datasets. The method is based on a sequential elimination of the longest distances in dataset, so that the relevant graph looses some edges. The method stops when the graph becomes disconnected. © Siberian Federal University. All rights reserved.

Журнал: Journal of Siberian Federal University - Mathematics and Physics

Выпуск журнала: Vol. 10, Is. 4

Номера страниц: 443-449

ISSN журнала: 19971397

Издатель: Siberian Federal University

• Sadovsky M.G. (Institute of computational modelling SB RAS, Akademgorodok, 50/44, Krasnoyarsk, Russian Federation)
• Bushmelev E.Y. (Institute of computational modelling SB RAS, Akademgorodok, 50/44, Krasnoyarsk, Russian Federation)
• Ostylovsky A.N. (Institute of Mathematics and Computer Science, Siberian Federal University, Svobodny, 79, Krasnoyarsk, Russian Federation)

• Scopus
• Web of Science Core Collection
• Ядро РИНЦ (eLIBRARY.RU)
• Список ВАК