Skip to search formSkip to main contentSkip to account menu

K-medoids

Known as: K-medoid, PAM, Partitioning Around Medoids 
The k-medoids algorithm is a clustering algorithm related to the k-means algorithm and the medoidshift algorithm. Both the k-means and k-medoids… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
This paper discusses the current analysis of a large set of child-robot interaction experiments, in which a 2–4 year old child… 
2014
2014
Gunumuzde bilisim alanindaki gelismeler sayesinde kullanicilar daha gelismis bilgisayar teknolojilerine hakim olmaktadir ve bu… 
2013
2013
Clustering is one of the data analysis methods that are widely used in data mining. In this method, we partitioned the data into… 
2013
2013
Optimization mobile radio network planning is a very complex task, as many aspects must be taken into account. Deciding upon the… 
2012
2012
The Social Web makes visible the ebb and flow of popular interest in topics both newsworthy ("GulfSpill") and trivial ("Lolcat… 
2011
2011
Problem statement: As a large amount of data stored in spatial databases, people may like to find groups of data which share… 
2010
2010
Blog clustering is an important approach of web public opinion analysis. In this paper, an integrated graph-based approach for… 
2010
2010
Due to the disadvantages of sensitivity to the initial selection of the medoids and poor performance in large data set processing… 
2008
2008
Network planning is of key importance during the construction of new communities and cities, in which telephone and data services… 
2008
2008
Classification using a Polynomial Neural Network (PNN) can be considered as a multi-objective problem rather than as a single…