ScholarGate
Trợ lý

So sánh phương pháp

Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.

Lan truyền nhãn×Phân cụm phổ×
Lĩnh vựcHọc máyHọc máy
HọMachine learningMachine learning
Năm ra đời20022002
Người khởi xướngZhu, X. & Ghahramani, Z.Ng, A. Y.; Jordan, M. I.; Weiss, Y.
LoạiGraph-based semi-supervised classificationGraph-based clustering (spectral method)
Công trình gốcZhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856. link ↗
Tên gọi khácLP, label spreading, graph-based semi-supervised learning, harmonic label propagationNJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
Liên quan35
Tóm tắtLabel Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate.
ScholarGateBộ dữ liệu
  1. v1
  2. 3 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 3 Nguồn tài liệu
  3. PUBLISHED

Đến trang tìm kiếm Tải xuống bản trình chiếu

ScholarGateSo sánh phương pháp: Label Propagation · Spectral Clustering. Truy cập ngày 2026-06-18 từ https://scholargate.app/vi/compare