Label Learning Method Based on Tensor Projection
Pages 1599 - 1609
Abstract
Multi-view clustering method based on anchor graph has been widely concerned due to its high efficiency and effectiveness. In order to avoid post-processing, most of the existing anchor graph-based methods learn bipartite graphs with connected components. However, such methods have high requirements on parameters, and in some cases it may not be possible to obtain bipartite graphs with clear connected components. To end this, we propose a label learning method based on tensor projection (LLMTP). Specifically, we project anchor graph into the label space through an orthogonal projection matrix to obtain cluster labels directly. Considering that the spatial structure information of multi-view data may be ignored to a certain extent when projected in different views separately, we extend the matrix projection transformation to tensor projection, so that the spatial structure information between views can be fully utilized. In addition, we introduce the tensor Schatten p-norm regularization to make the clustering label matrices of different views as consistent as possible. Extensive experiments have proved the effectiveness of the proposed method.
Supplemental Material
MP4 File - Label Learning Method Based on Tensor Projection
Promotional Video
- Download
- 6.26 MB
References
[1]
Navneet Dalal and Bill Triggs. 2005. Histograms of oriented gradients for human detection. In 2005 IEEE computer society conference on computer vision and pattern recognition (CVPR'05), Vol. 1. Ieee, 886--893.
[2]
Quanxue Gao, Zhizhen Wan, Ying Liang, Qianqian Wang, Yang Liu, and Ling Shao. 2020. Multi-view projected clustering with graph learning. Neural Networks, Vol. 126 (2020), 335--346. https://doi.org/10.1016/J.NEUNET.2020.03.020
[3]
Quanxue Gao, Pu Zhang, Wei Xia, Deyan Xie, Xinbo Gao, and Dacheng Tao. 2021. Enhanced Tensor RPCA and its Application. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 43, 6 (2021), 2133--2140.
[4]
Zhezheng Hao, Zhoumin Lu, Guoxu Li, Feiping Nie, Rong Wang, and Xuelong Li. 2024. Ensemble Clustering With Attentional Representation. IEEE Trans. Knowl. Data Eng., Vol. 36, 2 (2024), 581--593. https://doi.org/10.1109/TKDE.2023.3292573
[5]
Yanfang He and Umi Kalsom Yusof. 2023. Self-Weighted Graph-Based Framework for Multi-View Clustering. IEEE Access, Vol. 11 (2023), 30197--30207. https://doi.org/10.1109/ACCESS.2023.3260971
[6]
Zhao Kang, Wangtao Zhou, Zhitong Zhao, Junming Shao, Meng Han, and Zenglin Xu. 2020. Large-scale multi-view subspace clustering in linear time. In Proceedings of the AAAI conference on Artificial Intelligence. 4412--4419.
[7]
Misha E Kilmer and Carla D Martin. 2011. Factorization strategies for third-order tensors. Linear Algebra Appl., Vol. 435, 3 (2011), 641--658.
[8]
Jing Li, Quanxue Gao, Qianqian Wang, Ming Yang, and Wei Xia. 2023a. Orthogonal Non-negative Tensor Factorization based Multi-view Clustering. In Thirty-seventh Conference on Neural Information Processing Systems.
[9]
Jinghao Li, Xiaoqian Zhang, Jing Wang, Xiao Wang, Zhen Tan, and Huaijiang Sun. 2023b. Projection-based coupled tensor learning for robust multi-view clustering. Inf. Sci., Vol. 632 (2023), 664--677. https://doi.org/10.1016/J.INS.2023.03.072
[10]
Xuelong Li, Han Zhang, Rong Wang, and Feiping Nie. 2022. Multiview Clustering: A Scalable and Parameter-Free Bipartite Graph Fusion Method. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 44, 1 (2022), 330--344.
[11]
Han Lu, Huafu Xu, Qianqian Wang, Quanxue Gao, Ming Yang, and Xinbo Gao. 2024. Efficient Multi-View -Means for Image Clustering. IEEE Trans. Image Process., Vol. 33 (2024), 273--284. https://doi.org/10.1109/TIP.2023.3340609
[12]
Shirui Luo, Changqing Zhang, Wei Zhang, and Xiaochun Cao. 2018. Consistent and specific multi-view subspace clustering. In Thirty-second AAAI conference on artificial intelligence.
[13]
Shikun Mei, Wenhui Zhao, Quanxue Gao, Ming Yang, and Xinbo Gao. 2023. Joint feature selection and optimal bipartite graph learning for subspace clustering. Neural Networks, Vol. 164 (2023), 408--418. https://doi.org/10.1016/J.NEUNET.2023.04.044
[14]
Aude Oliva and Antonio Torralba. 2001. Modeling the shape of the scene: A holistic representation of the spatial envelope. International journal of computer vision, Vol. 42 (2001), 145--175.
[15]
Xiaoshuang Sang, Jianfeng Lu, and Hong Lu. 2022. Consensus graph learning for auto-weighted multi-view projection clustering. Inf. Sci., Vol. 609 (2022), 816--837. https://doi.org/10.1016/J.INS.2022.07.119
[16]
Chuan Tang, Kun Sun, Chang Tang, Xiao Zheng, Xinwang Liu, Jun-Jie Huang, and Wei Zhang. 2023. Multi-view subspace clustering via adaptive graph learning and late fusion alignment. Neural Networks, Vol. 165 (2023), 333--343. https://doi.org/10.1016/J.NEUNET.2023.05.019
[17]
Beilei Wang, Yun Xiao, Zhihui Li, Xuanhong Wang, Xiaojiang Chen, and Dingyi Fang. 2020. Robust Self-Weighted Multi-View Projection Clustering. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020. AAAI Press, 6110--6117. https://doi.org/10.1609/AAAI.V34I04.6075
[18]
Haiyue Wang, Quan Wang, Qiguang Miao, and Xiaoke Ma. 2024b. Joint learning of data recovering and graph contrastive denoising for incomplete multi-view clustering. Inf. Fusion, Vol. 104 (2024), 102155. https://doi.org/10.1016/J.INFFUS.2023.102155
[19]
Hao Wang, Yan Yang, and Bing Liu. 2019. GMC: Graph-based multi-view clustering. IEEE Transactions on Knowledge and Data Engineering, Vol. 32, 6 (2019), 1116--1129.
[20]
Haiyue Wang, Wensheng Zhang, and Xiaoke Ma. 2022b. Clustering of noised and heterogeneous multi-view data with graph learning and projection decomposition. Knowl. Based Syst., Vol. 255 (2022), 109736. https://doi.org/10.1016/J.KNOSYS.2022.109736
[21]
Siwei Wang, Xinwang Liu, Suyuan Liu, Jiaqi Jin, Wenxuan Tu, Xinzhong Zhu, and En Zhu. 2022a. Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences. In Advances in Neural Information Processing Systems 35, Sanmi Koyejo, S. Mohamed, A. Agarwal, Danielle Belgrave, K. Cho, and A. Oh (Eds.).
[22]
Siwei Wang, Xinwang Liu, Xinzhong Zhu, Pei Zhang, Yi Zhang, Feng Gao, and En Zhu. 2021. Fast parameter-free multi-view subspace clustering with consensus anchor guidance. IEEE Transactions on Image Processing, Vol. 31 (2021), 556--568.
[23]
Ziyu Wang, Lusi Li, Xin Ning, Wenkai Tan, Yongxin Liu, and Houbing Song. 2024a. Incomplete multi-view clustering via structure exploration and missing-view inference. Inf. Fusion, Vol. 103 (2024), 102123. https://doi.org/10.1016/J.INFFUS.2023.102123
[24]
Jianlong Wu, Zhouchen Lin, and Hongbin Zha. 2019. Essential Tensor Learning for Multi-View Spectral Clustering. IEEE Transactions on Image Processing, Vol. 28, 12 (2019), 5910--5922.
[25]
Wei Xia, Quanxue Gao, Qianqian Wang, Xinbo Gao, Chris Ding, and Dacheng Tao. 2023. Tensorized Bipartite Graph Learning for Multi-View Clustering. IEEE Trans. Pattern Anal. Mach. Intell., Vol. 45, 4 (2023), 5187--5202. https://doi.org/10.1109/TPAMI.2022.3187976
[26]
Qingjiang Xiao, Shiqiang Du, Kaiwu Zhang, Jinmei Song, and Yixuan Huang. 2023. Adaptive sparse graph learning for multi-view spectral clustering. Appl. Intell., Vol. 53, 12 (2023), 14855--14875. https://doi.org/10.1007/S10489-022-04267--9
[27]
Yuan Xie, Shuhang Gu, Yan Liu, Wangmeng Zuo, Wensheng Zhang, and Lei Zhang. 2016. Weighted Schatten p-norm minimization for image denoising and background subtraction. IEEE Trans. Image Process., Vol. 25, 10 (2016), 4842--4857.
[28]
Huiling Xu, Xiangdong Zhang, Wei Xia, Quanxue Gao, and Xinbo Gao. 2020. Low-rank tensor constrained co-regularized multi-view spectral clustering. Neural Networks, Vol. 132 (2020), 245--252.
[29]
Ben Yang, Jinghan Wu, Xuetao Zhang, Xinhu Zheng, Feiping Nie, and Badong Chen. 2024. Discrete correntropy-based multi-view anchor-graph clustering. Inf. Fusion, Vol. 103 (2024), 102097. https://doi.org/10.1016/J.INFFUS.2023.102097
[30]
Ben Yang, Xuetao Zhang, Feiping Nie, Fei Wang, Weizhong Yu, and Rong Wang. 2021. Fast Multi-View Clustering via Nonnegative and Orthogonal Factorization. IEEE Transactions on Image Processing, Vol. 30 (2021), 2575--2586.
[31]
Haizhou Yang, Quanxue Gao, Wei Xia, Ming Yang, and Xinbo Gao. 2022. Multiview Spectral Clustering With Bipartite Graph. IEEE Trans. Image Process., Vol. 31 (2022), 3591--3605. https://doi.org/10.1109/TIP.2022.3171411
[32]
Hui Yu, Mingjing Li, Hong-Jiang Zhang, and Jufu Feng. 2002. Color texture moments for content-based image retrieval. In Proceedings. International Conference on Image Processing, Vol. 3. IEEE, 929--932.
[33]
Yu Yun, Jing Li, Quanxue Gao, Ming Yang, and Xinbo Gao. 2023. Low-rank discrete multi-view spectral clustering. Neural Networks, Vol. 166 (2023), 137--147. https://doi.org/10.1016/J.NEUNET.2023.06.038
[34]
Zhiyuan Zha, Xin Yuan, Bihan Wen, Jiantao Zhou, Jiachao Zhang, and Ce Zhu. 2020. A benchmark for sparse coding: When group sparsity meets rank minimization. IEEE Transactions on Image Processing, Vol. 29 (2020), 5094--5109.
[35]
Kun Zhan, Changqing Zhang, Junpeng Guan, and Junsheng Wang. 2018. Graph Learning for Multiview Clustering. IEEE Trans. Cybern., Vol. 48, 10 (2018), 2887--2895. https://doi.org/10.1109/TCYB.2017.2751646
[36]
Zihao Zhang, Qianqian Wang, Zhiqiang Tao, Quanxue Gao, and Wei Feng. 2023. Dropping Pathways Towards Deep Multi-View Graph Subspace Clustering Networks. In Proceedings of the 31st ACM International Conference on Multimedia. ACM, 3259--3267. https://doi.org/10.1145/3581783.3612332
[37]
Mingyu Zhao, Weidong Yang, and Feiping Nie. 2023b. Auto-weighted orthogonal and nonnegative graph reconstruction for multi-view clustering. Inf. Sci., Vol. 632 (2023), 324--339. https://doi.org/10.1016/J.INS.2023.03.016
[38]
Wenhui Zhao, Quanxue Gao, Shikun Mei, and Ming Yang. 2023a. Contrastive self-representation learning for data clustering. Neural Networks, Vol. 167 (2023), 648--655. https://doi.org/10.1016/J.NEUNET.2023.08.050
[39]
Qian Zhou, Haizhou Yang, and Quanxue Gao. 2022. Low-rank constraint bipartite graph learning. Neurocomputing, Vol. 511 (2022), 426--436. https://doi.org/10.1016/J.NEUCOM.2022.09.002
Index Terms
- Label Learning Method Based on Tensor Projection
Index terms have been assigned to the content through auto-classification.
Recommendations
Enhanced tensor low-rank representation learning for multi-view clustering
AbstractMulti-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 ...
Highlights- Capturing intrinsic high-order correlations underlying multi-view data.
- ...
Incomplete multi-view clustering via confidence graph completion based tensor decomposition
AbstractIn recent years, extensive incomplete multi-view clustering models have been proposed to solve the problem of real-world multi-view data with missing views. However, they still have the following two drawbacks: (1) They ignore the harmful effects ...
Highlights- A graph completion based tensor decomposition is developed for IMC tasks.
- The confidence graphs are used to guide the learning of the complete graphs.
- The original is decomposed into an essential tensor and a noise tensor.
- The ...
Federated Fuzzy C-means with Schatten-p Norm Minimization
MM '24: Proceedings of the 32nd ACM International Conference on MultimediaMulti-view clustering has emerged as an important unsupervised method to process unlabelled multi-view data that provides a comprehensive description of an object. Existing multi-view clustering methods focus on centralized settings but ignore the fact ...
Comments
Information & Contributors
Information
Published In
August 2024
6901 pages
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 August 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
August 25 - 29, 2024
Barcelona, Spain
Acceptance Rates
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 127Total Downloads
- Downloads (Last 12 months)127
- Downloads (Last 6 weeks)29
Reflects downloads up to 21 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in