Anna Cena

A K-means-like algorithm for informetric data clustering

2015 · Advances in intelligent systems research/Advances in Intelligent Systems Research

The K-means algorithm is one of the most often used clustering techniques. However, when it comes to discovering clusters in informetric data sets that consist of non-increasingly ordered vectors of not necessarily conforming lengths, such …

Clustering with minimum spanning trees: How good can it be?

2023 · arXiv (Cornell University)

Minimum spanning trees (MSTs) provide a convenient representation of datasets in numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this paper, we quantify the extent to which they are meaningful in …