SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2403.09107 · CVPR · 2024

S 2 MVTC: a Simple yet Efficient Scalable Multi-View Tensor Clustering

Ce Zhu, Yazhou Ren, Zhen Long, Yipeng Liu, Qiyuan Wang

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Anchor-based large-scale multi-view clustering has attracted considerable attention for its effectiveness in handling massive datasets. However, current methods mainly seek the consensus embedding feature for clustering by exploring global correlations between anchor graphs or projection matrices. In this paper, we propose a simple yet efficient scalable multi-view tensor clustering (S 2 MVTC) approach, where our focus is on learning correlations of embedding features within and across views. Specifically, we first construct the embedding feature tensor by stacking the embedding features of different views into a tensor and rotating it. Additionally, we build a novel tensor low-frequency approximation (TLFA) operator, which incorporates graph similarity into embedding feature learning, efficiently achieving smooth representation of embedding features within different views. Furthermore, consensus constraints are applied to embedding features to ensure inter-view semantic consistency. Experimental results on six large-scale multi-view datasets demonstrate that S 2 MVTC significantly outperforms stateof-the-art algorithms in terms of clustering performance and CPU execution time, especially when handling massive data. The code of S 2 MVTC is publicly available at https://github.com/longzhen520/S2MVTC.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2403.09107")
get_code_for_paper("2403.09107")
have("2403.09107")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2403.09107.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2403.09107.svg)](https://syntology.ai/paper/2403.09107)

Connect an agent — have() is free.