Probabilistic Clustering Using Maximal Matrix Norm Couplings

10/10/2018
by   David Qiu, et al.
0

In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global optimum. In order to algorithmically solve this optimization problem, we propose two relaxations that are solved via gradient ascent and alternating maximization. Experiments on the MSR Sentence Completion Challenge, MovieLens 100K, and Reuters21578 datasets demonstrate that our approach is competitive with existing techniques and worthy of further investigation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2023

Quantum Vision Clustering

Unsupervised visual clustering has recently received considerable attent...
research
12/03/2011

Information-Maximization Clustering based on Squared-Loss Mutual Information

Information-maximization clustering learns a probabilistic classifier in...
research
06/14/2013

Constrained fractional set programs and their application in local clustering and community detection

The (constrained) minimization of a ratio of set functions is a problem ...
research
05/12/2022

Ensemble Clustering via Co-association Matrix Self-enhancement

Ensemble clustering integrates a set of base clustering results to gener...
research
12/06/2011

Entropy Search for Information-Efficient Global Optimization

Contemporary global optimization algorithms are based on local measures ...
research
10/26/2013

Efficient Information Theoretic Clustering on Discrete Lattices

We consider the problem of clustering data that reside on discrete, low ...
research
09/23/2020

An Information Theoretic approach to Post Randomization Methods under Differential Privacy

Post Randomization Methods (PRAM) are among the most popular disclosure ...

Please sign up or login with your details

Forgot password? Click here to reset