Allocation of Clusters of Objects on Topological Graphs of High Cardinality; Key Engineering Materials; Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015)

Allocation of Clusters of Objects on Topological Graphs of High Cardinality; Key Engineering Materials; Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015)

Detalles Bibliográficos
Parent link:Key Engineering Materials: Scientific Journal
Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015).— 2016.— [P. 952-956]
Autor Principal: Pogrebnoy A.
Autor Corporativo: Томский политехнический университет Институт кибернетики, ИК
Outros autores: Pogrebnoy A. V. Aleksandr Vladimirovich
Summary:Title screen
Distributed systems containing hundreds or thousands of objects, are generally constructed in the form of hierarchical structures. In these structures, the lower level objects in the subset are combined for connecting to centers. Existing algorithms are not able to successfully meet the challenges of structuring on the sets of such dimension. Therefore, new algorithms suitable for solving the problems of structuring on the sets containing thousands of objects are necessary. The authors developed an algorithm to form objects clusters for high cardinality sets, with up to a thousand or more objects located in a given area. The algorithm is developed with the help of graph theory, design and analysis of algorithms efficiency, compact partitions theory, compact sets of objects and their clusters. Geographical location of a set of objects of a distributed system is considered as a topological graph. To improve the efficiency of the algorithm of forming compact sets and clusters allocation the concept of the zone of active search for nearby vertices is introduced. That enables the possibility to replace a matrix of distances between the vertices to list of vertices incidents formed on the basis of active search zone. An algorithm for the approximate solution of clusters allocation of topological graph objects represented by a list of vertices incidents is developed. The algorithm recurrently increases the cardinality of compact sets for each object and analyzes acquired clusters. Algorithm description is accompanied by an example.
Режим доступа: по договору с организацией-держателем ресурса
Idioma:inglés
Publicado: 2016
Series:Information Technology, Data and Signal Processing
Subjects:
электронный ресурс
труды учёных ТПУ
накопление
объекты
кластеры
плотность
топологические графы
Acceso en liña:http://dx.doi.org/10.4028/www.scientific.net/KEM.685.952
Formato: Electrónico Capítulo de libro
KOHA link:https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=646584

Títulos similares

Títulos similares