Gaussian mixture models (GMM) can be seen as the probabilistic counterparts of the k-means clustering algorithm. Weighted k-means takes a set of weighted samples and arranges the centroids according to weighted means of the data clusters, where the weights are the weights of the samples. I wonder if there is a GMM-like probabilistic counterpart of weighted k-means.
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
2
|
|
|
|
|
1
|
pKNN+AL (Jain and Kapoor, 2009) is a probabilistic modification of the KNN classifier. Given a set of points ${x_1, \ldots, x_n}$ from $\mathbb{R}^d$, labels ${y_1, \ldots, y_n}$ from $[1,C]$, and a Mercer kernel $K$, the probability of $x$ belonging to class $c$ is $$\frac{\frac{1}{n_c} \sum_{\{i : y_i = c\}} K(x, x_i)}{\sum_{t=1}^C \frac{1}{n_t} \sum_{\{i : y_i = c\}} K(x, x_i)}$$ where $n_c$ is the number of $x_i$ that belong to class $c$. It is also an active learning algorithm and comes with a MATLAB implementation. |
|||
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
0
|
How about Clara, or even PAM? I think Clara is an interesting mix between k-means and PAM. |
||
|
0
|
Are you looking for a GMM with weighted samples? Please see my answer |
||
|
|
