A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Fast Approximated k-Median Algorithm
[chapter]
2002
Lecture Notes in Computer Science
The k-means algorithm is a well-known clustering method. Although this technique was initially defined for a vector representation of the data, the set median (the point belonging to a set P that minimizes the sum of distances to the rest of points in P ) can be used instead of the mean when this vectorial representation is not possible. The computational cost of the set median is O(|P | 2 ). Recently, a new method to obtain an approximated median in O(|P |) was proposed. In this paper we use
doi:10.1007/3-540-70659-3_76
fatcat:rv7uzoujmnbepg6jlflyilx32q