High-dimensional multi-view clustering methods

Alaeddine Zahir, Khalide Jbilou, Ahmed Ratnani
3/14/2023
cs.LGmath.NA

No confident code implementation found for this paper.

Abstract

Multi-view clustering has been widely used in recent years in comparison to single-view clustering, for clear reasons, as it offers more insights into the data, which has brought with it some challenges, such as how to combine these views or features. Most of recent work in this field focuses mainly on tensor representation instead of treating the data as simple matrices. This permits to deal with the high-order correlation between the data which the based matrix approach struggles to capture. Accordingly, we will examine and compare these approaches, particularly in two categories, namely graph-based clustering and subspace-based clustering. We will conduct and report experiments of the main clustering methods over a benchmark datasets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zahir2023highdimensional,
  title  = {High-dimensional multi-view clustering methods},
  author = {Alaeddine Zahir and Khalide Jbilou and Ahmed Ratnani},
  year   = {2023},
  eprint = {2303.08582},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.08582v2}
}

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/2303.08582.svg)](https://codeofpaper.com/paper/2303.08582)

Discussion