Skip to search formSkip to main contentSkip to account menu

K-medians clustering

Known as: K-median problem, K-medians 
In statistics and data mining, k-medians clustering is a cluster analysis algorithm. It is a variation of k-means clustering where instead of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the… 
2010
2010
Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However… 
2008
2008
Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user… 
2007
2007
We take an algorithmic approach to a well-known communication channel problem and develop several algorithms for solving it… 
2003
2003
Clustering methods are used in pattern recognition to obtain natural groups from a data set in the framework of unsupervised… 
2001
2001
2001
2001
The k-median problem is a classical facility location problem. We consider the k-median problem for directed trees, motivated by… 
2000
2000
We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand… 
1988
1988
Two-way left-turn lane (TWLTL) medians are commonly used to solve the safety and operational problems on four-lane undivided… 
1986
1986
In this note we prove a dominance property of the set of Hakimi medians for the Stochastic Queue Median SQM problem on a network…