dm.cs.tu-dortmund.de/en/mlbits/cluster-kmeans-extensions/
Extensions of k-means Clustering – Lecture Notes
example : \(1,2,3,4,10\in \mathbb {R}^1\) ; Euclidean distance becomes \(\smash {\sqrt{\smash {(x_i-m)^2}\mathstrut }}=|x_i-m|\) The mean is \(m=4\) . Distance sum: \(12\) The median is \(m=3\) . Distance [...] and Chaturvedi, A. 1998. K-midranges clustering. Advances in data science and classification (1998), 3–14.
[DhMo01]
Dhillon, I.S. and Modha, D.S. 2001. Concept decompositions for large sparse text data using [...] k-means algorithm for clustering large data sets with categorical values. Data Min. Knowl. Discov. 2, 3 (1998), 283–304. DOI: 10.1023/A:1009769707641
[NiNo09]
Nielsen, F. and Nock, R. 2009. Sided and symmetrized …
