t-SNE Based on Hammersley Sequence Initialized Genghis Khan Shark Optimizer
Manifold learning is a nonlinear dimensionality reduction technique that preserves the original data features and obtains the intrinsic probability features and distribution structure of high-dimensional data through dimensionality reduction and simplification processing. t-distribution stochastic neighbor embedding (t-SNE) is an important algorithm in manifold learning that can visualize high-dimensional data by preserving the local probability distribution structure of the data in a low-dimensional space. However, the loss function of t-SNE is a strongly nonlinear non-convex function, and parameter optimization often faces difficulties in global optimization and high computational complexity, which limits the efficiency and scalability of the algorithm. To address these issues, in this paper, a derivative-free global optimization algorithm as well as a swarm intelligence method, namely Hammersley sequence initialized Genghis Khan shark optimizer (HSGKSO) has been proposed. The proposed algorithm can achieve stronger global search capability and faster convergence speed, and its effectiveness in finding the optimal solution of t-SNE loss function has been verified through numerical experiments.
Authors
- Zan Yang (ORCID: https://orcid.org/0000-0002-1813-1768)
- Lei Hou (ORCID: https://orcid.org/0000-0002-3589-8610)
- Wei Nai (ORCID: https://orcid.org/0000-0002-4656-7040)
- Dan Li (ORCID: https://orcid.org/0000-0001-5545-3574)
- Jiashu Wang (ORCID: https://orcid.org/0000-0001-7960-7718)
- Qing Guo (ORCID: https://orcid.org/0000-0001-5954-2179)
Institutions
- Huzhou Normal University (CN)
Publication Details
- Published
- 2025-03-14
- DOI
- https://doi.org/10.1109/itoec63606.2025.10968096
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00