ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

강건 K-평균 군집화×군집 분석×
분야통계학통계학
계열Latent structureLatent structure
기원 연도19971939–1967
창시자Cuesta-Albertos, Gordaliza & MatránRobert C. Tryon (early development); Ward (1963) for hierarchical; MacQueen (1967) for k-means
유형Robust partitional clusteringUnsupervised classification / grouping
원전Cuesta-Albertos, J. A., Gordaliza, A., & Matrán, C. (1997). Trimmed k-means: An attempt to robustify quantizers. The Annals of Statistics, 25(2), 553–576. DOI ↗Everitt, B. S., Landau, S., Leese, M. & Stahl, D. (2011). Cluster Analysis (5th ed.). Wiley. ISBN: 978-0470749913
별칭trimmed k-means, TCLUST k-means, contamination-resistant k-means, outlier-robust clusteringclustering, unsupervised classification, data clustering, numerical taxonomy
관련45
요약Robust K-means clustering is an extension of classical k-means that protects cluster estimates from distortion caused by outliers or contaminated observations. By trimming a user-specified fraction of the most extreme points before updating cluster centers, the algorithm yields stable, meaningful partitions even when the data contain atypical cases that would severely bias standard k-means.Cluster analysis is a family of unsupervised multivariate techniques that partition a set of objects or observations into internally homogeneous, mutually distinct groups — clusters — based on measured characteristics, without any prior knowledge of group membership. It is widely used in market segmentation, bioinformatics, psychology, and social science to reveal natural groupings in data.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Robust K-means Clustering · Cluster Analysis. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare