1. Unsupervised Linear Discriminant Analysis for Jointly Clustering and Subspace Learning.
- Author
-
Wang, Fei, Wang, Quan, Nie, Feiping, Li, Zhongheng, Yu, Weizhong, and Wang, Rong
- Subjects
FISHER discriminant analysis ,CLUSTER analysis (Statistics) ,K-means clustering ,SUPERVISED learning ,KRYLOV subspace - Abstract
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. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF