# 降维遇见网络科学：UMAP的kNN图在数据理解中的应用

- 来源：Apple Machine Learning Research（RSS）
- 发布时间：2026-07-30 08:00
- AIHOT 分数：48
- AIHOT 链接：https://aihot.virxact.com/items/cms7t8rqq034propbg9bdfyg4
- 原文链接：https://machinelearning.apple.com/research/umap-knn-graph-sensemaking

## AI 摘要

Apple研究团队展示了UMAP内部kNN图在数据理解中的潜力，该图在原始高维空间编码数据流形。将PageRank、k-core分解和聚类系数等图算法应用于该图，可识别代表性数据点、揭示密集核心与稀疏边缘。在MNIST和Fashion MNIST上的评估表明，这些方法与k-medoids、HDBSCAN等专用方法具有竞争力或互补性。

## 正文

While UMAP is widely used for exploring high-dimensional data, typical workflows focus on its lower-dimensional embedding, largely overlooking the rich k-nearest-neighbor (kNN) graph that UMAP constructs internally. This graph encodes the data manifold in its original high-dimensional space, before the distortion that UMAP’s 2D projection introduces. We demonstrate the untapped potential of this internal representation, showing how standard graph algorithms applied to this graph enhance data sensemaking: (1) PageRank identifies representative data points, (2) k-core decomposition reveals dense core regions versus sparse periphery, and (3) clustering coefficient detects tight-knit neighborhoods with highly-similar data points. Through quantitative and qualitative evaluation on MNIST and Fashion MNIST, we show that these graph-based analyses are not only practical but also competitive with or complementary to purpose-built methods (e.g., k-medoids for exemplar selection, HDBSCAN for density-based clustering).

Related readings and updates.

Generative and Contrastive Graph Representation Learning

September 29, 2025research area Methods and Algorithms

Self-supervised learning (SSL) on graphs generates node and graph representations (i.e., embeddings) that can be used for downstream tasks such as node classification, node clustering, and link prediction. Graph SSL is particularly useful in scenarios with limited or no labeled data. Existing SSL methods predominantly follow contrastive or generative paradigms, each excelling in different tasks: contrastive methods typically perform well on…