Data Clustering Using Asymmetric Similarity Measures

Abstract

Data Clustering Using Asymmetric Similarity Measures

Shiyan V.I., Markov V.N.

Incoming article date: 06.05.2025

The article focuses on developing data clustering algorithms using asymmetric similarity measures, which are relevant in tasks involving directed interactions. Two algorithms are proposed: stepwise cluster formation and a modified version with iterative center refinement. Experiments were conducted, including a comparison with the k-medoids method. The results showed that the fixed-center algorithm is efficient for small datasets, while the center-recalculation algorithm provides more accurate clustering. The choice of algorithm depends on the requirements for speed and quality.

Keywords: clustering, asymmetric similarity measures, clustering algorithms, iterative refinement, k-medoids, directed interactions, adaptive methods