Questions tagged [k-medoids]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
0 votes
0 answers
6 views

Formal method to predict borders for k-medoid clustering

I've got a simple (two variable) data set that resolved nicely with k-medoids clustering (PAM) into three clusters. However, for presentation, I'd like to plot the points along with a Voronoi-style ...
Bryan's user avatar
  • 1,147
0 votes
0 answers
42 views

K-medoids/PAM - Dissimilarity Matrix

Just wondered if someone could provide some clarity on whether it is suitable to use partitioning around medoids (PAM) on a dataset that has not been transformed into a dissimilarity matrix? For ...
EB3112's user avatar
  • 244
0 votes
0 answers
241 views

k-medoids on binary data

I have a binary dataset and I would like to cluster it with the k-medoids algorithm. The dataset is not huge: I have 10 dimensions and around 250 objects. I am clustering physical infrastructures ...
Pachita's user avatar
0 votes
1 answer
124 views

Transformation of features in KMeans when maximums and minimums are different?

I have some questions about KMeans that I would like to discuss. I have several features, the minimum and maximum values ​​between columns vary, so I applied the "MinMaxScaler" ...
user140259's user avatar
2 votes
0 answers
313 views

Understanding the SWAP step of PAM K-medoids

In what I believe is the original PAM paper, the swap step is described like so: "This is done by considering all pairs of objects (i, h) for which object i has been selected and object h has ...
rocksNwaves's user avatar
1 vote
0 answers
247 views

K-Medoid Clustering with Point Weights

I implemented a K-Medoid clustering algorithm recently; I have a number of points $x_1, ..., x_n$ which have various properties and a distance function $d$ that maps two points to some nonnegative ...
Joseph Doob's user avatar
0 votes
0 answers
224 views

Clustering a distance matrix with k-medoids

