ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

K-means聚类×半监督学习×投票集成 (Voting Ensemble)×
领域机器学习机器学习机器学习
方法族Machine learningMachine learningMachine learning
起源年份1967 (formalized 1982)1970s–2006 (formalized)1990s–2004
提出者MacQueen, J. B.; Lloyd, S. P.Vapnik, V. N. and others (community of researchers, 1970s–2000s)Lam & Suen; Kuncheva, L. I. (systematic treatment)
类型Partitional clusteringLearning paradigmEnsemble (combination of multiple classifiers by vote)
开创性文献Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
别名k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansSSL, semi-supervised machine learning, transductive learning, label-efficient learningmajority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
相关455
摘要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.Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained.A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: K-means · Semi-supervised Learning · Voting Ensemble. 于 2026-06-18 检索自 https://scholargate.app/zh/compare