Enhanced tensor low-rank representation learning for multi-view clustering

张量(固有定义) 聚类分析 子空间拓扑 数学 秩(图论) 计算机科学 人工智能 组合数学 纯数学
作者
Deyan Xie,Quanxue Gao,Ming Yang
出处
期刊:Neural Networks [Elsevier BV]
卷期号:161: 93-104 被引量:40
标识
DOI:10.1016/j.neunet.2023.01.037
摘要

Multi-view subspace clustering (MSC), assuming the multi-view data are generated from a latent subspace, has attracted considerable attention in multi-view clustering. To recover the underlying subspace structure, a successful approach adopted recently is subspace clustering based on tensor nuclear norm (TNN). But there are some limitations to this approach that the existing TNN-based methods usually fail to exploit the intrinsic cluster structure and high-order correlations well, which leads to limited clustering performance. To address this problem, the main purpose of this paper is to propose a novel tensor low-rank representation (TLRR) learning method to perform multi-view clustering. First, we construct a 3rd-order tensor by organizing the features from all views, and then use the t-product in the tensor space to obtain the self-representation tensor of the tensorial data. Second, we use the ℓ1,2 norm to constrain the self-representation tensor to make it capture the class-specificity distribution, that is important for depicting the intrinsic cluster structure. And simultaneously, we rotate the self-representation tensor, and use the tensor singular value decomposition-based weighted TNN as a tighter tensor rank approximation to constrain the rotated tensor. For the challenged mathematical optimization problem, we present an effective optimization algorithm with a theoretical convergence guarantee and relatively low computation complexity. The constructed convergent sequence to the Karush-Kuhn-Tucker (KKT) critical point solution is mathematically validated in detail. We perform extensive experiments on four datasets and demonstrate that TLRR outperforms state-of-the-art multi-view subspace clustering methods.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
lilily12376完成签到 ,获得积分10
1秒前
111完成签到,获得积分10
1秒前
复杂的鸿发布了新的文献求助10
2秒前
M张完成签到,获得积分10
2秒前
oi应助无风采纳,获得10
3秒前
搜集达人应助rio采纳,获得10
3秒前
旭旭发布了新的文献求助10
3秒前
4秒前
4秒前
桐桐应助铭铭子采纳,获得10
4秒前
5秒前
情怀应助phonetwo采纳,获得10
5秒前
6秒前
HMethod完成签到 ,获得积分0
6秒前
7秒前
ldkshifo完成签到,获得积分10
7秒前
酷波er应助LMZ采纳,获得10
7秒前
xiaoxiaozi完成签到,获得积分20
8秒前
希望天下0贩的0应助不易采纳,获得10
8秒前
小二郎应助wangwangwang采纳,获得10
8秒前
8秒前
Hello应助复杂的鸿采纳,获得10
9秒前
FashionBoy应助炙热睿渊采纳,获得10
9秒前
9秒前
10秒前
10秒前
qqq发布了新的文献求助10
11秒前
铭铭子发布了新的文献求助10
11秒前
洁净的依凝完成签到,获得积分10
12秒前
会飞的流氓兔完成签到 ,获得积分10
12秒前
欢呼曼荷完成签到,获得积分10
13秒前
Korai完成签到 ,获得积分10
13秒前
zll发布了新的文献求助10
14秒前
隐形曼青应助学术达人cj采纳,获得10
15秒前
rio发布了新的文献求助10
15秒前
15秒前
田様应助liangbingyan采纳,获得10
15秒前
16秒前
16秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Reducing Compassion Fatigue, Secondary Traumatic Stress and Burnout 600
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Mammalian Synthetic Biology 500
Auslegungsgeschichte 500
Cosmos as Art Object: Studies in Plato's Timaeus and Other Dialogues 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7638299
求助须知:如何正确求助?哪些是违规求助? 9211617
关于积分的说明 19759396
捐赠科研通 7205313
什么是DOI,文献DOI怎么找? 3275838
关于科研通互助平台的介绍 2437432
邀请新用户注册赠送积分活动 2273029