{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:03:07Z","timestamp":1775664187955,"version":"3.50.1"},"reference-count":34,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100008982","name":"Qatar National Research Fund","doi-asserted-by":"crossref","award":["GSRA9-L-1-0512-22011"],"award-info":[{"award-number":["GSRA9-L-1-0512-22011"]}],"id":[{"id":"10.13039\/100008982","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MAKE"],"abstract":"<jats:p>A popular method for projecting high-dimensional data onto a lower-dimensional space while preserving the integrity of its structure is t-distributed Stochastic Neighbor Embedding (t-SNE). This technique minimizes the Kullback\u2013Leibler (KL) divergence to align the similarities between points in the original and reduced spaces. While t-SNE is highly effective, it prioritizes local neighborhood preservation, which results in limited separation between distant clusters and inadequate representation of global relationships. To improve these limitations, this work introduces two complementary approaches: (1) The Max-Flipped KL Divergence (KLmax) modifies the original divergence by incorporating a contrastive term, KL\u2032, which enhances the ranking of point similarities through maximum similarity constraints. (2) The KL-Wasserstein Loss (LKL\u2212W) combines the KL divergence with the classic Wasserstein distance, allowing the embedding to benefit from the smooth and geometry-aware transport properties of Wasserstein metrics. Experimental results show that these methods lead to improved separation and better structural clarity in the low-dimensional space compared to standard t-SNE.<\/jats:p>","DOI":"10.3390\/make8020047","type":"journal-article","created":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T09:22:46Z","timestamp":1771406566000},"page":"47","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Novel Loss Functions for Improved Data Visualization in t-SNE"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8279-2771","authenticated-orcid":false,"given":"Sara","family":"Nassar","sequence":"first","affiliation":[{"name":"College of Science and Engineering, Hamad Bin Khalifa University, Education City, Gate 8, Doha P.O. Box 5825, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9065-9591","authenticated-orcid":false,"given":"Rachid","family":"Hedjam","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Bishop\u2019s University, 2600 College Street, Sherbrooke, QC J1M 1Z7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2336-0490","authenticated-orcid":false,"given":"Samir Brahim","family":"Belhaouari","sequence":"additional","affiliation":[{"name":"College of Science and Engineering, Hamad Bin Khalifa University, Education City, Gate 8, Doha P.O. Box 5825, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,2,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1080\/14786440109462720","article-title":"LIII. On lines and planes of closest fit to systems of points in space","volume":"2","author":"Pearson","year":"1901","journal-title":"Lond. Edinb. Dublin Philos. Mag. J. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J., and Melville, J. (2018). Umap: Uniform manifold approximation and projection for dimension reduction. arXiv.","DOI":"10.21105\/joss.00861"},{"key":"ref_3","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Hinton","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref_4","first-page":"17370","article-title":"F-divergence variational inference","volume":"33","author":"Wan","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_5","unstructured":"Arora, S., Hu, W., and Kothari, P.K. (2018, January 6\u20139). An analysis of the t-SNE algorithm for data visualization. Proceedings of the Conference on Learning Theory, Stockholm, Sweden."},{"key":"ref_6","unstructured":"Im, D.J., Verma, N., and Branson, K. (2018). Stochastic neighbor embedding under f-divergences. arXiv."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Yao, W., Yang, W., Wang, Z., Lin, Y., and Liu, Y. (2025). Revisiting weak-to-strong generalization in theory and practice: Reverse KL vs. Forward KL. arXiv.","DOI":"10.18653\/v1\/2025.findings-acl.148"},{"key":"ref_8","unstructured":"Yang, Z., Chen, Y., and Corander, J. (2021). t-SNE is not optimized to reveal clusters in data. arXiv."},{"key":"ref_9","unstructured":"Naderializadeh, N., Li, R., Xiao, D., Shrivastava, A., and Soatto, R. (2021). Set representation learning with generalized sliced-Wasserstein embeddings. arXiv."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MSP.2017.2695801","article-title":"Optimal mass transport: Signal processing and machine-learning applications","volume":"34","author":"Kolouri","year":"2017","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_11","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume":"26","author":"Cuturi","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_12","first-page":"3440","article-title":"Stochastic optimization for large-scale optimal transport","volume":"29","author":"Genevay","year":"2016","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_13","unstructured":"Seguy, V., Damodaran, B.B., Flamary, R., Courty, N., Rolet, A., and Blondel, M. (2017). Large-scale optimal transport and mapping estimation. arXiv."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"111042","DOI":"10.1016\/j.jfa.2025.111042","article-title":"Regularity theory and geometry of unbalanced optimal transport","volume":"289","author":"Ghezzi","year":"2025","journal-title":"J. Funct. Anal."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5449","DOI":"10.1109\/TPAMI.2024.3366769","article-title":"From simple to complex scenes: Learning robust feature representations for accurate human parsing","volume":"46","author":"Liu","year":"2024","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_16","first-page":"7457","article-title":"Light-field image multiple reversible robust watermarking against geometric attacks","volume":"32","author":"Gao","year":"2022","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_17","first-page":"1","article-title":"Understanding how dimension reduction tools work: An empirical approach to deciphering t-SNE, UMAP, TriMap, and PaCMAP for data visualization","volume":"22","author":"Wang","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1162\/neco_a_01504","article-title":"Using global t-SNE to preserve intercluster data structure","volume":"34","author":"Zhou","year":"2022","journal-title":"Neural Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5416","DOI":"10.1038\/s41467-019-13056-x","article-title":"The art of using t-SNE for single-cell transcriptomics","volume":"10","author":"Kobak","year":"2019","journal-title":"Nat. Commun."},{"key":"ref_20","unstructured":"Villani, C. (2008). Optimal Transport: Old and New, Springer Science & Business Media."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1002\/cpa.3160440402","article-title":"Polar factorization and monotone rearrangement of vector-valued functions","volume":"44","author":"Brenier","year":"1991","journal-title":"Commun. Pure Appl. Math."},{"key":"ref_22","first-page":"199","article-title":"On the translocation of masses","volume":"37","author":"Kantorovich","year":"1942","journal-title":"Dokl. Akad. Nauk. USSR (NS)"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1561\/2200000073","article-title":"Computational optimal transport: With applications to data science","volume":"11","author":"Cuturi","year":"2019","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_24","first-page":"2","article-title":"Pen-based recognition of handwritten digits data set","volume":"4","author":"Alpaydin","year":"1998","journal-title":"Mach. Learn. Repos."},{"key":"ref_25","unstructured":"LeCun, Y. (2025, November 18). The MNIST Database of Handwritten Digits. Available online: http:\/\/yann.lecun.com\/exdb\/mnist\/."},{"key":"ref_26","unstructured":"Xiao, H., Rasul, K., and Vollgraf, R. (2017). Fashion-MNIST: A Novel Image Dataset for Benchmarking Machine Learning Algorithms. arXiv."},{"key":"ref_27","unstructured":"Nene, A., Nayar, K., and Murase, H. (1996). Columbia Object Image Library (COIL-20), Columbia University. Tech. Rep."},{"key":"ref_28","unstructured":"AT&T Laboratories Cambridge (1994). The Database of Faces (Olivetti\/ORL Faces), AT&T Laboratories Cambridge."},{"key":"ref_29","unstructured":"Van Rijsbergen, C. (1979, January 4\u20137). Information retrieval: Theory and practice. Proceedings of the Joint IBM\/University of Newcastle upon Tyne Seminar on Data Base Systems, Suita, Japan."},{"key":"ref_30","unstructured":"Powers, D.M.W. (2015). What the F-measure doesn\u2019t measure: Features, flaws, fallacies and fixes. arXiv."},{"key":"ref_31","first-page":"583","article-title":"Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions","volume":"3","author":"Strehl","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","volume":"PAMI-1","author":"Davies","year":"2009","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1080\/01621459.1951.10500769","article-title":"The Kolmogorov\u2013Smirnov Test for Goodness of Fit","volume":"46","author":"Massey","year":"1951","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","article-title":"On a test of whether one of two random variables is stochastically larger than the other","volume":"18","author":"Mann","year":"1947","journal-title":"Ann. Math. Stat."}],"container-title":["Machine Learning and Knowledge Extraction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-4990\/8\/2\/47\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T05:11:16Z","timestamp":1771564276000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-4990\/8\/2\/47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,18]]},"references-count":34,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["make8020047"],"URL":"https:\/\/doi.org\/10.3390\/make8020047","relation":{},"ISSN":["2504-4990"],"issn-type":[{"value":"2504-4990","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,18]]}}}