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.

Robust k-means×Phân cụm phân cấp×Phân cụm K-means×
Lĩnh vựcHọc máyHọc máyHọc máy
HọMachine learningMachine learningMachine learning
Năm ra đời199919631967 (formalized 1982)
Người khởi xướngGarcia-Escudero, L. A. & Gordaliza, A.Ward, J. H.MacQueen, J. B.; Lloyd, S. P.
LoạiRobust clustering algorithmUnsupervised clustering (agglomerative)Partitional clustering
Công trình gốcGarcia-Escudero, L. A., & Gordaliza, A. (1999). Robustness properties of k-means and trimmed k-means. Journal of the American Statistical Association, 94(447), 956–969. DOI ↗Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗
Tên gọi khácrobust k-means clustering, trimmed k-means, outlier-resistant k-means, RKMHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Liên quan444
Tóm tắtRobust k-means is a variant of classical k-means clustering designed to resist the influence of outliers. By trimming a specified fraction of the most extreme observations before computing cluster centers, it produces stable and meaningful partitions even when the data contain noise, contamination, or heavy-tailed distributions — situations where standard k-means breaks down.Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.
ScholarGateBộ dữ liệu
  1. v1
  2. 2 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 1 Nguồn tài liệu
  3. PUBLISHED
  1. v1
  2. 2 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: Robust k-means · Hierarchical Clustering · K-means. Truy cập ngày 2026-06-20 từ https://scholargate.app/vi/compare