DeepAI AI Chat
Log In Sign Up

Semi-Supervised Information-Maximization Clustering

by   Daniele Calandriello, et al.
Politecnico di Milano

Semi-supervised clustering aims to introduce prior knowledge in the decision process of a clustering algorithm. In this paper, we propose a novel semi-supervised clustering algorithm based on the information-maximization principle. The proposed method is an extension of a previous unsupervised information-maximization clustering algorithm based on squared-loss mutual information to effectively incorporate must-links and cannot-links. The proposed method is computationally efficient because the clustering solution can be obtained analytically via eigendecomposition. Furthermore, the proposed method allows systematic optimization of tuning parameters such as the kernel width, given the degree of belief in the must-links and cannot-links. The usefulness of the proposed method is demonstrated through experiments.


page 1

page 2

page 3

page 4


Information-Maximization Clustering based on Squared-Loss Mutual Information

Information-maximization clustering learns a probabilistic classifier in...

Who and Where: People and Location Co-Clustering

In this paper, we consider the clustering problem on images where each i...

A Least Square Approach to Semi-supervised Local Cluster Extraction

A least square semi-supervised local clustering algorithm based on the i...

Functional data clustering via information maximization

A new method for clustering functional data is proposed via information ...

Applying Semi-Automated Hyperparameter Tuning for Clustering Algorithms

When approaching a clustering problem, choosing the right clustering alg...

Decentralized Clustering and Linking by Networked Agents

We consider the problem of decentralized clustering and estimation over ...

Semi-supervised K-means++

Traditionally, practitioners initialize the k-means algorithm with cent...