An equivalence between log-sum-exp approximation and entropy regularization in <i>K</i>-means clustering

説明

<p>In this paper, we show an equivalence between log-sum-exp approximation and entropy regularization in K-means clustering, which is a well-known algorithm for partitional clustering. We derive an identical equation for updating centroids of clusters from the two formulations. Additionally, we derive an alternative equation suitable for another formulation of entropy regularization, maximum entropy method. We also show experimental results which support the theoretical results.</p>

収録刊行物

参考文献 (4)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