For a symmetric distance matrix that I want to cluster, I performed several cluster algorithms: MDS into k-Means DBSCAN OPTICS k-Medoids (the one I'm having trouble with) Now, I would like to know ...
ale.tenorio's user avatar
3 votes
0 answers
362 views

When to use K-Medoids instead of K-means

When it's better to use K-Medoids rather than K-Means? Can anybody give some examples of dataset for the same?
user9855045's user avatar
3 votes
1 answer
2k views

Assign new data to a cluster (using Gower distance and PAM algorithm)

I have a dataset which has mixed data types and hence I used Gower dissimilarity matrix as input to cluster the data using Partitioning Around Medoids (PAM) algorithm. I wanted to know if there is any ...
ANP's user avatar
  • 63
2 votes
1 answer
760 views

K-medoids: Is there any constraint about the choice of the distance?

It is well known that the K-means algorithm is well designed for the Euclidean distance (or a minor variation such as the cosine distance). I have been reading the paper "A simple and fast algorithm ...
DanielTheRocketMan's user avatar
1 vote
0 answers
137 views

Is K-medoids / partitioning around medoids (PAM) appropriate for clustering data with many zero values?

I need to cluster a matrix which contains zero values. I am clustering three separate sets of 24 values. The first two are non-zero and represent hourly ambient temperature (in K) and electrical ...
Martin's user avatar
  • 111
1 vote
0 answers
267 views

Deterministic Methods to Initialize K-Means and K-Medoids Clustering Methods

I am looking for effective and deterministic methods to initialize K-Means and K-Medoids algorithms. There is a great answer in Methods of initializing K-Means Clustering yet most of them has some ...
Royi's user avatar
  • 1,091
1 vote
1 answer
101 views

Understanding PAM - why is it greedy?

I've been studying k-medoids for a while but i can't understand the first step or BUILD step: in particular i can't get how the initial medoids would be "greedy". I'm not much confident with the ...
perseo's user avatar
  • 53
1 vote
1 answer
285 views

SSE for K-means and K-medoids

I am trying to understand given same data set and same K - will the SSE of K means be higher than K Medoids or not. both try to minimize the SSE and K-medoids is more robust to outliers - does it mean ...
Hawk's user avatar
  • 11
2 votes
1 answer
151 views

Does the cluster validity index based on global mean applicable to k-medoids clustering?

There are many cluster validity index (cvi) requiring the global mean in their calculations, such as the Calinski-Harabasz index. I was wondering is this type of cvis applicable to k-medoids ...
Yuan's user avatar
  • 23
0 votes
2 answers
1k views

K-medoids algorithm for time series with varying lengths

Can time series having multiple lengths be clustered using the k-medoids algorithm. I am essentially looking for a way to find a representative pattern from a set of time series using the k-medoids ...
DGT's user avatar
  • 31
0 votes
1 answer
2k views

How to select a single updated centroid if multiple centroids are equidistant for a single group when running k-means/k-medoids?

I am trying to write my own k-means and k-medoids clustering algorithms. I understand the general idea: given k centroids, one continually updates the centroids ...
user avatar
1 vote
0 answers
101 views

Graph clustering for balanced sum of absolute deviations within each cluster (same sum of intracluster distances)

I'm given a set of points and a distance matrix. With these I'm trying to develop an algorithm similar to k-means that tries to minimize the sum of distances from each cluster datapoint to it's center ...
johk95's user avatar
  • 133
1 vote
2 answers
266 views

Partitioning Around Medoids: Choosing a cluster number larger than the "optimal" one?

I asked a number of 71 'experts' to sort 92 different psychological constructs based on their similarity. Based on their answers, I constructed a dissimilarity matrix. Initially, I wanted to analyse ...
DomB's user avatar
  • 521
0 votes
2 answers
1k views

Clustering Categorical Data

I want to cluster a data set where all variables are categorical. Which would be more effective for doing so, k - means or k - medoids? The data set is linked below. https://archive.ics.uci.edu/...
asasas's user avatar
  • 63
0 votes
1 answer
263 views

Quality of PAM clustering

I have a mixed data and I have been searching for the best method to cluster it and I've chosen PAM. I am working btw with R. I've considered all the 17 variables of my data to cluster: 4 qualitative ...
C.Camus's user avatar
1 vote
1 answer
437 views

Duplicated Rows in Mixed Data Type Clustering

I have a dataset which has ~200k rows and looks like the following - ...
user3082806's user avatar
-1 votes
2 answers
623 views

how to classify input image using clustering algorithm such as k-mean?

I want to classify cifar10 images using a clustering algorithm (k-mean). Each image in the cifar10 dataset has a label, so, the results must be a set of labels which are corresponding to the test ...
AAA's user avatar
  • 115
1 vote
0 answers
58 views

what`s the name or meaning of this clustering algorithm?

I have been learning the fuzzy clstering algorithm recently,and I got an object function as following: \begin{array}{l} \min \;\;J = \sum\limits_{i = 1}^N {\sum\limits_{k = 1}^K {\sum\limits_{j = 1}^...
Joey.Sh's user avatar
  • 11
0 votes
1 answer
677 views

Is there a way to calculate the Explained Variance with PAM or k-medoids?

I am studying geographic solar radiation data obtained from satellite images. I would like to and use cluster analysis and make some correlation analysis by clusters, instead of by pixel - as some ...
André Costa's user avatar
1 vote
2 answers
535 views

why does k-medoids ignore between-cluster distances

The k-medoids algorithm is a popular distance-based clustering algorithm. It uses a heuristic algorithm to assign samples to clusters based on centroids, which are itself samples. It's cost function ...
PejoPhylo's user avatar
  • 307
1 vote
0 answers
2k views

Difference between Medoid and Centroid [duplicate]

For a certain dataset, I am finding the k closest points in my dataset to the centroid of the dataset. Are these k points the k medoids or are medoids something completely different. If so, is there ...
J. Doe's user avatar
  • 11
2 votes
0 answers
99 views

Approximate medoid using matrix approximation

The medoid of a set of $n$ points is defined as the point that minimizes the average distance to all the other points. If there is a matrix containing rows in which each row is the set of all metric ...
Hari's user avatar
  • 255
6 votes
1 answer
4k views

How to derive the time computational complexity of k-medoids (PAM) clustering algorithm?

I have read that the time complexity of k-medoids/Partitioning Around Medoids (PAM) is O(k(n-k)^2). I am trying to understand how this algorithms translates into this time complexity. As per my ...
itkhanz's user avatar
  • 61
4 votes
1 answer
686 views

Why use K-medoids for sequence analysis?

In the package WeightedCluster there seems to be facilities for using K-medoids clustering (i.e. wcKMedoids()), but not the more ...
histelheim's user avatar
  • 2,923
2 votes
1 answer
59 views

Covering 2D data by m squares (alternative to k-means)

Let us have some data $x_i\in\mathbb{R}^2$ for $i=1,\dots,n$. Let $m=1000$. Let a small number is given, e.g. $m=5$. The goals is to cover $n$ data by $m$ squares of the same size. The size shall be ...
Karel Macek's user avatar
  • 2,698
0 votes
0 answers
322 views

Can Medoids be manually selected in PAM?

I'm currently running a cluster analyses on a dataset that contains variables of categorical and continuos values.I applied the well-established Gower’s dissimilarity coefficient to account for ...
Martin's user avatar
  • 99
1 vote
1 answer
2k views

Silhouette value after normalizing a variable and re-clustering

I have a non-normalized variable and other normalized variables and I make a clustering with k medoids (or k means). If I let the first variable non-normalized, I get better results in terms of ...
Railectric's user avatar
1 vote
1 answer
411 views

Clustering issues

I have a list of electrical feeders. I want to cluster them by their topological characteristics: voltage level, total length, % of underground cable, state of the neutral. I first made a manual ...
Railectric's user avatar
3 votes
0 answers
104 views

Does the distance metric used with K-Medoids needs to respect the triangle inequality?

I'd like to understand if the K-Medoids algorithm requires to be used with a distance metric that respects the triangle inequality. In particular I'd like to try to apply the K-Medoids algorithm with ...
se7entyse7en's user avatar
1 vote
1 answer
1k views

Compare clustering results based on intra cluster similarity

I am working on a project for my university. A part of this project is to compare the influence of PCA on clustering. Therefore I have a football player dataset that contains a feature called "...
Kewitschka's user avatar
0 votes
1 answer
807 views

Weird Clusplot when plotting k-mediods clustering vector

The basic idea of the problem is that I need to cluster a set of points for which I have a dissimilarity matrix. I have a dataset of around 4600 points (latitudes and longitudes). I have also ...
Sidak's user avatar
  • 3
1 vote
0 answers
287 views

More consistent medoids from Lloyd's algorithm?

I wrote an implementation of Lloyd's algorithm in Python and was running some tests. My data set is 1D (specifically dealing ...
noahnu's user avatar
  • 111
5 votes
1 answer
1k views

Can silhouette be calculated with distances to centroids, instead of pairwise point distances?

I am using Silhouette cluster validation for each repetition (for a specific K) of k-means, k-modes and k-medoids. All the definitions of Silhouette I see calculate the distance of each point to ...
Fabio's user avatar
  • 270
2 votes
2 answers
2k views

Finding cluster number based on distance & max element count

Given two constraints: The maximum distance d an element can lie from a cluster centroid (or medoid) The maximum number of elements n in one cluster Is it possible to find the minimum number of ...
sophistry's user avatar
2 votes
2 answers
543 views

Clustering before or after ordination

Can someone explain the implications of performing clustering either before or after performing NMDS? I have some ecological data and I am performing a clustering analysis to identify communities of ...
gazwb's user avatar
  • 159
13 votes
3 answers
48k views

An example where the output of the k-medoid algorithm is different than the output of the k-means algorithm

I understand the difference between k medoid and k means. But can you give me an example with a small data set where the k medoid output is different from k means output.
tubby's user avatar
  • 633
0 votes
0 answers
239 views

Streaming K-medoids

Mahout, Hadoop machine learning library, contains an implementation of Streaming K-means algorithm that is based on the following paperworks The Effectiveness of Lloyd-Type Methods for the k-Means ...
Kobe-Wan Kenobi's user avatar
1 vote
0 answers
355 views

How to compare clustering algorithms of numerical and nominal data

I have a dataset for clustering including numerical and nominal variables. I would like to compare the k-means and k-medoids clustering algorithms and I would also like to find the optimal k-value (...
Nab's user avatar
  • 51
4 votes
0 answers
29k views

k-means clustering why sum of squared errors (why k-medoids not)?

K-means clustering uses the sum of squared errors (SSE) $E = \sum\limits_{i=1}^k \sum\limits_{p \in C_i} (p-m_i)^2$ (with k clusters, C the set of objects in a cluster, m the center point of a ...
dominic's user avatar
  • 41
9 votes
2 answers
23k views

What is the benefit of using Manhattan distance for K-medoid than using Euclidean distance?

Please give me the reasons. I didn't find any k-medoid example that's calculation is done using Euclidean distance. All examples are made of Manhattan distance for k-medoid.
MD MOHIBULLA's user avatar
4 votes
1 answer
403 views

Cluster analysis without knowing the structure of the data set

I’m working on a task regarding cluster analysis for about half a year now, but since the fields of pattern recognition and cluster analysis are quite complex ones, I would call myself a beginner in ...
Leonard's user avatar
  • 41
2 votes
1 answer
100 views

FAMES in case of Dynamic Time Warping

I found this paper Using Pivots to Speed-Up k-Medoids Clustering in which authors explain how to use triangular geometry and cosine law to speed up search of new medoids in case of K-medoids. My ...
Kobe-Wan Kenobi's user avatar
4 votes
1 answer
2k views

K-Medoids swapping inside clusters

I'm a bit confused with concept of K-medoids. It seems that original algorithm (PAM) describes that swap step should be performed by swaping only one of the medoids with one non-medoid point from ...
Kobe-Wan Kenobi's user avatar
2 votes
1 answer
1k views

K-means++ like initialization for K-medoids

Does it make sense to use initialization in K-medoids like in the case of K-means++? To be precise - is it good to select "farthest" points as initial medoids? (farthest in sense that points that are ...
Kobe-Wan Kenobi's user avatar