query: In clustering, what is the analogous of the centroid that uses the median instead of the mean?
positive_passages.docid: 144011
positive_passages.text: Representative point of a cluster with L1 distance
negative_passages.docid: 157163
negative_passages.text: The median of a continuous frequency distribution
negative_passages.docid: 4939
negative_passages.text: 1D Number Array Clustering
negative_passages.docid: 95719
negative_passages.text: Drawing a triangle from medians
negative_passages.docid: 25605
negative_passages.text: Why does the median minimize $E(|X-c|)$?
negative_passages.docid: 87541
negative_passages.text: How to Calculate Centroid in python
negative_passages.docid: 19013
negative_passages.text: What is a good algorithm for estimating the median of a huge read-once data set?
negative_passages.docid: 106816
negative_passages.text: Medians of a triangle and similar triangle properties
negative_passages.docid: 37256
negative_passages.text: K-means: Why minimizing WCSS is maximizing Distance between clusters?
negative_passages.docid: 126696
negative_passages.text: Find running median from a stream of integers
negative_passages.docid: 132440
negative_passages.text: Should the mean be used when data are skewed?
negative_passages.docid: 11086
negative_passages.text: How to align a cluster of points?
negative_passages.docid: 56244
negative_passages.text: Finding median of list in Python
negative_passages.docid: 62646
negative_passages.text: Median of three partitioning taking more time than standard quicksort in java
negative_passages.docid: 18163
negative_passages.text: Central limit theorem for sample medians
negative_passages.docid: 10079
negative_passages.text: Standard error of the median
negative_passages.docid: 120481
negative_passages.text: Appropriate cluster method?