arXiv:2606. 04451v1 Announce Type: new Abstract: Neighbor embedding algorithms reveal correlations in high-dimensional data by constructing an equivalent graph representation in a lower-dimensional space.
By Mohammad Tariqul Islam, Jason W. Fleischer
arXiv:2509. 03373v2 Announce Type: replace Abstract: Dimensionality reduction methods such as t-SNE and UMAP are popular methods for visualizing data with a potential (latent) clustered structure.
By Elizabeth Coda, Ery Arias-Castro, Gal Mishne
arXiv:2605. 23540v2 Announce Type: replace Abstract: Dimensionality Reduction (DR) methods are widely used to visualize high-dimensional data.
By Diede P. M. van der Hoorn, Alessio Arleo, Fernando V. Paulovich
arXiv:2608. 06990v1 Announce Type: cross Abstract: Clustering is a fundamental data mining technique for pattern recognition through unsupervised learning.
By Yuning Yu, Jos\'e Rodr\'iguez-Pi\~neiro, Xuefeng Yin, Bin Feng
arXiv:2604.02535v2 Announce Type: replace
Abstract: Dimensionality reduction (DR) involves two longstanding trade-offs. First, preserving local neighborhoods can come at the cost of global structure....
By Zeyang Huang, Angelos Chatzimparmpas, Thomas H\"ollt, Takanori Fujiwara
arXiv:2507.23559v2 Announce Type: replace-cross
Abstract: Certain data are naturally modeled by networks or weighted graphs, be they biological networks or mobility networks. When there is no canonic...
By Elodie Maignant, Xavier Pennec, Alain Trouv\'e, Anna Calissano