Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,662,041 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Cluster analysis
Data mining
Environment for DeveLoping KDD-Applications Supported by Index-Structures
Euclidean distance
Expand
Broader (1)
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation
J. Byrka
,
Bartosz Rybicki
,
Sumedha Uniyal
arXiv.org
2015
Corpus ID: 11008796
We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the…
Expand
2010
2010
Data Caching in Ad Hoc Networks Using Game-Theoretic Analysis
Yutian Chen
,
Bin Tang
IEEE International Conference on Sensor Networks…
2010
Corpus ID: 7114062
Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However…
Expand
2008
2008
Adding Capacity Points to a Wireless Mesh Network Using Local Search
Joshua Robinson
,
Mustafa Uysal
,
R. Swaminathan
,
E. Knightly
IEEE INFOCOM - The 27th Conference on Computer…
2008
Corpus ID: 11122639
Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user…
Expand
2007
2007
A Fully Polynomial Approximation Algorithm for Collaborative Relaying in Sensor Networks Under Finite Rate Constraints
R. Kannan
,
Shuangqing Wei
,
V. Chakravarthy
,
M. Rangaswamy
International Conference on Distributed Computing…
2007
Corpus ID: 16538966
We take an algorithmic approach to a well-known communication channel problem and develop several algorithms for solving it…
Expand
2003
2003
Generalized k-Medians Clustering for Strings
Carlos David Martínez Hinarejos
,
Alfons Juan-Císcar
,
F. Casacuberta
Iberian Conference on Pattern Recognition and…
2003
Corpus ID: 46496456
Clustering methods are used in pattern recognition to obtain natural groups from a data set in the framework of unsupervised…
Expand
2001
2001
Generalized medians
Tomasa Calvo
,
R. Mesiar
Fuzzy Sets Syst.
2001
Corpus ID: 26529340
2001
2001
The k-Median Problem for Directed Trees
M. Chrobak
,
L. Larmore
,
W. Rytter
International Symposium on Mathematical…
2001
Corpus ID: 38419203
The k-median problem is a classical facility location problem. We consider the k-median problem for directed trees, motivated by…
Expand
2000
2000
On the continuous Weber and k-median problems (extended abstract)
S. Fekete
,
Joseph S. B. Mitchell
,
Karin Weinbrecht
SCG '00
2000
Corpus ID: 2581901
We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand…
Expand
1988
1988
TWO-WAY LEFT-TURN LANE GUIDELINES FOR URBAN FOUR-LANE ROADWAYS
P. Mccoy
,
J. L. Ballard
,
Duane S Eitel
,
Walter E Witt
1988
Corpus ID: 108277231
Two-way left-turn lane (TWLTL) medians are commonly used to solve the safety and operational problems on four-lane undivided…
Expand
1986
1986
Technical Note - A Dominance Theorem for the Stochastic Queue Median Problem
S. Chiu
Operational Research
1986
Corpus ID: 258176
In this note we prove a dominance property of the set of Hakimi medians for the Stochastic Queue Median SQM problem on a network…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE