An Effective Clustering Optimization Method for Unsupervised Linear Discriminant Analysis

Quan Wang, Fei Wang, Fuji Ren, Zhongheng Li, Feiping Nie

Abstract

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.
BibTeX
@article{wang2023effective,
  author = {Quan Wang and Fei Wang and Fuji Ren and Zhongheng Li and Feiping Nie},
  title = {{An Effective Clustering Optimization Method for Unsupervised Linear Discriminant Analysis}},
  journal = {IEEE Trans. Knowl. Data Eng.},
  year = {2023},
  url = {https://openreview.net/forum?id=AkKc26sDda},
}

Loading related content...

Figure