A Supervised Laplacian Eigenmap Algorithm for Visualization of Multi-label Data: SLE-ML
- 180 Downloads
A novel supervised Laplacian eigenmap algorithm is proposed especially aiming at visualization of multi-label data. Supervised Laplacian eigenmap algorithms proposed so far suffer from hardness in the setting of parameters or the lack of the ability of incorporating the label space information into the feature space information. Most of all, they cannot deal with multi-label data. To cope with these difficulties, we consider the neighborhood relationship between two samples both in the feature space and in the label space. As a result, multiple labels are consistently dealt with as the case of single labels. However, the proposed algorithm may produce apparent/fake separability of classes. To mitigate such a bad effect, we recommend to use two values of the parameter at once. The experiments demonstrated the advantages of the proposed method over the compared four algorithms in the visualization quality and understandability, and in the easiness of parameter setting.
KeywordsSupervised Laplacian eigenmap Multi-Label data Feature and label spaces
This work was partially supported by JSPS KAKENHI Grant Number 19H04128.
- 2.Costa, J.A., Hero, A.O.: Classification constrained dimensionality reduction. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, (ICASSP 2005), vol. 5, pp. v/1077–v/1080, March 2005Google Scholar
- 3.Dua, D., Graff, C.: UCI ML repository (2017). http://archive.ics.uci.edu/ml
- 4.Jiang, Q., Jia, M.: Supervised Laplacian eigenmaps for machinery fault classification. In: 2009 WRI World Congress on Computer Science and Information Engineering, vol. 7, pp. 116–120, March 2009. https://doi.org/10.1109/CSIE.2009.765