K-means for semantically enriched trajectories
Jana Seep, Jan Vahrenhold · 2021
Clustering a set of given objects is a standard component of many data analysis tasks. The well-known k-means algorithm is a centroid-based clustering algorithm that optimizes the sum of distances between data objects and their assigned cluster centers. Each centroid then represents all objects assigned to a given cluster.