Multi-view Information-theoretic Co-clustering for Co-occurrence Data

Peng Xu, Zhaohong Deng, Kup-Sze Choi, Longbing Cao, Shitong Wang
5/25/2019
cs.LGstat.ML

Official code: DallasBuyer/MVITCC (4 stars, last commit 2019-07-11).

Abstract

Multi-view clustering has received much attention recently. Most of the existing multi-view clustering methods only focus on one-sided clustering. As the co-occurring data elements involve the counts of sample-feature co-occurrences, it is more efficient to conduct two-sided clustering along the samples and features simultaneously. To take advantage of two-sided clustering for the co-occurrences in the scene of multi-view clustering, a two-sided multi-view clustering method is proposed, i.e., multi-view information-theoretic co-clustering (MV-ITCC). The proposed method realizes two-sided clustering for co-occurring multi-view data under the formulation of information theory. More specifically, it exploits the agreement and disagreement among views by sharing a common clustering results along the sample dimension and keeping the clustering results of each view specific along the feature dimension. In addition, the mechanism of maximum entropy is also adopted to control the importance of different views, which can give a right balance in leveraging the agreement and disagreement. Extensive experiments are conducted on text and image multi-view datasets. The results clearly demonstrate the superiority of the proposed method.

View on arXivView PDF

Code Implementations(1)

DallasBuyer/MVITCCOfficial100%

The code of MVITCC accepted by AAAI19

40MATLABNov 13, 20187 years ago

Similar Papers

Cite this paper

@article{xu2019multiview,
  title  = {Multi-view Information-theoretic Co-clustering for Co-occurrence Data},
  author = {Peng Xu and Zhaohong Deng and Kup-Sze Choi and Longbing Cao and Shitong Wang},
  year   = {2019},
  eprint = {1905.10594},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1905.10594}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1905.10594.svg)](https://codeofpaper.com/paper/1905.10594)

Discussion