Xuanqi Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xuanqi Zhang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Qiangqiang Shen
Department of Computer Science, City University of Hong Kong, Hong Kong, China
2 shared publications - Yongyong Chen
School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China
2 shared publications - Guokai Zhang
School of Safety Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China
1 shared publication - Jingyong Su
Harbin Institute of Technology (Shenzhen)
1 shared publication - Shuqin Wang
College of Science, Shandong University of Aeronautics, Binzhou, China
1 shared publication - Yongsheng Liang
College of Electronics and Information Engineering, Shenzhen University, Shenzhen, China
1 shared publication
Latest Publications
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 9 (1) , 455-467
Dual Completion Learning for Incomplete Multi-View Clustering
Incomplete Multi-View Clustering (IMVC) offers a way to analyze incomplete data, facilitating the inference of unobserved and missing data points through completion techniques. However, existing IMVC methods, predominantly depending on either data completion or similarity matrix completion, failed to uncover the inherent geometric structure and potential complementary information between intra- and inter-views, causing incomplete similarity matrices to further tear apart the connections between views. To address this problem, we propose Dual Completion Learning for Incomplete Multi-view Clustering (DCIMC), which elaborately designs data completion and similarity tensor completion, and fuses both of them into a unified model to effectively recover the missing samples and similarities. Concretely, in data completion, DCIMC utilizes subspace clustering to recover the missing and unknown instances directly. Meanwhile, in similarity tensor completion, DCIMC introduces the idea of tensor completion to make better use of the high-order complementary information from multi-view data. By fusing the dual completions, missing information and complementary information in each completion are fully explored by each other, reciprocally enhancing one another to boost the accuracy of our clustering algorithm. Experimental results on various datasets show the effectiveness of the proposed DCIMC. Moreover, our DCIMC also achieved superior or comparable performance in an extended comparison with recent deep learning-based multi-view clustering algorithms.
- 13 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 9 (1) , 455-467
Dual Completion Learning for Incomplete Multi-View Clustering
Incomplete Multi-View Clustering (IMVC) offers a way to analyze incomplete data, facilitating the inference of unobserved and missing data points through completion techniques. However, existing IMVC methods, predominantly depending on either data completion or similarity matrix completion, failed to uncover the inherent geometric structure and potential complementary information between intra- and inter-views, causing incomplete similarity matrices to further tear apart the connections between views. To address this problem, we propose Dual Completion Learning for Incomplete Multi-view Clustering (DCIMC), which elaborately designs data completion and similarity tensor completion, and fuses both of them into a unified model to effectively recover the missing samples and similarities. Concretely, in data completion, DCIMC utilizes subspace clustering to recover the missing and unknown instances directly. Meanwhile, in similarity tensor completion, DCIMC introduces the idea of tensor completion to make better use of the high-order complementary information from multi-view data. By fusing the dual completions, missing information and complementary information in each completion are fully explored by each other, reciprocally enhancing one another to boost the accuracy of our clustering algorithm. Experimental results on various datasets show the effectiveness of the proposed DCIMC. Moreover, our DCIMC also achieved superior or comparable performance in an extended comparison with recent deep learning-based multi-view clustering algorithms.
- Open Access
- 4 May 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 17 (7) , 1-19
Multi-view Ensemble Clustering via Low-rank and Sparse Decomposition: From Matrix to Tensor
As a significant extension of classical clustering methods, ensemble clustering first generates multiple basic clusterings and then fuses them into one consensus partition by solving a problem concerning graph partition with respect to the co-association matrix. Although the collaborative cluster structure among basic clusterings can be well discovered by ensemble clustering, most advanced ensemble clustering utilizes the self-representation strategy with the constraint of low-rank to explore a shared consensus representation matrix in multiple views. However, they still encounter two challenges: (1) high computational cost caused by both the matrix inversion operation and singular value decomposition of large-scale square matrices; (2) less considerable attention on high-order correlation attributed to the pursue of the two-dimensional pair-wise relationship matrix. In this article, based on low-rank and sparse decomposition from both matrix and tensor perspectives, we propose two novel multi-view ensemble clustering methods, which tangibly decrease computational complexity. Specifically, our first method utilizes low-rank and sparse matrix decomposition to learn one common co-association matrix, while our last method constructs all co-association matrices into one third-order tensor to investigate the high-order correlation among multiple views by low-rank and sparse tensor decomposition. We adopt the alternating direction method of multipliers to solve two convex models by dividing them into several subproblems with closed-form solution. Experimental results on ten real-world datasets prove the effectiveness and efficiency of the proposed two multi-view ensemble clustering methods by comparing them with other advanced ensemble clustering methods.
- 4 May 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 17 (7) , 1-19
Open AccessMulti-view Ensemble Clustering via Low-rank and Sparse Decomposition: From Matrix to Tensor
As a significant extension of classical clustering methods, ensemble clustering first generates multiple basic clusterings and then fuses them into one consensus partition by solving a problem concerning graph partition with respect to the co-association matrix. Although the collaborative cluster structure among basic clusterings can be well discovered by ensemble clustering, most advanced ensemble clustering utilizes the self-representation strategy with the constraint of low-rank to explore a shared consensus representation matrix in multiple views. However, they still encounter two challenges: (1) high computational cost caused by both the matrix inversion operation and singular value decomposition of large-scale square matrices; (2) less considerable attention on high-order correlation attributed to the pursue of the two-dimensional pair-wise relationship matrix. In this article, based on low-rank and sparse decomposition from both matrix and tensor perspectives, we propose two novel multi-view ensemble clustering methods, which tangibly decrease computational complexity. Specifically, our first method utilizes low-rank and sparse matrix decomposition to learn one common co-association matrix, while our last method constructs all co-association matrices into one third-order tensor to investigate the high-order correlation among multiple views by low-rank and sparse tensor decomposition. We adopt the alternating direction method of multipliers to solve two convex models by dividing them into several subproblems with closed-form solution. Experimental results on ten real-world datasets prove the effectiveness and efficiency of the proposed two multi-view ensemble clustering methods by comparing them with other advanced ensemble clustering methods.