Shared subspace least squares multi-label linear discriminant analysis
- Publication Type:
- Journal Article
- Applied Intelligence, 2019
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is new to OPUS and is not currently available.
© 2019, Springer Science+Business Media, LLC, part of Springer Nature. Multi-label linear discriminant analysis (MLDA) has been explored for multi-label dimension reduction. However, MLDA involves dense matrices eigen-decomposition which is known to be computationally expensive for large-scale problems. In this paper, we show that the formulation of MLDA can be equivalently casted as a least squares problem so as to significantly reduce the computation burden and scale to the data collections with higher dimension. Further, it is also found that appealing regularization techniques can be incorporated into the least-squares model to boost generalization accuracy. Experimental results on several popular multi-label benchmarks not only verify the established equivalence relationship, but also demonstrate the effectiveness and efficiency of our proposed algorithms.
Please use this identifier to cite or link to this item: