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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

t-SNE Based on Hammersley Sequence Initialized Genghis Khan Shark Optimizer

Zan Yang, Lei Hou, Wei Nai, Dan Li et al.
Metaheuristic Optimization Algorithms Research
article

t-SNE Based on Hammersley Sequence Initialized Genghis Khan Shark Optimizer

Zan Yang, Lei Hou, Wei Nai, Dan Li, Jiashu Wang, Qing Guo
article en

Abstract

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.

Huzhou Normal University (CN)
Openalex Percentile: Top 96%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.