返回
Smooth representation learning from multi-view data
DOI:10.1016/j.inffus.2023.101916.png)
摘要
En 中文
Multi-view subspace clustering has aroused more and more attention due to its ability to explore data correlation from multiple views without stressful label annotations. Although a plethora of methods have been developed, they are powerless considering the original data may not be separable into subspaces. In this paper, we target to achieve a smooth representation from multi-view data which is committed to facilitating the downstream clustering task. Our assumption is that samples in the same cluster always tend to be densely connected. In detail, the proposed method can maintain the graph geometric structure by performing graph filtering to obtain the smooth representation. Furthermore, we unify the smooth representation learning and the subsequent multi-view clustering in a joint framework, hence the multi-view clustering-friendlyrepresentation can be expected. As a result, the smooth representation learning of each view and the achieving of multi-view clustering can be boosted in a mutual reinforcement manner towards an overall optimal solution. Extensive experiments on common multi-view datasets are conducted to demonstrate the effectiveness of our mode, compared to other SOTAs over the clustering performance.
Keyword:
Multi-view learning
Smooth representation
Graph filtering
Subspace clustering
期刊
IF:
15.5
论文数:
4.2K
被引数:
2.7W
机构
引用论文
Taurine modulation of hypochlorous acid-induced lung epithelial cell injury in vitro. Role of anion transport.牛磺酸对次氯酸诱导的体外肺上皮细胞损伤的调节作用。阴离子运输的作用。
Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance共识锚引导的无参数多视图子空间快速聚类

