Research on Large-scale User Association Feature Data Visualization Based on Nonlinear Dimensionality Reduction Methods

In large-scale user data analysis, nonlinear correlations in high-dimensional features pose challenges to data reduction and visualization. This paper constructs a dimensionality reduction framework by optimizing the t-SNE algorithm's neighborhood preservation and UMAP's manifold learning. The framework integrates adaptive bandwidth selection with hierarchical sampling for high-fidelity feature mapping, and improves visualization clarity through enhanced force-oriented layouts and multi-level scaling. Testing with million-level datasets shows the improved method achieves 92.3% feature fidelity, 3.6× computing efficiency, 59.2% reduction in edge intersections, and 0.892 cluster integrity, providing efficient solutions for large-scale user feature analysis.

Authors

Publication Details

Published
2025-04-25
DOI
https://doi.org/10.1145/3745133.3745137
Primary Topic
Advanced Computing and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Large-scale User Association Feature Data Visualization Based on Nonlinear Dimensionality Reduction Methods

Xiuzhuo Wei, Bo Tang, Chunjie Wang, Huinan Zhao
Advanced Computing and Algorithms
article

Research on Large-scale User Association Feature Data Visualization Based on Nonlinear Dimensionality Reduction Methods

Xiuzhuo Wei, Bo Tang, Chunjie Wang, Huinan Zhao
article en

Abstract

In large-scale user data analysis, nonlinear correlations in high-dimensional features pose challenges to data reduction and visualization. This paper constructs a dimensionality reduction framework by optimizing the t-SNE algorithm's neighborhood preservation and UMAP's manifold learning. The framework integrates adaptive bandwidth selection with hierarchical sampling for high-fidelity feature mapping, and improves visualization clarity through enhanced force-oriented layouts and multi-level scaling. Testing with million-level datasets shows the improved method achieves 92.3% feature fidelity, 3.6× computing efficiency, 59.2% reduction in edge intersections, and 0.892 cluster integrity, providing efficient solutions for large-scale user feature analysis.

Openalex Percentile: Top 75%
Advanced Computing and Algorithms
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.