An implementation of the relational k-means algorithm
Machine Learning
2013-04-26 v1 Computer Vision and Pattern Recognition
Mathematical Software
Abstract
A C# implementation of a generalized k-means variant called relational k-means is described here. Relational k-means is a generalization of the well-known k-means clustering method which works for non-Euclidean scenarios as well. The input is an arbitrary distance matrix, as opposed to the traditional k-means method, where the clustered objects need to be identified with vectors.
Cite
@article{arxiv.1304.6899,
title = {An implementation of the relational k-means algorithm},
author = {Balázs Szalkai},
journal= {arXiv preprint arXiv:1304.6899},
year = {2013}
}
Comments
8 pages