Unsupervised Ensemble Learning Improves Discriminability of Stochastic Neighbor Embedding

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The purpose of feature learning is to obtain effective representation of the raw data and then improve the performance of machine learning algorithms such as clustering or classification. Some of the existing feature learning algorithms use discriminant information in the data to improve the representation of data features, but the discrimination of the data feature representation is not enough. In order to further enhance the discrimination, discriminant feature learning based on t-distribution stochastic neighbor embedding guided by pairwise constraints (pcDTSNE) is proposed in this paper. pcDTSNE introduces pairwise constraints by clustering ensemble and uses these pairwise constraints to impose penalties on the objective function, which makes sample points in the mapping space present stronger discrimination. In order to verify the feature learning performance of pcDTSNE, extensive experiments are carried out on several public data sets. The experimental results show that the expression ability of data representation generated by pcDTSNE is further improved.

Cite

CITATION STYLE

APA

Wang, J., Zhao, H., Zhang, Y., Wang, H., & Guo, J. (2023). Unsupervised Ensemble Learning Improves Discriminability of Stochastic Neighbor Embedding. International Journal of Computational Intelligence Systems, 16(1). https://doi.org/10.1007/s44196-023-00203-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free