Quan Wang

Dr. Quan Wang

orcid

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
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.

2 November 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
QWQuan Wang
Quan Wang
FWFei Wang
Fei Wang
FUJI RENFUJI REN
FUJI REN
ZLZhongheng Li
Zhongheng Li
FNFeiping Nie
Feiping Nie
The recent work Unsupervised Linear Discriminant Analysis (Un-LDA) completes its clustering process during the alternating optimization by converting equivalently the objective and finally using the K-means algorithm. However, the K-means algorithm has its inherent drawbacks. It is hard for the K-means algorithm to deal well with some complex clustering cases where there are too many real clusters or non-convex clusters. In this paper, a novel clustering optimization method is presented to accomplish the clustering process in Un-LDA and the resulting method can be named Un-LDA(CD). Specifically, instead of the K-means algorithm, an elaborately designed coordinate descent algorithm is adopted to obtain the clusters after the objective function goes through a series of simple but deft equivalent conversions. Extensive experiments have demonstrated that the coordinate descent clustering solution for Un-LDA can outperform the original K-means based solution on the tested data sets especially those complex data sets with a pretty large number of real clusters.

17 October 2023 in Pattern Recognition
Verified
Journal Article
Closed access
QWQuan Wang
Quan Wang
FWFei Wang
Fei Wang
ZLZhongheng Li
Zhongheng Li
ZWZheng Wang
Zheng Wang
FNFeiping Nie
Feiping Nie

20 April 2023 in Information Sciences
Verified
Journal Article
Closed access
QWQuan Wang
Quan Wang
FWFei Wang
Fei Wang
ZLZhongheng Li
Zhongheng Li
PJPeilin Jiang
Peilin Jiang
FRFuji Ren
Fuji Ren
FNFeiping Nie
Feiping Nie

1 February 2020 in Neurocomputing
Verified
Journal Article
Closed access
FWFei Wang
Fei Wang
QWQuan Wang
Quan Wang
FNFeiping Nie
Feiping Nie
WYWeizhong Yu
Weizhong Yu
RWRong Wang
Rong Wang
ZLZhongheng Li
Zhongheng Li

22 January 2026 in Pattern Recognition
Verified
Journal Article
Closed access
QWQuan Wang
Quan Wang
HLHao Lei
Hao Lei
FWFei Wang
Fei Wang
XWXinpei Wen
Xinpei Wen
ZLZhiping Lin
Zhiping Lin
FNFeiping Nie
Feiping Nie