Book chapter · 2025
t-Distributed stochastic neighbor embedding
Elsevier eBooks, 187–207 · Published 1 January 2025 · DOI 10.1016/b978-0-44-332818-3.00017-4
In brief
“t-Distributed stochastic neighbor embedding” is a 2025 book chapter by Mohammad Akhavan Anvari and 2 co-authors, published in Elsevier eBooks. OpenAlex counts 9 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 9
- Most cited in
- 2026 (8)
- Field-weighted impact
- 14.18
- References
- 11
- Authors
- 3
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Anvari, M. A., Rahmati, D., & Kumar, S. (2025). t-Distributed stochastic neighbor embedding. Elsevier eBooks, 187–207. https://doi.org/10.1016/b978-0-44-332818-3.00017-4
MLA 9
Anvari, Mohammad Akhavan, et al. “t-Distributed stochastic neighbor embedding.” Elsevier eBooks, 2025, pp. 187–207. https://doi.org/10.1016/b978-0-44-332818-3.00017-4.
Chicago
Anvari, Mohammad Akhavan, Dara Rahmati, and Sunil Kumar. 2025. “t-Distributed stochastic neighbor embedding.” Elsevier eBooks: 187–207. https://doi.org/10.1016/b978-0-44-332818-3.00017-4.
Harvard
Anvari, M. A., Rahmati, D. and Kumar, S. (2025) ‘t-Distributed stochastic neighbor embedding’, Elsevier eBooks, pp. 187–207. doi:10.1016/b978-0-44-332818-3.00017-4.
IEEE
M. A. Anvari, D. Rahmati, and S. Kumar, “t-Distributed stochastic neighbor embedding,” Elsevier eBooks, pp. 187–207, 2025, doi: 10.1016/b978-0-44-332818-3.00017-4.
BibTeX
@incollection{anvari2025distributed,
title = {{t-Distributed stochastic neighbor embedding}},
author = {Anvari, Mohammad Akhavan and Rahmati, Dara and Kumar, Sunil},
booktitle = {Elsevier eBooks},
publisher = {Elsevier BV},
year = {2025},
pages = {187--207},
doi = {10.1016/b978-0-44-332818-3.00017-4},
url = {https://doi.org/10.1016/b978-0-44-332818-3.00017-4}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- t-SNE
- dimensionality reduction
- high-dimensional data visualization
- pairwise similarity
- divergence minimization
- local structure preservation
- low-dimensional embedding
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Anvari, M. A., Rahmati, D., & Kumar, S. (2025). t-Distributed stochastic neighbor embedding. Elsevier eBooks, 187–207. https://doi.org/10.1016/b978-0-44-332818-3.00017-4
How many times has this paper been cited?
9 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Mohammad Akhavan Anvari, Dara Rahmati, Sunil Kumar.
What is the DOI of this paper?
10.1016/b978-0-44-332818-3.00017-4, permanently at https://doi.org/10.1016/b978-0-44-332818-3.00017-4. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.