Entropy based probabilistic collaborative clustering

doi:10.1016/j.patcog.2017.07.014

Entropy based probabilistic collaborative clustering

2017-12-01

32

OA

AI

DOI：10.1016/j.patcog.2017.07.014

Original

Save

View PDF

Abstract

En 中文

Unsupervised machine learning approaches involving several clustering algorithms working together to tackle difficult data sets are a recent area of research with a large number of applications such as clustering of distributed data, multi-expert clustering, multi-scale clustering analysis or multi-view clustering. Most of these frameworks can be regrouped under the umbrella of collaborative clustering, the aim of which is to reveal the common underlying structures found by the different algorithms while analyzing the data. Within this context, the purpose of this article is to propose a collaborative framework lifting the limitations of many of the previously proposed methods: Our proposed collaborative learning method makes possible for a wide range of clustering algorithms from different families to work together based solely on their clustering solutions, thus lifting previous limitation requiring identical prototypes between the different collaborators. Our proposed framework uses a variational EM as its theoretical basis for the collaboration process and can be applied to any of the previously mentioned collaborative contexts. In this article, we give the main ideas and theoretical foundations of our method, and we demonstrate its effectiveness in a series of experiments on real data sets as well as data sets from the literature. (C) 2017 Elsevier Ltd. All rights reserved.

Keywords:

Collaborative clustering

EM algorithms

Entropy based methods

Entropy based probabilistic collaborative clustering

Abstract

AI Summary

Journal

Organization