Weixuan Liang

Weixuan Liang

Auto-generated profile, based on publicly available information

Weixuan Liang

National University of Defense Technology, Changsha, Hunan, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
XWXinhang Wan
Xinhang Wan
XLXinwang Liu
Xinwang Liu
JLJiyuan Liu
Jiyuan Liu
SWSiwei Wang
Siwei Wang
YWYi Wen
Yi Wen
LZlu zhou
lu zhou
Multi-view clustering has gained broad attention owing to its capacity to exploit complementary information across multiple data views. Although existing methods demonstrate delightful clustering performance, most of them are of high time complexity and cannot handle large-scale data. Matrix factorization-based models are a representative of solving this problem. However, they assume that the views share a dimension-fixed consensus coefficient matrix and view-specific base matrices, limiting their representability. Moreover, a series of large-scale algorithms that bear one or more hyperparameters are impractical in real-world applications. To address the two issues, we propose an auto-weighted multi-view clustering (AWMVC) algorithm. Specifically, AWMVC first learns coefficient matrices from corresponding base matrices of different dimensions, then fuses them to obtain an optimal consensus matrix. By mapping original features into distinctive low-dimensional spaces, we can attain more comprehensive knowledge, thus obtaining better clustering results. Moreover, we design a six-step alternative optimization algorithm proven to be convergent theoretically. Also, AWMVC shows excellent performance on various benchmark datasets compared with existing ones. The code of AWMVC is publicly available at https://github.com/wanxinhang/AAAI-2023-AWMVC.

19 April 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
XWXinhang Wan
Xinhang Wan
BXBin Xiao
Bin Xiao
XLXinwang Liu
Xinwang Liu
JLJiyuan Liu
Jiyuan Liu
WLWeixuan Liang
Weixuan Liang
EZEn Zhu
En Zhu
Multi-view clustering (MVC) has attracted broad attention due to its capacity to exploit consistent and complementary information across views. This paper focuses on a challenging issue in MVC called the incomplete continual data problem (ICDP). Specifically, most existing algorithms assume that views are available in advance and overlook the scenarios where data observations of views are accumulated over time. Due to privacy considerations or memory limitations, previous views cannot be stored in these situations. Some works have proposed ways to handle this problem, but all of them fail to address incomplete views. Such an incomplete continual data problem (ICDP) in MVC is difficult to solve since incomplete information with continual data increases the difficulty of extracting consistent and complementary knowledge among views. We propose Fast Continual Multi-View Clustering with Incomplete Views (FCMVC-IV) to address this issue. Specifically, the method maintains a scalable consensus coefficient matrix and updates its knowledge with the incoming incomplete view rather than storing and recomputing all the data matrices. Considering that the given views are incomplete, the newly collected view might contain samples that have yet to appear; two indicator matrices and a rotation matrix are developed to match matrices with different dimensions. In addition, we design a three-step iterative algorithm to solve the resultant problem with linear complexity and proven convergence. Comprehensive experiments conducted on various datasets demonstrate the superiority of FCMVC-IV over the competing approaches. The code is publicly available at https://github.com/wanxinhang/FCMVC-IV .

2 August 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YWYi Wen
Yi Wen
SWSiwei Wang
Siwei Wang
QLQing Liao
Qing Liao
WLWeixuan Liang
Weixuan Liang
KLKe Liang
Ke Liang
XLXinwang Liu
Xinwang Liu
Multi-view clustering (MVC), which effectively fuses information from multiple views for better performance, has received increasing attention. Most existing MVC methods assume that multi-view data are fully paired, which means that the mappings of all corresponding samples between views are predefined or given in advance. However, the data correspondence is often incomplete in real-world applications due to data corruption or sensor differences, referred to as the data-unpaired problem (DUP) in multi-view literature. Although several attempts have been made to address the DUP issue, they suffer from the following drawbacks: 1) most methods focus on the feature representation while ignoring the structural information of multi-view data, which is essential for clustering tasks; 2) existing methods for partially unpaired problems rely on pregiven cross-view alignment information, resulting in their inability to handle fully unpaired problems; and 3) their inevitable parameters degrade the efficiency and applicability of the models. To tackle these issues, we propose a novel parameter-free graph clustering framework termed unpaired multi-view graph clustering framework with cross-view structure matching (UPMGC-SM). Specifically, unlike the existing methods, UPMGC-SM effectively utilizes the structural information from each view to refine cross-view correspondences. Besides, our UPMGC-SM is a unified framework for both the fully and partially unpaired multi-view graph clustering. Moreover, existing graph clustering methods can adopt our UPMGC-SM to enhance their ability for unpaired scenarios. Extensive experiments demonstrate the effectiveness and generalization of our proposed framework for both paired and unpaired datasets.

