Medoid

Known as: Medoids 
Medoids are representative objects of a data set or a cluster with a data set whose average dissimilarity to all the objects in the cluster is… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This paper presents an approach for paralleling K-medoid clustering algorithm. The K-medoid algorithm will be divided into tasks… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2011
2011
This paper proposes new variance enhanced clustering methods to improve the popular K-medoid algorithm by adapting variance… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Problem statement: Clustering is one of the most important research ar eas in the field of data mining. Clustering means creating… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper proposes a new algorithm for K-medoids clustering which runs like the K-means algorithm and tests several methods for… (More)
  • table 1
  • table 2
  • table 5
  • table 3
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N), with a small… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
Is this relevant?
2006
2006
In this paper, we propose a video summarization algorithm by multiple extractions of key frames in each shot. This algorithm is… (More)
  • figure 1
Is this relevant?
2005
2005
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
Modern geographic information systems do not only have to handle static information but also dynamically moving objects… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper presents new algorithms (fuzzy e-methods (FCMdd) and fuzzy c trimmed medoids (FCTMdd)) for fuzzy clustering of… (More)
  • table 2
  • table 4
Is this relevant?