Geometric median

Known as: Fermat–Weber point, 1-median, Fermat-Weber point 
The geometric median of a discrete set of sample points in a Euclidean space is the point minimizing the sum of distances to the sample points. This… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2018
0102019802018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
With the progress of measurement apparatus and the development of automatic sensors it is not unusual anymore to get large… (More)
Is this relevant?
2016
2016
In this paper we provide faster algorithms for solving the geometric median problem: given <i>n</i> points in <sup><i>d</i></sup… (More)
  • table 1
Is this relevant?
2015
2015
Learning large-scale dataset takes excessive processing time. Hence, smaller size of training set is beneficial to reduce the… (More)
  • table I
  • table IV
  • table III
  • table V
Is this relevant?
2013
2013
Article history: Received 20 October 2011 Received in revised form 2 July 2012 Accepted 15 July 2012 Available online xxxx 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
In this paper, we propose a new kernel function that makes use of Riemannian geodesic distance s among data points, and present a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
One of the primary goals of computational anatomy is the statistical analysis of anatomical variability in large populations of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2008
2008
The geometric median is a classic robust estimator of centrality for data in Euclidean spaces. In this paper we formulate the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
People’s greater willingness to help identified victims, relative to non-identified ones, was examined by varying the singularity… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1998
1998
The 1-median problem on a network asks for a vertex minimizing the sum of the weighted shortest path distances from itself to all… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In this paper we present approximation algorithms for median problems in metric spaces and xed-dimensional Euclidean space. Our… (More)
  • figure 1
Is this relevant?