18 September 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
WLWeixuan Liang
Weixuan Liang
SZSihang Zhou
Sihang Zhou
JXJian Xiong
Jian Xiong
XLXinwang Liu
Xinwang Liu
SWSiwei Wang
Siwei Wang
XXXin Xu
Xin Xu
Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data by performing clustering on the learned optimal embedding across views. Though demonstrating promising performance in various applications, most of existing methods usually linearly combine a group of pre-specified first-order Laplacian matrices to construct the optimal Laplacian matrix, which may result in limited representation capability and insufficient information exploitation. Also, storing and implementing complex operations on the {$n\times n}$ Laplacian matrices incurs intensive storage and computation complexity. To address these issues, this paper first proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix, and then extends it to the late fusion version for accurate and efficient multi-view clustering. Specifically, our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base Laplacian matrices simultaneously. By this way, the representative capacity of the learned optimal Laplacian matrix is enhanced, which is helpful to better utilize the hidden high-order connection information among data, leading to improved clustering performance. We design an efficient algorithm with proved convergence to solve the resultant optimization problem. Extensive experimental results on nine datasets demonstrate the superiority of the proposed algorithm

26 October 2023
Verified
Conference Paper
Open access
YWYi Wen
Yi Wen
SWSiwei Wang
Siwei Wang
KLKe Liang
Ke Liang
WLWeixuan Liang
Weixuan Liang
XWXinhang Wan
Xinhang Wan
EZEn Zhu
En Zhu
The success of existing multi-view clustering (MVC) relies on the assumption that all views are complete. However, samples are usually partially available due to data corruption or sensor malfunction, which raises the research of incomplete multi-view clustering (IMVC). Although several anchor-based IMVC methods have been proposed to process the large-scale incomplete data, they still suffer from the following drawbacks: i) Most existing approaches neglect the inter-view discrepancy and enforce cross-view representation to be consistent, which would corrupt the representation capability of the model; ii) Due to the samples disparity between different views, the learned anchor might be misaligned, which we referred as the Anchor-Unaligned Problem for Incomplete data (AUP-ID). Such the AUP-ID would cause inaccurate graph fusion and degrades clustering performance. To tackle these issues, we propose a novel incomplete anchor graph learning framework termed Scalable Incomplete Multi-View Clustering with Structure Alignment (SIMVC-SA). Specially, we construct the view-specific anchor graph to capture the complementary information from different views. In order to solve the AUP-ID, we propose a novel structure alignment module to refine the cross-view anchor correspondence. Meanwhile, the anchor graph construction and alignment are jointly optimized in our unified framework to enhance clustering quality. Through anchor graph construction instead of full graphs, the time and space complexity of the proposed SIMVC-SA is proven to be linearly correlated with the number of samples. Extensive experiments on seven incomplete benchmark datasets demonstrate the effectiveness and efficiency of our proposed method. Our code is publicly available at https://github.com/wy1019/SIMVC-SA.

6 January 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
MLMiaomiao Li
Miaomiao Li
XLXinwang Liu
Xinwang Liu
YZYi Zhang
Yi Zhang
WLWeixuan Liang
Weixuan Liang
Multiview clustering (MVC) sufficiently exploits the diverse and complementary information among different views to improve the clustering performance. As a representative algorithm of MVC, the newly proposed simple multiple kernel k -means (SimpleMKKM) algorithm takes a min-max formulation and applies a gradient descent algorithm to decrease the resultant objective function. It is empirically observed that its superiority is attributed to the novel min-max formulation and the new optimization. In this article, we propose to integrate the min-max learning paradigm adopted by SimpleMKKM into late fusion MVC (LF-MVC). This leads to a tri-level max-min-max optimization problem with respect to the perturbation matrices, weight coefficient, and clustering partition matrix. To solve this intractable max-min-max optimization problem, we design an efficient two-step alternative optimization strategy. Furthermore, we analyze the generalization clustering performance of the proposed algorithm from the theoretical perspective. Comprehensive experiments have been conducted to evaluate the proposed algorithm in terms of clustering accuracy (ACC), computation time, convergence, as well as the evolution of the learned consensus clustering matrix, clustering with different numbers of samples, and analysis of the learned kernel weight. The experimental results show that the proposed algorithm is able to significantly reduce the computation time and improve the clustering ACC when compared to several state-of-the-art LF-MVC algorithms. The code of this work is publicly released at: https://xinwangliu.github.io/Under-Review.