Graph-based Clustering Algorithm Based on Density Variation

Давронов, Р.Р.

Рақамли технологияларнинг назарий ва амалий масалалари · 2025-yil

Annotatsiya

Clustering is one of the main tasks of data analysis aimed at grouping objects into homogeneous subsets without predetermined labels. This article examines the method of column clustering. It uses the concept of iterative removal of low-density nodes to detect “core” nodes (core pixels) and define the structure of clusters. We describe the theoretical foundations of the method, provide implementation details, and analyze the obtained results on synthetic datasets (including those created using the scikit-learn library). Furthermore, we compare the proposed algorithm with other known clustering methods using the ARI (Adjusted Rand Index) metric. Experiments show that this approach effectively identifies structures of different shapes and densities and demonstrates competitive results compared to classical methods.

Maqola ma’lumotlari
MualliflarДавронов, Р.Р.
JurnalРақамли технологияларнинг назарий ва амалий масалалари
Nashr sanasi2025-07-25
Jild8
Son2
Betlar58-64
TilRus
DOI10.62132/ijdt.v8i2.264

Kalit so‘zlar

кластеризация на графах, локальная плотность, удаление узлов графа, назначение кластеров, вариация плотности, clustering in graphs, local density, removing graph nodes, purpose of clusters, density variation

Ilmiy soha

Рақамли технологияларнинг назарий ва амалий масалалари jurnalidan boshqa maqolalar

Рақамли технологияларнинг назарий ва амалий масалалари — barcha maqolalar