Weizhong Yu

Weizhong Yu

Auto-generated profile, based on publicly available information

Weizhong Yu

School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xian, Shaanxi, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
23 December 2020 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
BYBen Yang
Ben Yang
XZXuetao Zhang
Xuetao Zhang
FNFeiping Nie
Feiping Nie
FWFei Wang
Fei Wang
WYWeizhong Yu
Weizhong Yu
RWRong Wang
Rong Wang
The rapid growth of the number of data brings great challenges to clustering, especially the introduction of multi-view data, which collected from multiple sources or represented by multiple features, makes these challenges more arduous. How to clustering large-scale data efficiently has become the hottest topic of current large-scale clustering tasks. Although several accelerated multi-view methods have been proposed to improve the efficiency of clustering large-scale data, they still cannot be applied to some scenarios that require high efficiency because of the high computational complexity. To cope with the issue of high computational complexity of existing multi-view methods when dealing with large-scale data, a fast multi-view clustering model via nonnegative and orthogonal factorization (FMCNOF) is proposed in this paper. Instead of constraining the factor matrices to be nonnegative as traditional nonnegative and orthogonal factorization (NOF), we constrain a factor matrix of this model to be cluster indicator matrix which can assign cluster labels to data directly without extra post-processing step to extract cluster structures from the factor matrix. Meanwhile, the F-norm instead of the L2-norm is utilized on the FMCNOF model, which makes the model very easy to optimize. Furthermore, an efficient optimization algorithm is proposed to solve the FMCNOF model. Different from the traditional NOF optimization algorithm requiring dense matrix multiplications, our algorithm can divide the optimization problem into three decoupled small size subproblems that can be solved by much less matrix multiplications. Combined with the FMCNOF model and the corresponding fast optimization method, the efficiency of the clustering process can be significantly improved, and the computational complexity is nearly O(n). Extensive experiments on various benchmark data sets validate our approach can greatly improve the efficiency when achieve acceptable performance.

25 September 2023 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
FNFeiping Nie
Feiping Nie
JXJingjing Xue
Jingjing Xue
WYWeizhong Yu
Weizhong Yu
XLXuelong Li
Xuelong Li
Clustering aims to partition a set of objects into different groups through the internal nature of these objects. Most existing methods face intractable hyper-parameter problems triggered by various regularization terms, which degenerates the applicability of models. Moreover, traditional graph clustering methods always encounter the expensive time overhead. To this end, we propose a Fast Clustering model with Anchor Guidance (FCAG). The proposed model can not only avoid trivial solutions without extra regularization terms, but also be suitable to deal with large-scale problems by utilizing the prior knowledge of the bipartite graph. Moreover, the proposed FCAG can cope with out-of-sample extension problems. Three optimization methods Projected Gradient Descent (PGD) method, Iteratively Re-Weighted (IRW) algorithm and Coordinate Descent (CD) algorithm are proposed to solve FCAG. Extensive experiments verify the superiority of the optimization method CD. Besides, compared with other bipartite graph models, FCAG has the better performance with the less time cost. In addition, we prove through theory and experiment that when the learning rate of PGD tends to infinite, PGD is equivalent to IRW. The code is uploaded on the website: https://github.com/Sara-Jingjing-Xue/2023TPAMI-FCAG .

18 August 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
WYWeizhong Yu
Weizhong Yu
LXLiyin Xing
Liyin Xing
FNFeiping Nie
Feiping Nie
XLXuelong Li
Xuelong Li
With the development of information technology, a large number of multi-view data has emerged, which makes multi-view clustering algorithms considerably attractive. Previous graph-based multi-view clustering methods usually contain two steps: 1) obtaining the fusion graph or spectral embedding of all views; 2) performing clustering algorithms. The two-step process cannot obtain optimal results since the two steps cannot negotiate with each other. To address this drawback, a novel algorithm named as Multi-View Fuzzy Clustering Based on Anchor Graph (MVFCAG) is presented. The proposed method can simultaneously obtain the membership matrix and minimize the disagreement rates of different views. A novel regularization based on trace norm is also presented in the article, which can not only obtain a clear clustering partition to prevent that all samples belonging to each cluster with the same membership value $\frac{1}{c}$ , but also balance the size of each cluster. Moreover, we exploit the re-weighted method to optimize the proposed model, which can introduce an adaptive weight to each view to deal with the unreliable views. A series of experiments are conducted on different datasets, and the clustering performance verifies the effectiveness and efficiency of the proposed algorithm.

4 September 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
FWFei Wang
Fei Wang
QWQuan Wang
Quan Wang
FNFeiping Nie
Feiping Nie
ZLZhongheng Li
Zhongheng Li
WYW Yu
W Yu
RWRong Wang
Rong Wang
Linear discriminant analysis (LDA) is one of commonly used supervised subspace learning methods. However, LDA will be powerless faced with the no-label situation. In this paper, the unsupervised LDA (Un-LDA) is proposed and first formulated as a seamlessly unified objective optimization which guarantees convergence during the iteratively alternative solving process. The objective optimization is in both the ratio trace and the trace ratio forms, forming a complete framework of a new approach to jointly clustering and unsupervised subspace learning. The extension of LDA into Un-LDA enables to not only complete unsupervised subspace learning via the explicitly presented subspace projection matrix but also simultaneously finish clustering and even clustering out-of-sample data via the explicitly presented transformation matrix. To overcome the difficulty in solving the non-convex objective optimization, we mathematically prove that the Un-LDA optimization in both forms can be transformed into the simple K-means clustering optimization when the subspace is determined. The Un-LDA optimization is eventually completed by alternatively optimizing the clusters using K-means and the subspace using the supervised LDA methods and iterating this whole process until convergence or stopping criterion. The experiments demonstrate that our proposed Un-LDA algorithms are comparable or even much superior to the counterparts.

21 March 2023 in Information Sciences
Verified
Journal Article
Closed access
QCQiang Chen
Qiang Chen
WYWeizhong Yu
Weizhong Yu
XZXiaowei Zhao
Xiaowei Zhao
FNFeiping Nie
Feiping Nie
XLXuelong Li
Xuelong Li

19 January 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
FNFeiping Nie
Feiping Nie
QCQiang Chen
Qiang Chen
WYWeizhong Yu
Weizhong Yu
XLXuelong Li
Xuelong Li
In this paper, we propose a novel algorithm to solve the row-sparse principal component analysis problem without relying on any data structure assumption. Sparse principal component analysis was proposed to improve the interpretability of principal component analysis by restricting the number of non-zero elements in each loading vector, but the varying sparsity patterns among different leading vectors may result in trouble on some occasions, such as feature selection. Then row-sparse principal component analysis was proposed, which demands the same sparse pattern among different loading vectors. However, the optimization of row-sparse principal component analysis problems is NP-hard. Although some algorithms were proposed to solve this problem, but they are only applicable to the specific data structure. In this paper, we transform the original row-sparse principal component analysis problem into a new equivalent problem that can be solved by coordinate descent method without relying on any data structure assumption. Then by carefully eliminating redundant structures to avoid repeating computation, we propose a more efficient coordinate descent method to solve this problem. Furthermore, no parameter needs to be tuned in our algorithm. Finally, extensive experiments are conducted on the real world data sets to demonstrate the superiority of our algorithm.