Probabilistic Clustering using Maximal Matrix Norm Couplings
© 2018 IEEE. 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 op...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
IEEE,
2021-11-08T20:36:51Z.
|
| Subjects: | |
| Online Access: | Get fulltext |